./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-2_2-container_of.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/ldv-races/race-2_2-container_of.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 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:17:02,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:17:02,784 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:17:02,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:17:02,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:17:02,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:17:02,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:17:02,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:17:02,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:17:02,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:17:02,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:17:02,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:17:02,817 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:17:02,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:17:02,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:17:02,818 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:17:02,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:17:02,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:17:02,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:17:02,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:17:02,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:17:02,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:17:02,819 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:17:02,819 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:17:02,819 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:17:02,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:17:02,819 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:17:02,819 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:17:02,819 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:17:02,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:17:02,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:17:02,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:17:02,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:17:02,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:17:02,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:17:02,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:17:02,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:17:02,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:17:02,821 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:17:02,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:17:02,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:17:02,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:17:02,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:17:02,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:17:02,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:17:02,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:17:02,822 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 -> 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 [2025-01-09 21:17:03,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:17:03,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:17:03,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:17:03,133 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:17:03,135 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:17:03,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2025-01-09 21:17:04,544 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/465667db2/ec8233d641c648e6a00612dac90a9fab/FLAG4d01c412b [2025-01-09 21:17:04,885 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:17:04,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2025-01-09 21:17:04,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/465667db2/ec8233d641c648e6a00612dac90a9fab/FLAG4d01c412b [2025-01-09 21:17:04,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/465667db2/ec8233d641c648e6a00612dac90a9fab [2025-01-09 21:17:04,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:17:04,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:17:04,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:17:04,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:17:04,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:17:04,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:17:04" (1/1) ... [2025-01-09 21:17:04,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b59287a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:04, skipping insertion in model container [2025-01-09 21:17:04,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:17:04" (1/1) ... [2025-01-09 21:17:05,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:17:05,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:17:05,462 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:17:05,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:17:05,584 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:17:05,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:05 WrapperNode [2025-01-09 21:17:05,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:17:05,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:17:05,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:17:05,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:17:05,591 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:17:05" (1/1) ... [2025-01-09 21:17:05,621 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:17:05" (1/1) ... [2025-01-09 21:17:05,654 INFO L138 Inliner]: procedures = 246, calls = 40, calls flagged for inlining = 11, calls inlined = 14, statements flattened = 180 [2025-01-09 21:17:05,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:17:05,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:17:05,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:17:05,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:17:05,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:05" (1/1) ... [2025-01-09 21:17:05,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:05" (1/1) ... [2025-01-09 21:17:05,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:05" (1/1) ... [2025-01-09 21:17:05,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:05" (1/1) ... [2025-01-09 21:17:05,689 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:05" (1/1) ... [2025-01-09 21:17:05,690 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:05" (1/1) ... [2025-01-09 21:17:05,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:05" (1/1) ... [2025-01-09 21:17:05,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:05" (1/1) ... [2025-01-09 21:17:05,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:05" (1/1) ... [2025-01-09 21:17:05,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:17:05,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:17:05,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:17:05,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:17:05,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:05" (1/1) ... [2025-01-09 21:17:05,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:17:05,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:17:05,747 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:17:05,751 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:17:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-01-09 21:17:05,777 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-01-09 21:17:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:17:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:17:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:17:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:17:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:17:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:17:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:17:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:17:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:17:05,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:17:05,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:17:05,780 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:17:06,060 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:17:06,062 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:17:06,476 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:17:06,476 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:17:06,571 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:17:06,573 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:17:06,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:06 BoogieIcfgContainer [2025-01-09 21:17:06,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:17:06,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:17:06,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:17:06,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:17:06,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:17:04" (1/3) ... [2025-01-09 21:17:06,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125415ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:17:06, skipping insertion in model container [2025-01-09 21:17:06,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:17:05" (2/3) ... [2025-01-09 21:17:06,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125415ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:17:06, skipping insertion in model container [2025-01-09 21:17:06,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:06" (3/3) ... [2025-01-09 21:17:06,585 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2025-01-09 21:17:06,600 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:17:06,602 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_2-container_of.i that has 2 procedures, 224 locations, 1 initial locations, 0 loop locations, and 15 error locations. [2025-01-09 21:17:06,605 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:17:06,701 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:17:06,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 251 transitions, 516 flow [2025-01-09 21:17:06,885 INFO L124 PetriNetUnfolderBase]: 14/335 cut-off events. [2025-01-09 21:17:06,890 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:17:06,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 335 events. 14/335 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 651 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 173. Up to 4 conditions per place. [2025-01-09 21:17:06,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 251 transitions, 516 flow [2025-01-09 21:17:06,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 245 places, 248 transitions, 508 flow [2025-01-09 21:17:06,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:17:06,934 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;@5bd753f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:17:06,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-09 21:17:06,944 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:17:06,944 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-01-09 21:17:06,944 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:17:06,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:06,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:06,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:17:06,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:06,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1506282842, now seen corresponding path program 1 times [2025-01-09 21:17:06,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:06,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958954065] [2025-01-09 21:17:06,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:06,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:07,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:17:07,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:17:07,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:07,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:08,006 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:17:08,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:08,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958954065] [2025-01-09 21:17:08,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958954065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:08,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:08,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:08,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299984396] [2025-01-09 21:17:08,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:08,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:08,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:08,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:08,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:08,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 251 [2025-01-09 21:17:08,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 248 transitions, 508 flow. Second operand has 6 states, 6 states have (on average 189.33333333333334) internal successors, (1136), 6 states have internal predecessors, (1136), 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:17:08,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:08,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 251 [2025-01-09 21:17:08,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:08,804 INFO L124 PetriNetUnfolderBase]: 424/1641 cut-off events. [2025-01-09 21:17:08,805 INFO L125 PetriNetUnfolderBase]: For 22/24 co-relation queries the response was YES. [2025-01-09 21:17:08,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2414 conditions, 1641 events. 424/1641 cut-off events. For 22/24 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10906 event pairs, 423 based on Foata normal form. 72/1603 useless extension candidates. Maximal degree in co-relation 2167. Up to 750 conditions per place. [2025-01-09 21:17:08,820 INFO L140 encePairwiseOnDemand]: 231/251 looper letters, 39 selfloop transitions, 5 changer transitions 6/221 dead transitions. [2025-01-09 21:17:08,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 221 transitions, 542 flow [2025-01-09 21:17:08,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:08,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1187 transitions. [2025-01-09 21:17:08,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7881806108897742 [2025-01-09 21:17:08,842 INFO L175 Difference]: Start difference. First operand has 245 places, 248 transitions, 508 flow. Second operand 6 states and 1187 transitions. [2025-01-09 21:17:08,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 221 transitions, 542 flow [2025-01-09 21:17:08,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 221 transitions, 534 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:17:08,857 INFO L231 Difference]: Finished difference. Result has 227 places, 215 transitions, 444 flow [2025-01-09 21:17:08,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=444, PETRI_PLACES=227, PETRI_TRANSITIONS=215} [2025-01-09 21:17:08,863 INFO L279 CegarLoopForPetriNet]: 245 programPoint places, -18 predicate places. [2025-01-09 21:17:08,863 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 215 transitions, 444 flow [2025-01-09 21:17:08,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.33333333333334) internal successors, (1136), 6 states have internal predecessors, (1136), 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:17:08,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:08,864 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] [2025-01-09 21:17:08,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:17:08,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:17:08,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:08,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1400294310, now seen corresponding path program 1 times [2025-01-09 21:17:08,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:08,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940255529] [2025-01-09 21:17:08,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:08,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:08,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:17:08,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:17:08,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:08,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:09,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:09,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940255529] [2025-01-09 21:17:09,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940255529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:09,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:09,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:09,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408606974] [2025-01-09 21:17:09,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:09,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:09,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:09,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:09,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:09,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 251 [2025-01-09 21:17:09,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 215 transitions, 444 flow. Second operand has 6 states, 6 states have (on average 189.33333333333334) internal successors, (1136), 6 states have internal predecessors, (1136), 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:17:09,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:09,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 251 [2025-01-09 21:17:09,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:09,941 INFO L124 PetriNetUnfolderBase]: 424/1634 cut-off events. [2025-01-09 21:17:09,942 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-01-09 21:17:09,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2401 conditions, 1634 events. 424/1634 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10885 event pairs, 423 based on Foata normal form. 0/1527 useless extension candidates. Maximal degree in co-relation 2358. Up to 750 conditions per place. [2025-01-09 21:17:09,953 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 39 selfloop transitions, 5 changer transitions 0/214 dead transitions. [2025-01-09 21:17:09,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 214 transitions, 530 flow [2025-01-09 21:17:09,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1173 transitions. [2025-01-09 21:17:09,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7788844621513944 [2025-01-09 21:17:09,956 INFO L175 Difference]: Start difference. First operand has 227 places, 215 transitions, 444 flow. Second operand 6 states and 1173 transitions. [2025-01-09 21:17:09,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 214 transitions, 530 flow [2025-01-09 21:17:09,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 214 transitions, 520 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:17:09,961 INFO L231 Difference]: Finished difference. Result has 220 places, 214 transitions, 442 flow [2025-01-09 21:17:09,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=220, PETRI_TRANSITIONS=214} [2025-01-09 21:17:09,962 INFO L279 CegarLoopForPetriNet]: 245 programPoint places, -25 predicate places. [2025-01-09 21:17:09,963 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 214 transitions, 442 flow [2025-01-09 21:17:09,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.33333333333334) internal successors, (1136), 6 states have internal predecessors, (1136), 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:17:09,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:09,964 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] [2025-01-09 21:17:09,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:17:09,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:17:09,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:09,965 INFO L85 PathProgramCache]: Analyzing trace with hash -467924554, now seen corresponding path program 1 times [2025-01-09 21:17:09,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:09,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519863831] [2025-01-09 21:17:09,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:09,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:09,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:17:09,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:17:09,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:09,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:10,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:17:10,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:10,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519863831] [2025-01-09 21:17:10,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519863831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:10,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:10,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:10,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113058491] [2025-01-09 21:17:10,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:10,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:10,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:10,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:10,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:10,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 251 [2025-01-09 21:17:10,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 214 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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:17:10,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:10,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 251 [2025-01-09 21:17:10,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:10,171 INFO L124 PetriNetUnfolderBase]: 67/519 cut-off events. [2025-01-09 21:17:10,171 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-01-09 21:17:10,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 519 events. 67/519 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2169 event pairs, 63 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 615. Up to 128 conditions per place. [2025-01-09 21:17:10,177 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 18 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2025-01-09 21:17:10,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 216 transitions, 486 flow [2025-01-09 21:17:10,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 666 transitions. [2025-01-09 21:17:10,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8844621513944223 [2025-01-09 21:17:10,185 INFO L175 Difference]: Start difference. First operand has 220 places, 214 transitions, 442 flow. Second operand 3 states and 666 transitions. [2025-01-09 21:17:10,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 216 transitions, 486 flow [2025-01-09 21:17:10,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 216 transitions, 476 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:17:10,190 INFO L231 Difference]: Finished difference. Result has 216 places, 213 transitions, 434 flow [2025-01-09 21:17:10,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=434, PETRI_PLACES=216, PETRI_TRANSITIONS=213} [2025-01-09 21:17:10,193 INFO L279 CegarLoopForPetriNet]: 245 programPoint places, -29 predicate places. [2025-01-09 21:17:10,193 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 213 transitions, 434 flow [2025-01-09 21:17:10,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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:17:10,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:10,194 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] [2025-01-09 21:17:10,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:17:10,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:17:10,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:10,195 INFO L85 PathProgramCache]: Analyzing trace with hash -278579924, now seen corresponding path program 1 times [2025-01-09 21:17:10,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:10,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294360236] [2025-01-09 21:17:10,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:10,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:10,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:17:10,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:17:10,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:10,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:10,292 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:17:10,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:10,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294360236] [2025-01-09 21:17:10,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294360236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:10,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:10,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:10,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843038452] [2025-01-09 21:17:10,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:10,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:10,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:10,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:10,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:10,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 251 [2025-01-09 21:17:10,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 213 transitions, 434 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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:17:10,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:10,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 251 [2025-01-09 21:17:10,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:10,398 INFO L124 PetriNetUnfolderBase]: 63/481 cut-off events. [2025-01-09 21:17:10,398 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:17:10,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 614 conditions, 481 events. 63/481 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1566 event pairs, 12 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 472. Up to 90 conditions per place. [2025-01-09 21:17:10,401 INFO L140 encePairwiseOnDemand]: 249/251 looper letters, 18 selfloop transitions, 1 changer transitions 0/218 dead transitions. [2025-01-09 21:17:10,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 218 transitions, 482 flow [2025-01-09 21:17:10,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 677 transitions. [2025-01-09 21:17:10,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.899070385126162 [2025-01-09 21:17:10,404 INFO L175 Difference]: Start difference. First operand has 216 places, 213 transitions, 434 flow. Second operand 3 states and 677 transitions. [2025-01-09 21:17:10,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 218 transitions, 482 flow [2025-01-09 21:17:10,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 218 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:10,408 INFO L231 Difference]: Finished difference. Result has 215 places, 212 transitions, 430 flow [2025-01-09 21:17:10,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=430, PETRI_PLACES=215, PETRI_TRANSITIONS=212} [2025-01-09 21:17:10,409 INFO L279 CegarLoopForPetriNet]: 245 programPoint places, -30 predicate places. [2025-01-09 21:17:10,409 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 212 transitions, 430 flow [2025-01-09 21:17:10,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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:17:10,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:10,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:10,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:17:10,410 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:17:10,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:10,411 INFO L85 PathProgramCache]: Analyzing trace with hash -758595191, now seen corresponding path program 1 times [2025-01-09 21:17:10,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:10,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515695163] [2025-01-09 21:17:10,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:10,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:10,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:17:10,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:17:10,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:10,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:10,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:17:10,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:10,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515695163] [2025-01-09 21:17:10,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515695163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:10,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:10,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:10,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43308267] [2025-01-09 21:17:10,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:10,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:10,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:10,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:10,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:10,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 251 [2025-01-09 21:17:10,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 212 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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:17:10,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:10,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 251 [2025-01-09 21:17:10,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:10,622 INFO L124 PetriNetUnfolderBase]: 75/768 cut-off events. [2025-01-09 21:17:10,622 INFO L125 PetriNetUnfolderBase]: For 5/13 co-relation queries the response was YES. [2025-01-09 21:17:10,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 768 events. 75/768 cut-off events. For 5/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3443 event pairs, 45 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 776. Up to 109 conditions per place. [2025-01-09 21:17:10,627 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 21 selfloop transitions, 2 changer transitions 0/217 dead transitions. [2025-01-09 21:17:10,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 217 transitions, 486 flow [2025-01-09 21:17:10,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:10,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2025-01-09 21:17:10,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8884462151394422 [2025-01-09 21:17:10,633 INFO L175 Difference]: Start difference. First operand has 215 places, 212 transitions, 430 flow. Second operand 3 states and 669 transitions. [2025-01-09 21:17:10,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 217 transitions, 486 flow [2025-01-09 21:17:10,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 217 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:17:10,638 INFO L231 Difference]: Finished difference. Result has 215 places, 211 transitions, 431 flow [2025-01-09 21:17:10,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=215, PETRI_TRANSITIONS=211} [2025-01-09 21:17:10,639 INFO L279 CegarLoopForPetriNet]: 245 programPoint places, -30 predicate places. [2025-01-09 21:17:10,642 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 211 transitions, 431 flow [2025-01-09 21:17:10,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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:17:10,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:10,642 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] [2025-01-09 21:17:10,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:17:10,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:17:10,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:10,643 INFO L85 PathProgramCache]: Analyzing trace with hash -535666774, now seen corresponding path program 1 times [2025-01-09 21:17:10,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:10,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860858531] [2025-01-09 21:17:10,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:10,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:10,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 21:17:10,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 21:17:10,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:10,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:17:11,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:11,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860858531] [2025-01-09 21:17:11,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860858531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:11,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:11,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:11,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051979259] [2025-01-09 21:17:11,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:11,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:11,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:11,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:11,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:11,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 251 [2025-01-09 21:17:11,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 211 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 194.66666666666666) internal successors, (1168), 6 states have internal predecessors, (1168), 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:17:11,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:11,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 251 [2025-01-09 21:17:11,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:11,891 INFO L124 PetriNetUnfolderBase]: 507/1768 cut-off events. [2025-01-09 21:17:11,892 INFO L125 PetriNetUnfolderBase]: For 5/13 co-relation queries the response was YES. [2025-01-09 21:17:11,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2687 conditions, 1768 events. 507/1768 cut-off events. For 5/13 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 10856 event pairs, 309 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 2494. Up to 803 conditions per place. [2025-01-09 21:17:11,901 INFO L140 encePairwiseOnDemand]: 238/251 looper letters, 37 selfloop transitions, 30 changer transitions 7/240 dead transitions. [2025-01-09 21:17:11,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 240 transitions, 629 flow [2025-01-09 21:17:11,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1223 transitions. [2025-01-09 21:17:11,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8120849933598937 [2025-01-09 21:17:11,905 INFO L175 Difference]: Start difference. First operand has 215 places, 211 transitions, 431 flow. Second operand 6 states and 1223 transitions. [2025-01-09 21:17:11,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 240 transitions, 629 flow [2025-01-09 21:17:11,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 240 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:17:11,913 INFO L231 Difference]: Finished difference. Result has 223 places, 233 transitions, 615 flow [2025-01-09 21:17:11,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=615, PETRI_PLACES=223, PETRI_TRANSITIONS=233} [2025-01-09 21:17:11,916 INFO L279 CegarLoopForPetriNet]: 245 programPoint places, -22 predicate places. [2025-01-09 21:17:11,917 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 233 transitions, 615 flow [2025-01-09 21:17:11,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.66666666666666) internal successors, (1168), 6 states have internal predecessors, (1168), 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:17:11,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:11,918 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] [2025-01-09 21:17:11,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:17:11,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:17:11,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:11,919 INFO L85 PathProgramCache]: Analyzing trace with hash -18569913, now seen corresponding path program 1 times [2025-01-09 21:17:11,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:11,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58322044] [2025-01-09 21:17:11,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:11,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:11,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:17:11,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:17:11,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:11,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:17:12,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:12,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58322044] [2025-01-09 21:17:12,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58322044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:12,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:12,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:12,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435874608] [2025-01-09 21:17:12,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:12,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:12,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:12,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:12,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:12,745 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 251 [2025-01-09 21:17:12,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 233 transitions, 615 flow. Second operand has 6 states, 6 states have (on average 194.66666666666666) internal successors, (1168), 6 states have internal predecessors, (1168), 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:17:12,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:12,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 251 [2025-01-09 21:17:12,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:13,188 INFO L124 PetriNetUnfolderBase]: 665/1836 cut-off events. [2025-01-09 21:17:13,189 INFO L125 PetriNetUnfolderBase]: For 602/616 co-relation queries the response was YES. [2025-01-09 21:17:13,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3982 conditions, 1836 events. 665/1836 cut-off events. For 602/616 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 10970 event pairs, 306 based on Foata normal form. 0/1766 useless extension candidates. Maximal degree in co-relation 2437. Up to 931 conditions per place. [2025-01-09 21:17:13,204 INFO L140 encePairwiseOnDemand]: 238/251 looper letters, 60 selfloop transitions, 30 changer transitions 11/262 dead transitions. [2025-01-09 21:17:13,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 262 transitions, 903 flow [2025-01-09 21:17:13,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1220 transitions. [2025-01-09 21:17:13,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8100929614873837 [2025-01-09 21:17:13,209 INFO L175 Difference]: Start difference. First operand has 223 places, 233 transitions, 615 flow. Second operand 6 states and 1220 transitions. [2025-01-09 21:17:13,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 262 transitions, 903 flow [2025-01-09 21:17:13,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 262 transitions, 903 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:17:13,218 INFO L231 Difference]: Finished difference. Result has 226 places, 251 transitions, 843 flow [2025-01-09 21:17:13,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=843, PETRI_PLACES=226, PETRI_TRANSITIONS=251} [2025-01-09 21:17:13,221 INFO L279 CegarLoopForPetriNet]: 245 programPoint places, -19 predicate places. [2025-01-09 21:17:13,221 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 251 transitions, 843 flow [2025-01-09 21:17:13,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.66666666666666) internal successors, (1168), 6 states have internal predecessors, (1168), 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:17:13,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:13,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:13,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:17:13,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:17:13,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:13,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1724068804, now seen corresponding path program 1 times [2025-01-09 21:17:13,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:13,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634689044] [2025-01-09 21:17:13,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:13,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:13,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:17:13,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:17:13,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:13,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:17:13,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:13,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634689044] [2025-01-09 21:17:13,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634689044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:13,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:13,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:13,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045928455] [2025-01-09 21:17:13,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:13,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:13,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:13,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:13,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:14,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 251 [2025-01-09 21:17:14,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 251 transitions, 843 flow. Second operand has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 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:17:14,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:14,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 251 [2025-01-09 21:17:14,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:14,619 INFO L124 PetriNetUnfolderBase]: 742/2023 cut-off events. [2025-01-09 21:17:14,619 INFO L125 PetriNetUnfolderBase]: For 1323/1382 co-relation queries the response was YES. [2025-01-09 21:17:14,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5451 conditions, 2023 events. 742/2023 cut-off events. For 1323/1382 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 12590 event pairs, 212 based on Foata normal form. 0/1977 useless extension candidates. Maximal degree in co-relation 3658. Up to 981 conditions per place. [2025-01-09 21:17:14,638 INFO L140 encePairwiseOnDemand]: 235/251 looper letters, 91 selfloop transitions, 26 changer transitions 0/279 dead transitions. [2025-01-09 21:17:14,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 279 transitions, 1233 flow [2025-01-09 21:17:14,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1225 transitions. [2025-01-09 21:17:14,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8134130146082338 [2025-01-09 21:17:14,642 INFO L175 Difference]: Start difference. First operand has 226 places, 251 transitions, 843 flow. Second operand 6 states and 1225 transitions. [2025-01-09 21:17:14,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 279 transitions, 1233 flow [2025-01-09 21:17:14,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 279 transitions, 1185 flow, removed 24 selfloop flow, removed 0 redundant places. [2025-01-09 21:17:14,653 INFO L231 Difference]: Finished difference. Result has 224 places, 271 transitions, 1027 flow [2025-01-09 21:17:14,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1027, PETRI_PLACES=224, PETRI_TRANSITIONS=271} [2025-01-09 21:17:14,654 INFO L279 CegarLoopForPetriNet]: 245 programPoint places, -21 predicate places. [2025-01-09 21:17:14,654 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 271 transitions, 1027 flow [2025-01-09 21:17:14,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 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:17:14,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:14,656 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] [2025-01-09 21:17:14,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:17:14,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:17:14,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:14,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1783716836, now seen corresponding path program 1 times [2025-01-09 21:17:14,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:14,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361889252] [2025-01-09 21:17:14,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:14,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:14,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 21:17:14,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 21:17:14,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:14,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:17:15,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:15,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361889252] [2025-01-09 21:17:15,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361889252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:15,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:15,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:15,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910894045] [2025-01-09 21:17:15,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:15,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:17:15,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:15,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:17:15,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:17:15,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 251 [2025-01-09 21:17:15,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 271 transitions, 1027 flow. Second operand has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 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:17:15,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:15,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 251 [2025-01-09 21:17:15,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:16,095 INFO L124 PetriNetUnfolderBase]: 920/2277 cut-off events. [2025-01-09 21:17:16,095 INFO L125 PetriNetUnfolderBase]: For 2916/3070 co-relation queries the response was YES. [2025-01-09 21:17:16,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7170 conditions, 2277 events. 920/2277 cut-off events. For 2916/3070 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 14119 event pairs, 248 based on Foata normal form. 33/2260 useless extension candidates. Maximal degree in co-relation 5400. Up to 1189 conditions per place. [2025-01-09 21:17:16,119 INFO L140 encePairwiseOnDemand]: 236/251 looper letters, 104 selfloop transitions, 36 changer transitions 37/314 dead transitions. [2025-01-09 21:17:16,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 314 transitions, 1667 flow [2025-01-09 21:17:16,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1223 transitions. [2025-01-09 21:17:16,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8120849933598937 [2025-01-09 21:17:16,123 INFO L175 Difference]: Start difference. First operand has 224 places, 271 transitions, 1027 flow. Second operand 6 states and 1223 transitions. [2025-01-09 21:17:16,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 314 transitions, 1667 flow [2025-01-09 21:17:16,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 314 transitions, 1667 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:17:16,137 INFO L231 Difference]: Finished difference. Result has 232 places, 269 transitions, 1359 flow [2025-01-09 21:17:16,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1025, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1359, PETRI_PLACES=232, PETRI_TRANSITIONS=269} [2025-01-09 21:17:16,140 INFO L279 CegarLoopForPetriNet]: 245 programPoint places, -13 predicate places. [2025-01-09 21:17:16,140 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 269 transitions, 1359 flow [2025-01-09 21:17:16,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 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:17:16,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:16,141 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] [2025-01-09 21:17:16,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:17:16,141 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:17:16,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:16,142 INFO L85 PathProgramCache]: Analyzing trace with hash -870678194, now seen corresponding path program 1 times [2025-01-09 21:17:16,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:16,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167210544] [2025-01-09 21:17:16,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:16,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:16,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:17:16,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:17:16,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:16,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:17:16,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167210544] [2025-01-09 21:17:16,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167210544] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:16,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:16,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:17:16,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898204249] [2025-01-09 21:17:16,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:16,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:17:16,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:16,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:17:16,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:17:16,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 251 [2025-01-09 21:17:16,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 269 transitions, 1359 flow. Second operand has 5 states, 5 states have (on average 213.2) internal successors, (1066), 5 states have internal predecessors, (1066), 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:17:16,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:16,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 251 [2025-01-09 21:17:16,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:16,494 INFO L124 PetriNetUnfolderBase]: 135/497 cut-off events. [2025-01-09 21:17:16,494 INFO L125 PetriNetUnfolderBase]: For 993/993 co-relation queries the response was YES. [2025-01-09 21:17:16,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 497 events. 135/497 cut-off events. For 993/993 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2390 event pairs, 12 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 1260. Up to 151 conditions per place. [2025-01-09 21:17:16,498 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 37 selfloop transitions, 4 changer transitions 0/136 dead transitions. [2025-01-09 21:17:16,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 136 transitions, 558 flow [2025-01-09 21:17:16,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:17:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:17:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1308 transitions. [2025-01-09 21:17:16,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8685258964143426 [2025-01-09 21:17:16,502 INFO L175 Difference]: Start difference. First operand has 232 places, 269 transitions, 1359 flow. Second operand 6 states and 1308 transitions. [2025-01-09 21:17:16,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 136 transitions, 558 flow [2025-01-09 21:17:16,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 136 transitions, 418 flow, removed 70 selfloop flow, removed 3 redundant places. [2025-01-09 21:17:16,505 INFO L231 Difference]: Finished difference. Result has 138 places, 112 transitions, 248 flow [2025-01-09 21:17:16,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=138, PETRI_TRANSITIONS=112} [2025-01-09 21:17:16,506 INFO L279 CegarLoopForPetriNet]: 245 programPoint places, -107 predicate places. [2025-01-09 21:17:16,506 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 112 transitions, 248 flow [2025-01-09 21:17:16,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 213.2) internal successors, (1066), 5 states have internal predecessors, (1066), 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:17:16,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:17:16,507 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] [2025-01-09 21:17:16,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:17:16,507 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:17:16,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:17:16,508 INFO L85 PathProgramCache]: Analyzing trace with hash 133752418, now seen corresponding path program 1 times [2025-01-09 21:17:16,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:17:16,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273146302] [2025-01-09 21:17:16,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:17:16,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:17:16,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:17:16,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:17:16,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:17:16,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:17:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:17:16,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:17:16,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273146302] [2025-01-09 21:17:16,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273146302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:17:16,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:17:16,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:17:16,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802797925] [2025-01-09 21:17:16,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:17:16,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:17:16,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:17:16,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:17:16,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:17:16,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 251 [2025-01-09 21:17:16,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 112 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 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:17:16,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:17:16,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 251 [2025-01-09 21:17:16,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:17:16,655 INFO L124 PetriNetUnfolderBase]: 24/201 cut-off events. [2025-01-09 21:17:16,656 INFO L125 PetriNetUnfolderBase]: For 21/47 co-relation queries the response was YES. [2025-01-09 21:17:16,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 201 events. 24/201 cut-off events. For 21/47 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 463 event pairs, 18 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 315. Up to 47 conditions per place. [2025-01-09 21:17:16,657 INFO L140 encePairwiseOnDemand]: 249/251 looper letters, 0 selfloop transitions, 0 changer transitions 114/114 dead transitions. [2025-01-09 21:17:16,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 114 transitions, 288 flow [2025-01-09 21:17:16,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:17:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:17:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2025-01-09 21:17:16,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8937583001328021 [2025-01-09 21:17:16,660 INFO L175 Difference]: Start difference. First operand has 138 places, 112 transitions, 248 flow. Second operand 3 states and 673 transitions. [2025-01-09 21:17:16,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 114 transitions, 288 flow [2025-01-09 21:17:16,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 114 transitions, 281 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:17:16,661 INFO L231 Difference]: Finished difference. Result has 135 places, 0 transitions, 0 flow [2025-01-09 21:17:16,662 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=135, PETRI_TRANSITIONS=0} [2025-01-09 21:17:16,662 INFO L279 CegarLoopForPetriNet]: 245 programPoint places, -110 predicate places. [2025-01-09 21:17:16,662 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 0 transitions, 0 flow [2025-01-09 21:17:16,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 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:17:16,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 23 remaining) [2025-01-09 21:17:16,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-01-09 21:17:16,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-01-09 21:17:16,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-01-09 21:17:16,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-01-09 21:17:16,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-01-09 21:17:16,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-01-09 21:17:16,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-01-09 21:17:16,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-01-09 21:17:16,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-01-09 21:17:16,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-01-09 21:17:16,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-01-09 21:17:16,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2025-01-09 21:17:16,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2025-01-09 21:17:16,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-01-09 21:17:16,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-01-09 21:17:16,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-01-09 21:17:16,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-01-09 21:17:16,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-01-09 21:17:16,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-01-09 21:17:16,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr0ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-01-09 21:17:16,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr1ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-01-09 21:17:16,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location my_callbackErr2ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-01-09 21:17:16,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:17:16,669 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:17:16,673 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:17:16,673 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:17:16,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:17:16 BasicIcfg [2025-01-09 21:17:16,680 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:17:16,680 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:17:16,680 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:17:16,680 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:17:16,681 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:17:06" (3/4) ... [2025-01-09 21:17:16,683 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:17:16,686 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-01-09 21:17:16,692 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-01-09 21:17:16,692 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 21:17:16,693 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:17:16,693 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:17:16,782 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:17:16,783 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:17:16,783 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:17:16,784 INFO L158 Benchmark]: Toolchain (without parser) took 11843.77ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 103.7MB in the beginning and 224.6MB in the end (delta: -120.9MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. [2025-01-09 21:17:16,784 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 201.3MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:17:16,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 644.21ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 72.2MB in the end (delta: 31.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 21:17:16,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.49ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 69.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:17:16,787 INFO L158 Benchmark]: Boogie Preprocessor took 51.76ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 65.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:17:16,787 INFO L158 Benchmark]: RCFGBuilder took 866.62ms. Allocated memory is still 142.6MB. Free memory was 65.9MB in the beginning and 98.5MB in the end (delta: -32.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2025-01-09 21:17:16,788 INFO L158 Benchmark]: TraceAbstraction took 10102.82ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 97.8MB in the beginning and 233.0MB in the end (delta: -135.2MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2025-01-09 21:17:16,788 INFO L158 Benchmark]: Witness Printer took 102.67ms. Allocated memory is still 327.2MB. Free memory was 233.0MB in the beginning and 224.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:17:16,790 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52ms. Allocated memory is still 201.3MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 644.21ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 72.2MB in the end (delta: 31.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.49ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 69.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.76ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 65.9MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 866.62ms. Allocated memory is still 142.6MB. Free memory was 65.9MB in the beginning and 98.5MB in the end (delta: -32.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10102.82ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 97.8MB in the beginning and 233.0MB in the end (delta: -135.2MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * Witness Printer took 102.67ms. Allocated memory is still 327.2MB. Free memory was 233.0MB in the beginning and 224.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3924]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3925]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3930]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3939]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3931]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3961]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3940]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3962]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3957]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3963]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3958]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3964]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3908]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3911]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3914]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 260 locations, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1004 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 574 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 337 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2544 IncrementalHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 337 mSolverCounterUnsat, 95 mSDtfsCounter, 2544 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1359occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 739 NumberOfCodeBlocks, 739 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 728 ConstructedInterpolants, 0 QuantifiedInterpolants, 1284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 21/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:17:16,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE