./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-sre-symm.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/chl-sre-symm.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 a063462cb7b21c5f8dae2503e70fbd4d55b33be159df87fb06824a6d79ada34a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:31:27,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:31:27,811 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:31:27,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:31:27,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:31:27,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:31:27,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:31:27,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:31:27,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:31:27,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:31:27,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:31:27,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:31:27,845 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:31:27,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:31:27,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:31:27,845 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:31:27,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:31:27,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:31:27,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:31:27,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:31:27,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:31:27,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:31:27,846 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:31:27,847 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:31:27,847 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:31:27,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:31:27,847 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:31:27,847 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:31:27,847 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:31:27,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:31:27,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:31:27,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:31:27,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:31:27,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:31:27,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:31:27,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:31:27,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:31:27,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:31:27,849 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:31:27,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:31:27,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:31:27,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:31:27,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:31:27,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:31:27,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:31:27,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:31:27,850 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 -> a063462cb7b21c5f8dae2503e70fbd4d55b33be159df87fb06824a6d79ada34a [2025-01-09 21:31:28,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:31:28,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:31:28,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:31:28,146 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:31:28,147 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:31:28,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-sre-symm.wvr.c [2025-01-09 21:31:29,422 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ddbf0c93c/d6cd7cee4e9047feb07ba1b444d0ea03/FLAG77b436884 [2025-01-09 21:31:29,665 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:31:29,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-sre-symm.wvr.c [2025-01-09 21:31:29,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ddbf0c93c/d6cd7cee4e9047feb07ba1b444d0ea03/FLAG77b436884 [2025-01-09 21:31:29,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ddbf0c93c/d6cd7cee4e9047feb07ba1b444d0ea03 [2025-01-09 21:31:29,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:31:29,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:31:29,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:31:29,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:31:29,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:31:29,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:31:29" (1/1) ... [2025-01-09 21:31:29,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cac2a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:29, skipping insertion in model container [2025-01-09 21:31:29,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:31:29" (1/1) ... [2025-01-09 21:31:29,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:31:29,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:31:29,894 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:31:29,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:31:29,931 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:31:29,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:29 WrapperNode [2025-01-09 21:31:29,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:31:29,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:31:29,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:31:29,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:31:29,941 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:31:29" (1/1) ... [2025-01-09 21:31:29,952 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:31:29" (1/1) ... [2025-01-09 21:31:29,974 INFO L138 Inliner]: procedures = 20, calls = 12, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 85 [2025-01-09 21:31:29,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:31:29,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:31:29,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:31:29,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:31:29,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:29" (1/1) ... [2025-01-09 21:31:29,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:29" (1/1) ... [2025-01-09 21:31:29,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:29" (1/1) ... [2025-01-09 21:31:29,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:29" (1/1) ... [2025-01-09 21:31:29,994 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:29" (1/1) ... [2025-01-09 21:31:29,995 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:29" (1/1) ... [2025-01-09 21:31:29,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:29" (1/1) ... [2025-01-09 21:31:29,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:29" (1/1) ... [2025-01-09 21:31:30,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:29" (1/1) ... [2025-01-09 21:31:30,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:31:30,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:31:30,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:31:30,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:31:30,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:29" (1/1) ... [2025-01-09 21:31:30,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:31:30,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:31:30,043 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:31:30,047 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:31:30,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:31:30,071 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:31:30,071 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:31:30,071 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:31:30,071 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:31:30,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:31:30,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:31:30,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:31:30,072 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:31:30,154 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:31:30,156 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:31:30,444 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:31:30,444 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:31:30,463 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:31:30,463 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:31:30,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:31:30 BoogieIcfgContainer [2025-01-09 21:31:30,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:31:30,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:31:30,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:31:30,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:31:30,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:31:29" (1/3) ... [2025-01-09 21:31:30,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129294b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:31:30, skipping insertion in model container [2025-01-09 21:31:30,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:29" (2/3) ... [2025-01-09 21:31:30,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129294b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:31:30, skipping insertion in model container [2025-01-09 21:31:30,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:31:30" (3/3) ... [2025-01-09 21:31:30,474 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-sre-symm.wvr.c [2025-01-09 21:31:30,488 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:31:30,490 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-sre-symm.wvr.c that has 3 procedures, 152 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-01-09 21:31:30,491 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:31:30,588 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:31:30,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 159 transitions, 332 flow [2025-01-09 21:31:30,699 INFO L124 PetriNetUnfolderBase]: 8/157 cut-off events. [2025-01-09 21:31:30,703 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:31:30,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 157 events. 8/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 141 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2025-01-09 21:31:30,711 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 159 transitions, 332 flow [2025-01-09 21:31:30,718 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 137 transitions, 286 flow [2025-01-09 21:31:30,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:31:30,734 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;@545efe90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:31:30,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-09 21:31:30,741 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:31:30,741 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-01-09 21:31:30,741 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:31:30,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:30,742 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:30,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:31:30,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:30,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1547282207, now seen corresponding path program 1 times [2025-01-09 21:31:30,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:30,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871072721] [2025-01-09 21:31:30,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:30,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:30,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 21:31:30,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 21:31:30,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:30,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:30,900 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:31:30,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:30,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871072721] [2025-01-09 21:31:30,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871072721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:30,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:30,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:30,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166775174] [2025-01-09 21:31:30,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:30,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:30,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:30,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:30,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:30,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 159 [2025-01-09 21:31:30,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 137 transitions, 286 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:31:30,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:30,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 159 [2025-01-09 21:31:30,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:31,050 INFO L124 PetriNetUnfolderBase]: 12/207 cut-off events. [2025-01-09 21:31:31,054 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-09 21:31:31,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 207 events. 12/207 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 480 event pairs, 5 based on Foata normal form. 2/171 useless extension candidates. Maximal degree in co-relation 137. Up to 21 conditions per place. [2025-01-09 21:31:31,058 INFO L140 encePairwiseOnDemand]: 154/159 looper letters, 10 selfloop transitions, 2 changer transitions 2/134 dead transitions. [2025-01-09 21:31:31,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 134 transitions, 304 flow [2025-01-09 21:31:31,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2025-01-09 21:31:31,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9182389937106918 [2025-01-09 21:31:31,077 INFO L175 Difference]: Start difference. First operand has 138 places, 137 transitions, 286 flow. Second operand 3 states and 438 transitions. [2025-01-09 21:31:31,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 134 transitions, 304 flow [2025-01-09 21:31:31,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 134 transitions, 296 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:31:31,089 INFO L231 Difference]: Finished difference. Result has 135 places, 132 transitions, 272 flow [2025-01-09 21:31:31,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=133, 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=272, PETRI_PLACES=135, PETRI_TRANSITIONS=132} [2025-01-09 21:31:31,097 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -3 predicate places. [2025-01-09 21:31:31,098 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 132 transitions, 272 flow [2025-01-09 21:31:31,099 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:31:31,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:31,099 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] [2025-01-09 21:31:31,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:31:31,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:31:31,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2144134985, now seen corresponding path program 1 times [2025-01-09 21:31:31,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:31,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422745395] [2025-01-09 21:31:31,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:31,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:31,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:31:31,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:31:31,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:31,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:31,193 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:31:31,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:31,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422745395] [2025-01-09 21:31:31,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422745395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:31,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:31,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:31,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745847749] [2025-01-09 21:31:31,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:31,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:31,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:31,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:31,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:31,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 159 [2025-01-09 21:31:31,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 132 transitions, 272 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:31:31,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:31,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 159 [2025-01-09 21:31:31,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:31,297 INFO L124 PetriNetUnfolderBase]: 11/175 cut-off events. [2025-01-09 21:31:31,300 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:31:31,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 175 events. 11/175 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 361 event pairs, 5 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 178. Up to 21 conditions per place. [2025-01-09 21:31:31,302 INFO L140 encePairwiseOnDemand]: 156/159 looper letters, 10 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2025-01-09 21:31:31,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 131 transitions, 294 flow [2025-01-09 21:31:31,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2025-01-09 21:31:31,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9140461215932913 [2025-01-09 21:31:31,308 INFO L175 Difference]: Start difference. First operand has 135 places, 132 transitions, 272 flow. Second operand 3 states and 436 transitions. [2025-01-09 21:31:31,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 131 transitions, 294 flow [2025-01-09 21:31:31,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 131 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:31,315 INFO L231 Difference]: Finished difference. Result has 132 places, 131 transitions, 270 flow [2025-01-09 21:31:31,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=132, PETRI_TRANSITIONS=131} [2025-01-09 21:31:31,316 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -6 predicate places. [2025-01-09 21:31:31,316 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 131 transitions, 270 flow [2025-01-09 21:31:31,317 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:31:31,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:31,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:31,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:31:31,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:31:31,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:31,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1914111960, now seen corresponding path program 1 times [2025-01-09 21:31:31,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:31,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203701961] [2025-01-09 21:31:31,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:31,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:31,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:31:31,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:31:31,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:31,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:31,402 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:31:31,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:31,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203701961] [2025-01-09 21:31:31,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203701961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:31,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:31,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:31,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126973654] [2025-01-09 21:31:31,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:31,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:31,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:31,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:31,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:31,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 159 [2025-01-09 21:31:31,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 131 transitions, 270 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:31:31,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:31,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 159 [2025-01-09 21:31:31,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:31,476 INFO L124 PetriNetUnfolderBase]: 23/239 cut-off events. [2025-01-09 21:31:31,477 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:31:31,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 239 events. 23/239 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 634 event pairs, 9 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 251. Up to 36 conditions per place. [2025-01-09 21:31:31,481 INFO L140 encePairwiseOnDemand]: 154/159 looper letters, 12 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2025-01-09 21:31:31,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 131 transitions, 299 flow [2025-01-09 21:31:31,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2025-01-09 21:31:31,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9224318658280922 [2025-01-09 21:31:31,484 INFO L175 Difference]: Start difference. First operand has 132 places, 131 transitions, 270 flow. Second operand 3 states and 440 transitions. [2025-01-09 21:31:31,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 131 transitions, 299 flow [2025-01-09 21:31:31,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 131 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:31,490 INFO L231 Difference]: Finished difference. Result has 130 places, 130 transitions, 274 flow [2025-01-09 21:31:31,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=130, PETRI_TRANSITIONS=130} [2025-01-09 21:31:31,491 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -8 predicate places. [2025-01-09 21:31:31,491 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 130 transitions, 274 flow [2025-01-09 21:31:31,494 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:31:31,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:31,494 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] [2025-01-09 21:31:31,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:31:31,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:31:31,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:31,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1215578614, now seen corresponding path program 1 times [2025-01-09 21:31:31,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:31,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681449246] [2025-01-09 21:31:31,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:31,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:31,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:31:31,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:31:31,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:31,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:31,568 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:31:31,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:31,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681449246] [2025-01-09 21:31:31,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681449246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:31,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:31,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:31,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132341354] [2025-01-09 21:31:31,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:31,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:31,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:31,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:31,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:31,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 159 [2025-01-09 21:31:31,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 274 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:31:31,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:31,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 159 [2025-01-09 21:31:31,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:31,650 INFO L124 PetriNetUnfolderBase]: 26/269 cut-off events. [2025-01-09 21:31:31,650 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:31:31,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 269 events. 26/269 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 855 event pairs, 8 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 263. Up to 36 conditions per place. [2025-01-09 21:31:31,653 INFO L140 encePairwiseOnDemand]: 154/159 looper letters, 12 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2025-01-09 21:31:31,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 130 transitions, 303 flow [2025-01-09 21:31:31,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:31,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2025-01-09 21:31:31,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9224318658280922 [2025-01-09 21:31:31,655 INFO L175 Difference]: Start difference. First operand has 130 places, 130 transitions, 274 flow. Second operand 3 states and 440 transitions. [2025-01-09 21:31:31,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 130 transitions, 303 flow [2025-01-09 21:31:31,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 130 transitions, 303 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:31,660 INFO L231 Difference]: Finished difference. Result has 130 places, 129 transitions, 282 flow [2025-01-09 21:31:31,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=130, PETRI_TRANSITIONS=129} [2025-01-09 21:31:31,662 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -8 predicate places. [2025-01-09 21:31:31,663 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 129 transitions, 282 flow [2025-01-09 21:31:31,663 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:31:31,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:31,664 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:31:31,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:31:31,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:31:31,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:31,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1023740721, now seen corresponding path program 1 times [2025-01-09 21:31:31,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:31,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061072836] [2025-01-09 21:31:31,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:31,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:31,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:31:31,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:31:31,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:31,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:31,743 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:31:31,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:31,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061072836] [2025-01-09 21:31:31,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061072836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:31,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:31,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:31,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627584891] [2025-01-09 21:31:31,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:31,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:31,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:31,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:31,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:31,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 159 [2025-01-09 21:31:31,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 129 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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:31:31,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:31,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 159 [2025-01-09 21:31:31,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:31,802 INFO L124 PetriNetUnfolderBase]: 13/195 cut-off events. [2025-01-09 21:31:31,803 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-01-09 21:31:31,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 195 events. 13/195 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 466 event pairs, 2 based on Foata normal form. 1/179 useless extension candidates. Maximal degree in co-relation 174. Up to 14 conditions per place. [2025-01-09 21:31:31,804 INFO L140 encePairwiseOnDemand]: 156/159 looper letters, 10 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2025-01-09 21:31:31,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 129 transitions, 307 flow [2025-01-09 21:31:31,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:31,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2025-01-09 21:31:31,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9266247379454927 [2025-01-09 21:31:31,807 INFO L175 Difference]: Start difference. First operand has 130 places, 129 transitions, 282 flow. Second operand 3 states and 442 transitions. [2025-01-09 21:31:31,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 129 transitions, 307 flow [2025-01-09 21:31:31,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 129 transitions, 307 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:31,813 INFO L231 Difference]: Finished difference. Result has 131 places, 128 transitions, 284 flow [2025-01-09 21:31:31,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=131, PETRI_TRANSITIONS=128} [2025-01-09 21:31:31,814 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -7 predicate places. [2025-01-09 21:31:31,816 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 128 transitions, 284 flow [2025-01-09 21:31:31,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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:31:31,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:31,816 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] [2025-01-09 21:31:31,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:31:31,817 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:31:31,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1368511151, now seen corresponding path program 1 times [2025-01-09 21:31:31,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:31,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068143626] [2025-01-09 21:31:31,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:31,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:31,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:31:31,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:31:31,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:31,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:31,896 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:31:31,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:31,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068143626] [2025-01-09 21:31:31,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068143626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:31,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:31,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:31,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313491580] [2025-01-09 21:31:31,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:31,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:31,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:31,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:31,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:31,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 159 [2025-01-09 21:31:31,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 128 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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:31:31,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:31,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 159 [2025-01-09 21:31:31,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:31,974 INFO L124 PetriNetUnfolderBase]: 12/170 cut-off events. [2025-01-09 21:31:31,974 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-01-09 21:31:31,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 170 events. 12/170 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 319 event pairs, 2 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 150. Up to 18 conditions per place. [2025-01-09 21:31:31,975 INFO L140 encePairwiseOnDemand]: 156/159 looper letters, 10 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2025-01-09 21:31:31,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 128 transitions, 309 flow [2025-01-09 21:31:31,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2025-01-09 21:31:31,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9266247379454927 [2025-01-09 21:31:31,980 INFO L175 Difference]: Start difference. First operand has 131 places, 128 transitions, 284 flow. Second operand 3 states and 442 transitions. [2025-01-09 21:31:31,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 128 transitions, 309 flow [2025-01-09 21:31:31,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 128 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:31,983 INFO L231 Difference]: Finished difference. Result has 130 places, 127 transitions, 282 flow [2025-01-09 21:31:31,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=130, PETRI_TRANSITIONS=127} [2025-01-09 21:31:31,985 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -8 predicate places. [2025-01-09 21:31:31,985 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 127 transitions, 282 flow [2025-01-09 21:31:31,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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:31:31,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:31,986 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] [2025-01-09 21:31:31,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:31:31,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:31:31,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1211871681, now seen corresponding path program 1 times [2025-01-09 21:31:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:31,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557053743] [2025-01-09 21:31:31,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:31,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:31,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:31:32,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:31:32,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:32,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:32,077 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:31:32,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:32,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557053743] [2025-01-09 21:31:32,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557053743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:32,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:32,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:32,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606832056] [2025-01-09 21:31:32,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:32,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:32,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:32,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:32,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:32,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 159 [2025-01-09 21:31:32,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 127 transitions, 282 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:31:32,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:32,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 159 [2025-01-09 21:31:32,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:32,132 INFO L124 PetriNetUnfolderBase]: 10/179 cut-off events. [2025-01-09 21:31:32,133 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-01-09 21:31:32,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 179 events. 10/179 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 356 event pairs, 1 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 156. Up to 8 conditions per place. [2025-01-09 21:31:32,134 INFO L140 encePairwiseOnDemand]: 155/159 looper letters, 10 selfloop transitions, 1 changer transitions 0/124 dead transitions. [2025-01-09 21:31:32,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 124 transitions, 298 flow [2025-01-09 21:31:32,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2025-01-09 21:31:32,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9161425576519916 [2025-01-09 21:31:32,136 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 282 flow. Second operand 3 states and 437 transitions. [2025-01-09 21:31:32,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 124 transitions, 298 flow [2025-01-09 21:31:32,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 124 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:32,140 INFO L231 Difference]: Finished difference. Result has 127 places, 124 transitions, 274 flow [2025-01-09 21:31:32,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=127, PETRI_TRANSITIONS=124} [2025-01-09 21:31:32,141 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -11 predicate places. [2025-01-09 21:31:32,142 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 124 transitions, 274 flow [2025-01-09 21:31:32,142 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:31:32,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:32,142 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] [2025-01-09 21:31:32,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:31:32,143 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:31:32,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:32,144 INFO L85 PathProgramCache]: Analyzing trace with hash -621285704, now seen corresponding path program 1 times [2025-01-09 21:31:32,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:32,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827463138] [2025-01-09 21:31:32,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:32,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:32,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:31:32,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:31:32,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:32,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:32,208 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:31:32,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:32,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827463138] [2025-01-09 21:31:32,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827463138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:32,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:32,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:32,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050952292] [2025-01-09 21:31:32,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:32,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:32,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:32,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:32,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:32,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 159 [2025-01-09 21:31:32,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 124 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:31:32,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:32,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 159 [2025-01-09 21:31:32,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:32,254 INFO L124 PetriNetUnfolderBase]: 10/180 cut-off events. [2025-01-09 21:31:32,254 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-01-09 21:31:32,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 180 events. 10/180 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs, 1 based on Foata normal form. 1/174 useless extension candidates. Maximal degree in co-relation 151. Up to 10 conditions per place. [2025-01-09 21:31:32,255 INFO L140 encePairwiseOnDemand]: 153/159 looper letters, 0 selfloop transitions, 0 changer transitions 123/123 dead transitions. [2025-01-09 21:31:32,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 123 transitions, 296 flow [2025-01-09 21:31:32,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:32,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2025-01-09 21:31:32,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9182389937106918 [2025-01-09 21:31:32,258 INFO L175 Difference]: Start difference. First operand has 127 places, 124 transitions, 274 flow. Second operand 3 states and 438 transitions. [2025-01-09 21:31:32,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 123 transitions, 296 flow [2025-01-09 21:31:32,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 123 transitions, 295 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:32,260 INFO L231 Difference]: Finished difference. Result has 125 places, 0 transitions, 0 flow [2025-01-09 21:31:32,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=125, PETRI_TRANSITIONS=0} [2025-01-09 21:31:32,262 INFO L279 CegarLoopForPetriNet]: 138 programPoint places, -13 predicate places. [2025-01-09 21:31:32,262 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 0 transitions, 0 flow [2025-01-09 21:31:32,263 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:31:32,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (25 of 26 remaining) [2025-01-09 21:31:32,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (24 of 26 remaining) [2025-01-09 21:31:32,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (23 of 26 remaining) [2025-01-09 21:31:32,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2025-01-09 21:31:32,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2025-01-09 21:31:32,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2025-01-09 21:31:32,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 26 remaining) [2025-01-09 21:31:32,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2025-01-09 21:31:32,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2025-01-09 21:31:32,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2025-01-09 21:31:32,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2025-01-09 21:31:32,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 26 remaining) [2025-01-09 21:31:32,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2025-01-09 21:31:32,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2025-01-09 21:31:32,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2025-01-09 21:31:32,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2025-01-09 21:31:32,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 26 remaining) [2025-01-09 21:31:32,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 26 remaining) [2025-01-09 21:31:32,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2025-01-09 21:31:32,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2025-01-09 21:31:32,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2025-01-09 21:31:32,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2025-01-09 21:31:32,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2025-01-09 21:31:32,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2025-01-09 21:31:32,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2025-01-09 21:31:32,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2025-01-09 21:31:32,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:31:32,270 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:32,275 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:31:32,275 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:31:32,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:31:32 BasicIcfg [2025-01-09 21:31:32,279 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:31:32,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:31:32,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:31:32,280 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:31:32,280 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:31:30" (3/4) ... [2025-01-09 21:31:32,282 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:31:32,284 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:31:32,284 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:31:32,288 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 21:31:32,288 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:31:32,290 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:31:32,290 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:31:32,367 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:31:32,367 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:31:32,367 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:31:32,368 INFO L158 Benchmark]: Toolchain (without parser) took 2680.67ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 66.0MB in the end (delta: 47.1MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2025-01-09 21:31:32,368 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:31:32,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.50ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 101.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:31:32,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.27ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:31:32,370 INFO L158 Benchmark]: Boogie Preprocessor took 30.93ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 99.6MB in the end (delta: 664.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:31:32,371 INFO L158 Benchmark]: RCFGBuilder took 456.55ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 84.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:31:32,371 INFO L158 Benchmark]: TraceAbstraction took 1813.29ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 71.6MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2025-01-09 21:31:32,371 INFO L158 Benchmark]: Witness Printer took 87.60ms. Allocated memory is still 142.6MB. Free memory was 71.6MB in the beginning and 66.0MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:31:32,373 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.64ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.50ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 101.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.27ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.93ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 99.6MB in the end (delta: 664.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 456.55ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 84.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1813.29ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 71.6MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Witness Printer took 87.60ms. Allocated memory is still 142.6MB. Free memory was 71.6MB in the beginning and 66.0MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: 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, 200 locations, 26 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.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 203 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 193 IncrementalHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 56 mSDtfsCounter, 193 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286occurred in iteration=0, InterpolantAutomatonStates: 24, 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.4s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 368 ConstructedInterpolants, 0 QuantifiedInterpolants, 384 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:31:32,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE