./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cd6aaa75855c8ee03a174376352b142cf57dd56532b968b1b6c916585172927 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:26:52,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:26:52,258 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:26:52,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:26:52,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:26:52,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:26:52,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:26:52,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:26:52,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:26:52,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:26:52,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:26:52,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:26:52,304 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:26:52,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:26:52,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:26:52,304 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:26:52,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:26:52,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:26:52,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:26:52,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:26:52,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:26:52,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:26:52,307 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:26:52,307 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:26:52,307 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:26:52,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:26:52,307 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:26:52,307 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:26:52,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:26:52,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:26:52,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:26:52,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:52,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:26:52,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:26:52,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:26:52,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:52,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:26:52,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:26:52,309 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:26:52,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:26:52,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:26:52,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:26:52,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:26:52,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:26:52,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:26:52,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:26:52,310 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 -> 7cd6aaa75855c8ee03a174376352b142cf57dd56532b968b1b6c916585172927 [2025-01-09 21:26:52,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:26:52,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:26:52,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:26:52,616 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:26:52,616 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:26:52,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i [2025-01-09 21:26:53,941 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19739689c/98c6723c081242b5957ae1e2744866a2/FLAG1315f857a [2025-01-09 21:26:54,264 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:26:54,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_12-ptr_racefree.i [2025-01-09 21:26:54,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19739689c/98c6723c081242b5957ae1e2744866a2/FLAG1315f857a [2025-01-09 21:26:54,499 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19739689c/98c6723c081242b5957ae1e2744866a2 [2025-01-09 21:26:54,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:26:54,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:26:54,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:26:54,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:26:54,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:26:54,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:26:54" (1/1) ... [2025-01-09 21:26:54,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f6f666f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:54, skipping insertion in model container [2025-01-09 21:26:54,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:26:54" (1/1) ... [2025-01-09 21:26:54,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:26:54,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:26:54,847 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:26:54,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:26:54,953 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:26:54,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:54 WrapperNode [2025-01-09 21:26:54,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:26:54,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:26:54,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:26:54,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:26:54,960 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:26:54" (1/1) ... [2025-01-09 21:26:54,972 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:26:54" (1/1) ... [2025-01-09 21:26:54,990 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 146 [2025-01-09 21:26:54,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:26:54,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:26:54,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:26:54,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:26:54,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:54" (1/1) ... [2025-01-09 21:26:54,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:54" (1/1) ... [2025-01-09 21:26:55,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:54" (1/1) ... [2025-01-09 21:26:55,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:54" (1/1) ... [2025-01-09 21:26:55,015 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:54" (1/1) ... [2025-01-09 21:26:55,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:54" (1/1) ... [2025-01-09 21:26:55,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:54" (1/1) ... [2025-01-09 21:26:55,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:54" (1/1) ... [2025-01-09 21:26:55,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:54" (1/1) ... [2025-01-09 21:26:55,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:26:55,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:26:55,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:26:55,026 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:26:55,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:54" (1/1) ... [2025-01-09 21:26:55,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:26:55,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:26:55,063 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:26:55,065 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:26:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:26:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:26:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:26:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:26:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:26:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:26:55,081 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:26:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:26:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:26:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:26:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:26:55,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:26:55,083 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:26:55,196 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:26:55,198 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:26:55,578 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:26:55,578 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:26:55,609 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:26:55,610 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:26:55,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:26:55 BoogieIcfgContainer [2025-01-09 21:26:55,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:26:55,615 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:26:55,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:26:55,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:26:55,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:26:54" (1/3) ... [2025-01-09 21:26:55,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4c2cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:26:55, skipping insertion in model container [2025-01-09 21:26:55,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:26:54" (2/3) ... [2025-01-09 21:26:55,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4c2cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:26:55, skipping insertion in model container [2025-01-09 21:26:55,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:26:55" (3/3) ... [2025-01-09 21:26:55,625 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_12-ptr_racefree.i [2025-01-09 21:26:55,641 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:26:55,643 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_12-ptr_racefree.i that has 2 procedures, 208 locations, 1 initial locations, 6 loop locations, and 7 error locations. [2025-01-09 21:26:55,645 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:26:55,745 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:26:55,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 219 transitions, 445 flow [2025-01-09 21:26:55,932 INFO L124 PetriNetUnfolderBase]: 15/281 cut-off events. [2025-01-09 21:26:55,934 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:26:55,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 281 events. 15/281 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 711 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 146. Up to 4 conditions per place. [2025-01-09 21:26:55,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 211 places, 219 transitions, 445 flow [2025-01-09 21:26:55,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 219 transitions, 445 flow [2025-01-09 21:26:55,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:26:55,977 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;@d70d035, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:26:55,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-09 21:26:56,000 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:26:56,000 INFO L124 PetriNetUnfolderBase]: 0/111 cut-off events. [2025-01-09 21:26:56,000 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:26:56,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:56,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:56,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:56,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:56,009 INFO L85 PathProgramCache]: Analyzing trace with hash -702468488, now seen corresponding path program 1 times [2025-01-09 21:26:56,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:56,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529589681] [2025-01-09 21:26:56,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:56,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:56,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:26:56,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:26:56,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:56,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:57,205 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:26:57,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:57,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529589681] [2025-01-09 21:26:57,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529589681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:57,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:57,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:57,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41027583] [2025-01-09 21:26:57,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:57,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:57,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:57,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:57,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:57,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 219 [2025-01-09 21:26:57,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 219 transitions, 445 flow. Second operand has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 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:26:57,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:57,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 219 [2025-01-09 21:26:57,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:58,246 INFO L124 PetriNetUnfolderBase]: 579/2205 cut-off events. [2025-01-09 21:26:58,246 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:26:58,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3463 conditions, 2205 events. 579/2205 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 15029 event pairs, 357 based on Foata normal form. 178/2234 useless extension candidates. Maximal degree in co-relation 3264. Up to 1080 conditions per place. [2025-01-09 21:26:58,262 INFO L140 encePairwiseOnDemand]: 186/219 looper letters, 73 selfloop transitions, 70 changer transitions 0/300 dead transitions. [2025-01-09 21:26:58,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 300 transitions, 893 flow [2025-01-09 21:26:58,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:58,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1126 transitions. [2025-01-09 21:26:58,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8569254185692542 [2025-01-09 21:26:58,282 INFO L175 Difference]: Start difference. First operand has 211 places, 219 transitions, 445 flow. Second operand 6 states and 1126 transitions. [2025-01-09 21:26:58,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 300 transitions, 893 flow [2025-01-09 21:26:58,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 300 transitions, 893 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:58,298 INFO L231 Difference]: Finished difference. Result has 219 places, 276 transitions, 883 flow [2025-01-09 21:26:58,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=883, PETRI_PLACES=219, PETRI_TRANSITIONS=276} [2025-01-09 21:26:58,305 INFO L279 CegarLoopForPetriNet]: 211 programPoint places, 8 predicate places. [2025-01-09 21:26:58,306 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 276 transitions, 883 flow [2025-01-09 21:26:58,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 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:26:58,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:58,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:58,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:26:58,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:58,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:58,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1128859088, now seen corresponding path program 1 times [2025-01-09 21:26:58,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:58,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580210424] [2025-01-09 21:26:58,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:58,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:58,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:26:58,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:26:58,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:58,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:58,414 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:26:58,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:58,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580210424] [2025-01-09 21:26:58,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580210424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:58,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:58,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:26:58,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784603782] [2025-01-09 21:26:58,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:58,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:58,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:58,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:58,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:58,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 219 [2025-01-09 21:26:58,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 276 transitions, 883 flow. Second operand has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 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:26:58,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:58,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 219 [2025-01-09 21:26:58,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:58,648 INFO L124 PetriNetUnfolderBase]: 185/1196 cut-off events. [2025-01-09 21:26:58,648 INFO L125 PetriNetUnfolderBase]: For 118/132 co-relation queries the response was YES. [2025-01-09 21:26:58,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 1196 events. 185/1196 cut-off events. For 118/132 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6929 event pairs, 35 based on Foata normal form. 1/1122 useless extension candidates. Maximal degree in co-relation 1745. Up to 223 conditions per place. [2025-01-09 21:26:58,657 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 22 selfloop transitions, 3 changer transitions 0/282 dead transitions. [2025-01-09 21:26:58,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 282 transitions, 945 flow [2025-01-09 21:26:58,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:58,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions. [2025-01-09 21:26:58,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9056316590563166 [2025-01-09 21:26:58,660 INFO L175 Difference]: Start difference. First operand has 219 places, 276 transitions, 883 flow. Second operand 3 states and 595 transitions. [2025-01-09 21:26:58,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 282 transitions, 945 flow [2025-01-09 21:26:58,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 282 transitions, 945 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:26:58,677 INFO L231 Difference]: Finished difference. Result has 222 places, 276 transitions, 894 flow [2025-01-09 21:26:58,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=222, PETRI_TRANSITIONS=276} [2025-01-09 21:26:58,678 INFO L279 CegarLoopForPetriNet]: 211 programPoint places, 11 predicate places. [2025-01-09 21:26:58,678 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 276 transitions, 894 flow [2025-01-09 21:26:58,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 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:26:58,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:58,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:58,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:26:58,679 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:58,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash 132484198, now seen corresponding path program 1 times [2025-01-09 21:26:58,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:58,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350350097] [2025-01-09 21:26:58,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:58,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:58,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:26:58,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:26:58,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:58,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:59,237 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:26:59,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:59,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350350097] [2025-01-09 21:26:59,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350350097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:59,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:59,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:59,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442132347] [2025-01-09 21:26:59,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:59,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:59,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:59,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:59,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:59,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 219 [2025-01-09 21:26:59,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 276 transitions, 894 flow. Second operand has 6 states, 6 states have (on average 171.16666666666666) internal successors, (1027), 6 states have internal predecessors, (1027), 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:26:59,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:59,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 219 [2025-01-09 21:26:59,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:59,855 INFO L124 PetriNetUnfolderBase]: 370/1611 cut-off events. [2025-01-09 21:26:59,856 INFO L125 PetriNetUnfolderBase]: For 462/474 co-relation queries the response was YES. [2025-01-09 21:26:59,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3296 conditions, 1611 events. 370/1611 cut-off events. For 462/474 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 10550 event pairs, 96 based on Foata normal form. 2/1559 useless extension candidates. Maximal degree in co-relation 3125. Up to 642 conditions per place. [2025-01-09 21:26:59,866 INFO L140 encePairwiseOnDemand]: 201/219 looper letters, 112 selfloop transitions, 53 changer transitions 0/335 dead transitions. [2025-01-09 21:26:59,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 335 transitions, 1466 flow [2025-01-09 21:26:59,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:26:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:26:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1097 transitions. [2025-01-09 21:26:59,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.834855403348554 [2025-01-09 21:26:59,873 INFO L175 Difference]: Start difference. First operand has 222 places, 276 transitions, 894 flow. Second operand 6 states and 1097 transitions. [2025-01-09 21:26:59,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 335 transitions, 1466 flow [2025-01-09 21:26:59,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 335 transitions, 1460 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:59,887 INFO L231 Difference]: Finished difference. Result has 230 places, 319 transitions, 1376 flow [2025-01-09 21:26:59,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1376, PETRI_PLACES=230, PETRI_TRANSITIONS=319} [2025-01-09 21:26:59,888 INFO L279 CegarLoopForPetriNet]: 211 programPoint places, 19 predicate places. [2025-01-09 21:26:59,889 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 319 transitions, 1376 flow [2025-01-09 21:26:59,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.16666666666666) internal successors, (1027), 6 states have internal predecessors, (1027), 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:26:59,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:59,890 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:59,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:26:59,890 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:26:59,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:59,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1451092565, now seen corresponding path program 1 times [2025-01-09 21:26:59,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:59,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002436387] [2025-01-09 21:26:59,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:59,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:59,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 21:26:59,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 21:26:59,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:59,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:26:59,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:26:59,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 21:26:59,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 21:26:59,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:59,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:27:00,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:27:00,001 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:27:00,002 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-01-09 21:27:00,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-01-09 21:27:00,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-01-09 21:27:00,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-01-09 21:27:00,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-01-09 21:27:00,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-01-09 21:27:00,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-01-09 21:27:00,004 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-01-09 21:27:00,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-01-09 21:27:00,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-01-09 21:27:00,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-01-09 21:27:00,005 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-01-09 21:27:00,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:27:00,005 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:27:00,008 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:27:00,009 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:27:00,051 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:27:00,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 285 transitions, 586 flow [2025-01-09 21:27:00,107 INFO L124 PetriNetUnfolderBase]: 27/436 cut-off events. [2025-01-09 21:27:00,107 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:27:00,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 436 events. 27/436 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1469 event pairs, 0 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 283. Up to 6 conditions per place. [2025-01-09 21:27:00,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 285 transitions, 586 flow [2025-01-09 21:27:00,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 272 places, 285 transitions, 586 flow [2025-01-09 21:27:00,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:27:00,115 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;@d70d035, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:27:00,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-09 21:27:00,124 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:27:00,124 INFO L124 PetriNetUnfolderBase]: 0/111 cut-off events. [2025-01-09 21:27:00,124 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:27:00,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:00,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:00,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:27:00,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:00,125 INFO L85 PathProgramCache]: Analyzing trace with hash -725839656, now seen corresponding path program 1 times [2025-01-09 21:27:00,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:00,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179370030] [2025-01-09 21:27:00,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:00,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:00,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:27:00,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:27:00,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:00,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:00,509 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:27:00,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:00,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179370030] [2025-01-09 21:27:00,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179370030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:00,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:00,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:00,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442196844] [2025-01-09 21:27:00,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:00,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:00,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:00,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:00,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:00,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 285 [2025-01-09 21:27:00,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 285 transitions, 586 flow. Second operand has 6 states, 6 states have (on average 195.5) internal successors, (1173), 6 states have internal predecessors, (1173), 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:27:00,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:00,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 285 [2025-01-09 21:27:00,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:09,443 INFO L124 PetriNetUnfolderBase]: 29150/68169 cut-off events. [2025-01-09 21:27:09,443 INFO L125 PetriNetUnfolderBase]: For 756/756 co-relation queries the response was YES. [2025-01-09 21:27:09,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113703 conditions, 68169 events. 29150/68169 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 1190. Compared 757093 event pairs, 19147 based on Foata normal form. 6986/71178 useless extension candidates. Maximal degree in co-relation 99472. Up to 40547 conditions per place. [2025-01-09 21:27:09,987 INFO L140 encePairwiseOnDemand]: 230/285 looper letters, 122 selfloop transitions, 134 changer transitions 0/449 dead transitions. [2025-01-09 21:27:09,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 449 transitions, 1431 flow [2025-01-09 21:27:09,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1485 transitions. [2025-01-09 21:27:09,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.868421052631579 [2025-01-09 21:27:09,996 INFO L175 Difference]: Start difference. First operand has 272 places, 285 transitions, 586 flow. Second operand 6 states and 1485 transitions. [2025-01-09 21:27:09,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 449 transitions, 1431 flow [2025-01-09 21:27:10,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 449 transitions, 1431 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:10,015 INFO L231 Difference]: Finished difference. Result has 280 places, 400 transitions, 1428 flow [2025-01-09 21:27:10,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1428, PETRI_PLACES=280, PETRI_TRANSITIONS=400} [2025-01-09 21:27:10,017 INFO L279 CegarLoopForPetriNet]: 272 programPoint places, 8 predicate places. [2025-01-09 21:27:10,020 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 400 transitions, 1428 flow [2025-01-09 21:27:10,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.5) internal successors, (1173), 6 states have internal predecessors, (1173), 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:27:10,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:10,021 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:10,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:27:10,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:27:10,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:10,022 INFO L85 PathProgramCache]: Analyzing trace with hash -2113705936, now seen corresponding path program 1 times [2025-01-09 21:27:10,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:10,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644773749] [2025-01-09 21:27:10,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:10,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:10,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:27:10,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:27:10,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:10,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:10,086 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:27:10,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:10,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644773749] [2025-01-09 21:27:10,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644773749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:10,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:10,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:27:10,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639251554] [2025-01-09 21:27:10,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:10,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:10,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:10,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:10,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:10,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 285 [2025-01-09 21:27:10,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 400 transitions, 1428 flow. Second operand has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 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:27:10,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:10,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 285 [2025-01-09 21:27:10,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:12,562 INFO L124 PetriNetUnfolderBase]: 8501/27552 cut-off events. [2025-01-09 21:27:12,562 INFO L125 PetriNetUnfolderBase]: For 4210/4575 co-relation queries the response was YES. [2025-01-09 21:27:12,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48442 conditions, 27552 events. 8501/27552 cut-off events. For 4210/4575 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 309363 event pairs, 3636 based on Foata normal form. 1/25481 useless extension candidates. Maximal degree in co-relation 41225. Up to 8486 conditions per place. [2025-01-09 21:27:12,729 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 32 selfloop transitions, 3 changer transitions 0/408 dead transitions. [2025-01-09 21:27:12,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 408 transitions, 1520 flow [2025-01-09 21:27:12,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:12,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2025-01-09 21:27:12,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-01-09 21:27:12,732 INFO L175 Difference]: Start difference. First operand has 280 places, 400 transitions, 1428 flow. Second operand 3 states and 760 transitions. [2025-01-09 21:27:12,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 408 transitions, 1520 flow [2025-01-09 21:27:12,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 408 transitions, 1520 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:12,798 INFO L231 Difference]: Finished difference. Result has 283 places, 402 transitions, 1453 flow [2025-01-09 21:27:12,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1453, PETRI_PLACES=283, PETRI_TRANSITIONS=402} [2025-01-09 21:27:12,800 INFO L279 CegarLoopForPetriNet]: 272 programPoint places, 11 predicate places. [2025-01-09 21:27:12,800 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 402 transitions, 1453 flow [2025-01-09 21:27:12,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 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:27:12,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:12,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:12,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:27:12,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:27:12,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:12,801 INFO L85 PathProgramCache]: Analyzing trace with hash -649322522, now seen corresponding path program 1 times [2025-01-09 21:27:12,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:12,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189670242] [2025-01-09 21:27:12,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:12,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:12,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:27:12,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:27:12,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:12,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:13,284 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:27:13,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:13,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189670242] [2025-01-09 21:27:13,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189670242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:13,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:13,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:13,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004787896] [2025-01-09 21:27:13,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:13,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:13,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:13,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:13,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:13,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 285 [2025-01-09 21:27:13,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 402 transitions, 1453 flow. Second operand has 6 states, 6 states have (on average 215.16666666666666) internal successors, (1291), 6 states have internal predecessors, (1291), 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:27:13,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:13,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 285 [2025-01-09 21:27:13,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:19,359 INFO L124 PetriNetUnfolderBase]: 21506/54585 cut-off events. [2025-01-09 21:27:19,360 INFO L125 PetriNetUnfolderBase]: For 19377/20749 co-relation queries the response was YES. [2025-01-09 21:27:19,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119271 conditions, 54585 events. 21506/54585 cut-off events. For 19377/20749 co-relation queries the response was YES. Maximal size of possible extension queue 1111. Compared 623552 event pairs, 7764 based on Foata normal form. 38/51580 useless extension candidates. Maximal degree in co-relation 119049. Up to 25446 conditions per place. [2025-01-09 21:27:20,042 INFO L140 encePairwiseOnDemand]: 259/285 looper letters, 192 selfloop transitions, 141 changer transitions 0/581 dead transitions. [2025-01-09 21:27:20,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 581 transitions, 2921 flow [2025-01-09 21:27:20,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1441 transitions. [2025-01-09 21:27:20,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8426900584795322 [2025-01-09 21:27:20,047 INFO L175 Difference]: Start difference. First operand has 283 places, 402 transitions, 1453 flow. Second operand 6 states and 1441 transitions. [2025-01-09 21:27:20,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 581 transitions, 2921 flow [2025-01-09 21:27:20,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 581 transitions, 2918 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:27:20,215 INFO L231 Difference]: Finished difference. Result has 292 places, 533 transitions, 2834 flow [2025-01-09 21:27:20,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2834, PETRI_PLACES=292, PETRI_TRANSITIONS=533} [2025-01-09 21:27:20,216 INFO L279 CegarLoopForPetriNet]: 272 programPoint places, 20 predicate places. [2025-01-09 21:27:20,216 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 533 transitions, 2834 flow [2025-01-09 21:27:20,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.16666666666666) internal successors, (1291), 6 states have internal predecessors, (1291), 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:27:20,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:20,218 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:20,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:27:20,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:27:20,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:20,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2097695491, now seen corresponding path program 1 times [2025-01-09 21:27:20,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:20,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183117489] [2025-01-09 21:27:20,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:20,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:20,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:27:20,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:27:20,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:20,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:20,310 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:27:20,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:20,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183117489] [2025-01-09 21:27:20,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183117489] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:20,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:20,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:20,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431487894] [2025-01-09 21:27:20,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:20,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:27:20,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:20,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:27:20,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:27:20,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 285 [2025-01-09 21:27:20,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 533 transitions, 2834 flow. Second operand has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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:27:20,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:20,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 285 [2025-01-09 21:27:20,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:25,405 INFO L124 PetriNetUnfolderBase]: 13911/44260 cut-off events. [2025-01-09 21:27:25,406 INFO L125 PetriNetUnfolderBase]: For 21500/22901 co-relation queries the response was YES. [2025-01-09 21:27:25,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96025 conditions, 44260 events. 13911/44260 cut-off events. For 21500/22901 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 526269 event pairs, 3355 based on Foata normal form. 56/41274 useless extension candidates. Maximal degree in co-relation 35889. Up to 14555 conditions per place. [2025-01-09 21:27:25,657 INFO L140 encePairwiseOnDemand]: 280/285 looper letters, 56 selfloop transitions, 7 changer transitions 0/565 dead transitions. [2025-01-09 21:27:25,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 565 transitions, 3024 flow [2025-01-09 21:27:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1502 transitions. [2025-01-09 21:27:25,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8783625730994152 [2025-01-09 21:27:25,661 INFO L175 Difference]: Start difference. First operand has 292 places, 533 transitions, 2834 flow. Second operand 6 states and 1502 transitions. [2025-01-09 21:27:25,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 565 transitions, 3024 flow [2025-01-09 21:27:25,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 565 transitions, 3006 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:25,828 INFO L231 Difference]: Finished difference. Result has 300 places, 535 transitions, 2848 flow [2025-01-09 21:27:25,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=2816, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2848, PETRI_PLACES=300, PETRI_TRANSITIONS=535} [2025-01-09 21:27:25,830 INFO L279 CegarLoopForPetriNet]: 272 programPoint places, 28 predicate places. [2025-01-09 21:27:25,831 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 535 transitions, 2848 flow [2025-01-09 21:27:25,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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:27:25,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:25,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:25,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:27:25,832 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:27:25,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:25,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1077051375, now seen corresponding path program 1 times [2025-01-09 21:27:25,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:25,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878101582] [2025-01-09 21:27:25,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:25,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:25,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:27:25,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:27:25,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:25,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:26,181 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:27:26,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:26,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878101582] [2025-01-09 21:27:26,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878101582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:26,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:26,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:26,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253735230] [2025-01-09 21:27:26,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:26,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:26,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:26,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:26,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:26,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 285 [2025-01-09 21:27:26,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 535 transitions, 2848 flow. Second operand has 6 states, 6 states have (on average 199.16666666666666) internal successors, (1195), 6 states have internal predecessors, (1195), 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:27:26,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:26,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 285 [2025-01-09 21:27:26,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:38,836 INFO L124 PetriNetUnfolderBase]: 44840/102147 cut-off events. [2025-01-09 21:27:38,836 INFO L125 PetriNetUnfolderBase]: For 70096/74733 co-relation queries the response was YES. [2025-01-09 21:27:39,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259314 conditions, 102147 events. 44840/102147 cut-off events. For 70096/74733 co-relation queries the response was YES. Maximal size of possible extension queue 1646. Compared 1171944 event pairs, 22789 based on Foata normal form. 136/96535 useless extension candidates. Maximal degree in co-relation 232638. Up to 64110 conditions per place. [2025-01-09 21:27:39,612 INFO L140 encePairwiseOnDemand]: 250/285 looper letters, 372 selfloop transitions, 245 changer transitions 0/818 dead transitions. [2025-01-09 21:27:39,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 818 transitions, 5540 flow [2025-01-09 21:27:39,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1414 transitions. [2025-01-09 21:27:39,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8269005847953217 [2025-01-09 21:27:39,615 INFO L175 Difference]: Start difference. First operand has 300 places, 535 transitions, 2848 flow. Second operand 6 states and 1414 transitions. [2025-01-09 21:27:39,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 818 transitions, 5540 flow [2025-01-09 21:27:40,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 818 transitions, 5530 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-09 21:27:40,121 INFO L231 Difference]: Finished difference. Result has 308 places, 770 transitions, 5356 flow [2025-01-09 21:27:40,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=2838, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5356, PETRI_PLACES=308, PETRI_TRANSITIONS=770} [2025-01-09 21:27:40,123 INFO L279 CegarLoopForPetriNet]: 272 programPoint places, 36 predicate places. [2025-01-09 21:27:40,123 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 770 transitions, 5356 flow [2025-01-09 21:27:40,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.16666666666666) internal successors, (1195), 6 states have internal predecessors, (1195), 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:27:40,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:40,124 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:40,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:27:40,125 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-01-09 21:27:40,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:40,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1276653061, now seen corresponding path program 1 times [2025-01-09 21:27:40,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:40,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326837433] [2025-01-09 21:27:40,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:40,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:40,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 21:27:40,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 21:27:40,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:40,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:40,693 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:27:40,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:40,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326837433] [2025-01-09 21:27:40,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326837433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:40,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:40,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 21:27:40,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026156140] [2025-01-09 21:27:40,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:40,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:27:40,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:40,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:27:40,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 21:27:41,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 285 [2025-01-09 21:27:41,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 770 transitions, 5356 flow. Second operand has 11 states, 11 states have (on average 192.0) internal successors, (2112), 11 states have internal predecessors, (2112), 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:27:41,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:41,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 285 [2025-01-09 21:27:41,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand