./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0224e82797c7b26c7800eaf85be5e5678e7961d21aa4e2312eda2860d261b33a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:31,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:31,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:33:31,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:31,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:31,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:31,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:31,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:31,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:31,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:31,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:31,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:31,135 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:31,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:31,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:31,136 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:31,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:31,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:31,136 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:31,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:31,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:31,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:31,136 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:31,136 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:31,136 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:31,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:31,137 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:31,137 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:31,137 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:31,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:31,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:31,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:31,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:31,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:31,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:31,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:31,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:31,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:31,138 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:31,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:31,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:31,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:31,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:31,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:31,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:31,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:31,138 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 -> 0224e82797c7b26c7800eaf85be5e5678e7961d21aa4e2312eda2860d261b33a [2025-01-09 21:33:31,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:31,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:31,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:31,327 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:31,327 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:31,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2025-01-09 21:33:32,450 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16dbdb0f9/07ac112f02d74005a6f257cd655a43f9/FLAG739688231 [2025-01-09 21:33:32,707 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:32,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2025-01-09 21:33:32,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16dbdb0f9/07ac112f02d74005a6f257cd655a43f9/FLAG739688231 [2025-01-09 21:33:32,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16dbdb0f9/07ac112f02d74005a6f257cd655a43f9 [2025-01-09 21:33:32,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:32,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:32,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:32,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:32,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:32,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:32" (1/1) ... [2025-01-09 21:33:32,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba8ab43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:32, skipping insertion in model container [2025-01-09 21:33:32,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:32" (1/1) ... [2025-01-09 21:33:32,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:32,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:32,878 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:32,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:32,910 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:32,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:32 WrapperNode [2025-01-09 21:33:32,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:32,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:32,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:32,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:32,915 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:33:32" (1/1) ... [2025-01-09 21:33:32,920 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:33:32" (1/1) ... [2025-01-09 21:33:32,934 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2025-01-09 21:33:32,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:32,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:32,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:32,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:32,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:32" (1/1) ... [2025-01-09 21:33:32,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:32" (1/1) ... [2025-01-09 21:33:32,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:32" (1/1) ... [2025-01-09 21:33:32,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:32" (1/1) ... [2025-01-09 21:33:32,950 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:32" (1/1) ... [2025-01-09 21:33:32,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:32" (1/1) ... [2025-01-09 21:33:32,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:32" (1/1) ... [2025-01-09 21:33:32,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:32" (1/1) ... [2025-01-09 21:33:32,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:32" (1/1) ... [2025-01-09 21:33:32,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:32,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:32,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:32,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:32,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:32" (1/1) ... [2025-01-09 21:33:32,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:32,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:32,984 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:33:32,986 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:33:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:33,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:33,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:33,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:33:33,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:33:33,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:33,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:33,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:33,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:33,001 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:33:33,069 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:33,071 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:33,533 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:33,534 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:33,726 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:33,727 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:33:33,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:33 BoogieIcfgContainer [2025-01-09 21:33:33,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:33,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:33,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:33,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:33,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:32" (1/3) ... [2025-01-09 21:33:33,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375b2048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:33, skipping insertion in model container [2025-01-09 21:33:33,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:32" (2/3) ... [2025-01-09 21:33:33,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375b2048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:33, skipping insertion in model container [2025-01-09 21:33:33,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:33" (3/3) ... [2025-01-09 21:33:33,735 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2025-01-09 21:33:33,745 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:33,747 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-min-array-hom.wvr.c that has 4 procedures, 227 locations, 1 initial locations, 4 loop locations, and 35 error locations. [2025-01-09 21:33:33,748 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:33,806 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:33:33,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 239 transitions, 499 flow [2025-01-09 21:33:33,872 INFO L124 PetriNetUnfolderBase]: 13/236 cut-off events. [2025-01-09 21:33:33,873 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:33:33,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 236 events. 13/236 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 303 event pairs, 0 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 174. Up to 2 conditions per place. [2025-01-09 21:33:33,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 239 transitions, 499 flow [2025-01-09 21:33:33,881 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 214 places, 215 transitions, 448 flow [2025-01-09 21:33:33,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:33,893 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;@41466a86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:33,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-01-09 21:33:33,897 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:33,897 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-01-09 21:33:33,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:33,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:33,898 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] [2025-01-09 21:33:33,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:33,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:33,901 INFO L85 PathProgramCache]: Analyzing trace with hash -676786002, now seen corresponding path program 1 times [2025-01-09 21:33:33,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:33,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12483442] [2025-01-09 21:33:33,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:33,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:33,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:33:33,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:33:33,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:33,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:33,997 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:33:33,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:33,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12483442] [2025-01-09 21:33:33,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12483442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:33,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:33,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:33,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128777412] [2025-01-09 21:33:33,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:34,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:34,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:34,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:34,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:34,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 239 [2025-01-09 21:33:34,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 215 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 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:33:34,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:34,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 239 [2025-01-09 21:33:34,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:34,159 INFO L124 PetriNetUnfolderBase]: 77/478 cut-off events. [2025-01-09 21:33:34,160 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-01-09 21:33:34,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 478 events. 77/478 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1933 event pairs, 38 based on Foata normal form. 35/438 useless extension candidates. Maximal degree in co-relation 446. Up to 113 conditions per place. [2025-01-09 21:33:34,164 INFO L140 encePairwiseOnDemand]: 212/239 looper letters, 16 selfloop transitions, 2 changer transitions 3/190 dead transitions. [2025-01-09 21:33:34,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 190 transitions, 434 flow [2025-01-09 21:33:34,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2025-01-09 21:33:34,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8675034867503487 [2025-01-09 21:33:34,174 INFO L175 Difference]: Start difference. First operand has 214 places, 215 transitions, 448 flow. Second operand 3 states and 622 transitions. [2025-01-09 21:33:34,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 190 transitions, 434 flow [2025-01-09 21:33:34,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 190 transitions, 422 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:33:34,181 INFO L231 Difference]: Finished difference. Result has 191 places, 187 transitions, 384 flow [2025-01-09 21:33:34,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=191, PETRI_TRANSITIONS=187} [2025-01-09 21:33:34,184 INFO L279 CegarLoopForPetriNet]: 214 programPoint places, -23 predicate places. [2025-01-09 21:33:34,184 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 187 transitions, 384 flow [2025-01-09 21:33:34,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 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:33:34,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:34,185 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] [2025-01-09 21:33:34,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:34,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:34,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:34,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2118417138, now seen corresponding path program 1 times [2025-01-09 21:33:34,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:34,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154347991] [2025-01-09 21:33:34,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:34,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:34,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:33:34,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:33:34,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:34,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:34,215 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:33:34,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:34,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154347991] [2025-01-09 21:33:34,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154347991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:34,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:34,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:34,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7890742] [2025-01-09 21:33:34,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:34,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:34,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:34,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:34,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:34,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 239 [2025-01-09 21:33:34,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 187 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 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:33:34,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:34,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 239 [2025-01-09 21:33:34,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:34,292 INFO L124 PetriNetUnfolderBase]: 50/355 cut-off events. [2025-01-09 21:33:34,292 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:33:34,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 355 events. 50/355 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1193 event pairs, 34 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 425. Up to 85 conditions per place. [2025-01-09 21:33:34,295 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 16 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2025-01-09 21:33:34,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 186 transitions, 418 flow [2025-01-09 21:33:34,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 598 transitions. [2025-01-09 21:33:34,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8340306834030683 [2025-01-09 21:33:34,297 INFO L175 Difference]: Start difference. First operand has 191 places, 187 transitions, 384 flow. Second operand 3 states and 598 transitions. [2025-01-09 21:33:34,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 186 transitions, 418 flow [2025-01-09 21:33:34,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 186 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:34,300 INFO L231 Difference]: Finished difference. Result has 187 places, 186 transitions, 382 flow [2025-01-09 21:33:34,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=187, PETRI_TRANSITIONS=186} [2025-01-09 21:33:34,301 INFO L279 CegarLoopForPetriNet]: 214 programPoint places, -27 predicate places. [2025-01-09 21:33:34,301 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 186 transitions, 382 flow [2025-01-09 21:33:34,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 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:33:34,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:34,302 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] [2025-01-09 21:33:34,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:34,302 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:34,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:34,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2136954397, now seen corresponding path program 1 times [2025-01-09 21:33:34,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:34,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203718908] [2025-01-09 21:33:34,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:34,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:34,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:33:34,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:33:34,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:34,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:34,330 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:33:34,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203718908] [2025-01-09 21:33:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203718908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:34,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:34,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:34,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154878315] [2025-01-09 21:33:34,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:34,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:34,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:34,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:34,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:34,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 239 [2025-01-09 21:33:34,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 186 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:34,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:34,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 239 [2025-01-09 21:33:34,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:34,396 INFO L124 PetriNetUnfolderBase]: 83/424 cut-off events. [2025-01-09 21:33:34,396 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:33:34,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 424 events. 83/424 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1724 event pairs, 59 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 539. Up to 135 conditions per place. [2025-01-09 21:33:34,399 INFO L140 encePairwiseOnDemand]: 234/239 looper letters, 17 selfloop transitions, 1 changer transitions 0/182 dead transitions. [2025-01-09 21:33:34,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 182 transitions, 410 flow [2025-01-09 21:33:34,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions. [2025-01-09 21:33:34,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8298465829846583 [2025-01-09 21:33:34,400 INFO L175 Difference]: Start difference. First operand has 187 places, 186 transitions, 382 flow. Second operand 3 states and 595 transitions. [2025-01-09 21:33:34,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 182 transitions, 410 flow [2025-01-09 21:33:34,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 182 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:34,403 INFO L231 Difference]: Finished difference. Result has 183 places, 182 transitions, 372 flow [2025-01-09 21:33:34,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=183, PETRI_TRANSITIONS=182} [2025-01-09 21:33:34,404 INFO L279 CegarLoopForPetriNet]: 214 programPoint places, -31 predicate places. [2025-01-09 21:33:34,404 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 182 transitions, 372 flow [2025-01-09 21:33:34,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:34,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:34,405 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] [2025-01-09 21:33:34,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:34,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:34,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:34,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1217873890, now seen corresponding path program 1 times [2025-01-09 21:33:34,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:34,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302272991] [2025-01-09 21:33:34,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:34,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:34,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:33:34,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:33:34,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:34,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:34,511 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:33:34,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:34,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302272991] [2025-01-09 21:33:34,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302272991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:34,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:34,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:34,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528300304] [2025-01-09 21:33:34,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:34,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:34,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:34,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:34,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:34,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 239 [2025-01-09 21:33:34,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 182 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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:33:34,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:34,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 239 [2025-01-09 21:33:34,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:34,592 INFO L124 PetriNetUnfolderBase]: 32/292 cut-off events. [2025-01-09 21:33:34,592 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:33:34,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 292 events. 32/292 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 758 event pairs, 15 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 315. Up to 50 conditions per place. [2025-01-09 21:33:34,593 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 12 selfloop transitions, 2 changer transitions 0/181 dead transitions. [2025-01-09 21:33:34,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 181 transitions, 398 flow [2025-01-09 21:33:34,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 606 transitions. [2025-01-09 21:33:34,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8451882845188284 [2025-01-09 21:33:34,595 INFO L175 Difference]: Start difference. First operand has 183 places, 182 transitions, 372 flow. Second operand 3 states and 606 transitions. [2025-01-09 21:33:34,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 181 transitions, 398 flow [2025-01-09 21:33:34,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 181 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:34,597 INFO L231 Difference]: Finished difference. Result has 183 places, 181 transitions, 373 flow [2025-01-09 21:33:34,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=373, PETRI_PLACES=183, PETRI_TRANSITIONS=181} [2025-01-09 21:33:34,598 INFO L279 CegarLoopForPetriNet]: 214 programPoint places, -31 predicate places. [2025-01-09 21:33:34,598 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 181 transitions, 373 flow [2025-01-09 21:33:34,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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:33:34,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:34,599 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] [2025-01-09 21:33:34,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:34,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:34,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:34,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1560958751, now seen corresponding path program 1 times [2025-01-09 21:33:34,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:34,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213227965] [2025-01-09 21:33:34,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:34,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:34,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:33:34,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:33:34,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:34,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:35,088 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:33:35,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:35,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213227965] [2025-01-09 21:33:35,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213227965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:35,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:35,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:35,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659652804] [2025-01-09 21:33:35,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:35,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:35,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:35,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:35,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:35,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 239 [2025-01-09 21:33:35,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 181 transitions, 373 flow. Second operand has 6 states, 6 states have (on average 191.5) internal successors, (1149), 6 states have internal predecessors, (1149), 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:33:35,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:35,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 239 [2025-01-09 21:33:35,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:35,213 INFO L124 PetriNetUnfolderBase]: 32/291 cut-off events. [2025-01-09 21:33:35,213 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:33:35,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 291 events. 32/291 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 755 event pairs, 15 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 325. Up to 55 conditions per place. [2025-01-09 21:33:35,215 INFO L140 encePairwiseOnDemand]: 233/239 looper letters, 17 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2025-01-09 21:33:35,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 180 transitions, 415 flow [2025-01-09 21:33:35,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1163 transitions. [2025-01-09 21:33:35,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8110181311018131 [2025-01-09 21:33:35,219 INFO L175 Difference]: Start difference. First operand has 183 places, 181 transitions, 373 flow. Second operand 6 states and 1163 transitions. [2025-01-09 21:33:35,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 180 transitions, 415 flow [2025-01-09 21:33:35,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 180 transitions, 411 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:35,223 INFO L231 Difference]: Finished difference. Result has 185 places, 180 transitions, 377 flow [2025-01-09 21:33:35,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=185, PETRI_TRANSITIONS=180} [2025-01-09 21:33:35,226 INFO L279 CegarLoopForPetriNet]: 214 programPoint places, -29 predicate places. [2025-01-09 21:33:35,226 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 180 transitions, 377 flow [2025-01-09 21:33:35,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.5) internal successors, (1149), 6 states have internal predecessors, (1149), 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:33:35,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:35,228 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] [2025-01-09 21:33:35,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:35,228 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:35,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:35,229 INFO L85 PathProgramCache]: Analyzing trace with hash 460109449, now seen corresponding path program 1 times [2025-01-09 21:33:35,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:35,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354947125] [2025-01-09 21:33:35,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:35,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:35,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:33:35,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:33:35,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:35,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:35,266 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:33:35,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:35,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354947125] [2025-01-09 21:33:35,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354947125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:35,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:35,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:35,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134239791] [2025-01-09 21:33:35,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:35,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:35,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:35,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:35,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:35,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 239 [2025-01-09 21:33:35,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 180 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:35,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:35,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 239 [2025-01-09 21:33:35,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:35,388 INFO L124 PetriNetUnfolderBase]: 137/566 cut-off events. [2025-01-09 21:33:35,388 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-01-09 21:33:35,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 566 events. 137/566 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2617 event pairs, 71 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 756. Up to 187 conditions per place. [2025-01-09 21:33:35,391 INFO L140 encePairwiseOnDemand]: 234/239 looper letters, 17 selfloop transitions, 1 changer transitions 0/176 dead transitions. [2025-01-09 21:33:35,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 176 transitions, 405 flow [2025-01-09 21:33:35,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:35,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions. [2025-01-09 21:33:35,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8298465829846583 [2025-01-09 21:33:35,393 INFO L175 Difference]: Start difference. First operand has 185 places, 180 transitions, 377 flow. Second operand 3 states and 595 transitions. [2025-01-09 21:33:35,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 176 transitions, 405 flow [2025-01-09 21:33:35,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 176 transitions, 395 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:35,396 INFO L231 Difference]: Finished difference. Result has 178 places, 176 transitions, 361 flow [2025-01-09 21:33:35,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=361, PETRI_PLACES=178, PETRI_TRANSITIONS=176} [2025-01-09 21:33:35,398 INFO L279 CegarLoopForPetriNet]: 214 programPoint places, -36 predicate places. [2025-01-09 21:33:35,398 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 176 transitions, 361 flow [2025-01-09 21:33:35,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:35,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:35,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:35,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:35,399 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:35,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:35,401 INFO L85 PathProgramCache]: Analyzing trace with hash -983343183, now seen corresponding path program 1 times [2025-01-09 21:33:35,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:35,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779160268] [2025-01-09 21:33:35,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:35,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:35,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 21:33:35,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 21:33:35,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:35,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:35,463 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:33:35,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:35,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779160268] [2025-01-09 21:33:35,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779160268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:35,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:35,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:35,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944492020] [2025-01-09 21:33:35,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:35,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:35,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:35,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:35,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:35,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 239 [2025-01-09 21:33:35,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 176 transitions, 361 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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:33:35,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:35,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 239 [2025-01-09 21:33:35,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:35,515 INFO L124 PetriNetUnfolderBase]: 32/284 cut-off events. [2025-01-09 21:33:35,515 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:33:35,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 284 events. 32/284 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 716 event pairs, 15 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 306. Up to 47 conditions per place. [2025-01-09 21:33:35,517 INFO L140 encePairwiseOnDemand]: 237/239 looper letters, 10 selfloop transitions, 1 changer transitions 0/175 dead transitions. [2025-01-09 21:33:35,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 175 transitions, 381 flow [2025-01-09 21:33:35,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:35,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:35,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 615 transitions. [2025-01-09 21:33:35,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8577405857740585 [2025-01-09 21:33:35,519 INFO L175 Difference]: Start difference. First operand has 178 places, 176 transitions, 361 flow. Second operand 3 states and 615 transitions. [2025-01-09 21:33:35,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 175 transitions, 381 flow [2025-01-09 21:33:35,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 175 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:35,521 INFO L231 Difference]: Finished difference. Result has 178 places, 175 transitions, 360 flow [2025-01-09 21:33:35,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=178, PETRI_TRANSITIONS=175} [2025-01-09 21:33:35,522 INFO L279 CegarLoopForPetriNet]: 214 programPoint places, -36 predicate places. [2025-01-09 21:33:35,522 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 175 transitions, 360 flow [2025-01-09 21:33:35,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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:33:35,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:35,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:35,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:35,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:35,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash 978379362, now seen corresponding path program 1 times [2025-01-09 21:33:35,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:35,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305365935] [2025-01-09 21:33:35,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:35,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:35,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 21:33:35,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 21:33:35,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:35,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:35,573 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:33:35,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:35,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305365935] [2025-01-09 21:33:35,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305365935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:35,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:35,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:35,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234505118] [2025-01-09 21:33:35,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:35,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:35,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:35,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:35,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:35,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 239 [2025-01-09 21:33:35,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 175 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 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:33:35,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:35,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 239 [2025-01-09 21:33:35,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:35,636 INFO L124 PetriNetUnfolderBase]: 32/282 cut-off events. [2025-01-09 21:33:35,637 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:33:35,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 282 events. 32/282 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 713 event pairs, 15 based on Foata normal form. 1/269 useless extension candidates. Maximal degree in co-relation 325. Up to 47 conditions per place. [2025-01-09 21:33:35,640 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 10 selfloop transitions, 1 changer transitions 2/173 dead transitions. [2025-01-09 21:33:35,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 173 transitions, 380 flow [2025-01-09 21:33:35,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 608 transitions. [2025-01-09 21:33:35,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8479776847977685 [2025-01-09 21:33:35,642 INFO L175 Difference]: Start difference. First operand has 178 places, 175 transitions, 360 flow. Second operand 3 states and 608 transitions. [2025-01-09 21:33:35,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 173 transitions, 380 flow [2025-01-09 21:33:35,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 173 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:35,645 INFO L231 Difference]: Finished difference. Result has 177 places, 171 transitions, 353 flow [2025-01-09 21:33:35,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=353, PETRI_PLACES=177, PETRI_TRANSITIONS=171} [2025-01-09 21:33:35,646 INFO L279 CegarLoopForPetriNet]: 214 programPoint places, -37 predicate places. [2025-01-09 21:33:35,647 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 171 transitions, 353 flow [2025-01-09 21:33:35,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 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:33:35,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:35,648 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:35,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:35,648 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-01-09 21:33:35,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:35,649 INFO L85 PathProgramCache]: Analyzing trace with hash -375246917, now seen corresponding path program 1 times [2025-01-09 21:33:35,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:35,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274230402] [2025-01-09 21:33:35,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:35,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:35,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 21:33:35,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 21:33:35,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:35,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:35,711 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:33:35,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:35,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274230402] [2025-01-09 21:33:35,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274230402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:35,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:35,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:35,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083950933] [2025-01-09 21:33:35,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:35,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:35,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:35,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:35,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:35,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 239 [2025-01-09 21:33:35,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 171 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 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:33:35,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:35,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 239 [2025-01-09 21:33:35,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:35,772 INFO L124 PetriNetUnfolderBase]: 32/278 cut-off events. [2025-01-09 21:33:35,772 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:33:35,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 278 events. 32/278 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 709 event pairs, 15 based on Foata normal form. 1/267 useless extension candidates. Maximal degree in co-relation 328. Up to 47 conditions per place. [2025-01-09 21:33:35,774 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 0 selfloop transitions, 0 changer transitions 169/169 dead transitions. [2025-01-09 21:33:35,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 169 transitions, 373 flow [2025-01-09 21:33:35,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 608 transitions. [2025-01-09 21:33:35,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8479776847977685 [2025-01-09 21:33:35,776 INFO L175 Difference]: Start difference. First operand has 177 places, 171 transitions, 353 flow. Second operand 3 states and 608 transitions. [2025-01-09 21:33:35,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 169 transitions, 373 flow [2025-01-09 21:33:35,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 169 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:35,777 INFO L231 Difference]: Finished difference. Result has 174 places, 0 transitions, 0 flow [2025-01-09 21:33:35,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=174, PETRI_TRANSITIONS=0} [2025-01-09 21:33:35,779 INFO L279 CegarLoopForPetriNet]: 214 programPoint places, -40 predicate places. [2025-01-09 21:33:35,780 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 0 transitions, 0 flow [2025-01-09 21:33:35,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 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:33:35,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (59 of 60 remaining) [2025-01-09 21:33:35,783 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (58 of 60 remaining) [2025-01-09 21:33:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (57 of 60 remaining) [2025-01-09 21:33:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 60 remaining) [2025-01-09 21:33:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (55 of 60 remaining) [2025-01-09 21:33:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (54 of 60 remaining) [2025-01-09 21:33:35,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (53 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (52 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (51 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (50 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (49 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (48 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (47 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (46 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (45 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (44 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (43 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (42 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (41 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (40 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (39 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (38 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (37 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (36 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (35 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (31 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (30 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (29 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (28 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (27 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (26 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (25 of 60 remaining) [2025-01-09 21:33:35,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (17 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (16 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (15 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (11 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (9 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (8 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (7 of 60 remaining) [2025-01-09 21:33:35,786 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 60 remaining) [2025-01-09 21:33:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (5 of 60 remaining) [2025-01-09 21:33:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (4 of 60 remaining) [2025-01-09 21:33:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 60 remaining) [2025-01-09 21:33:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 60 remaining) [2025-01-09 21:33:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 60 remaining) [2025-01-09 21:33:35,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 60 remaining) [2025-01-09 21:33:35,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:35,791 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:35,798 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:35,799 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:35,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:35 BasicIcfg [2025-01-09 21:33:35,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:35,803 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:35,803 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:35,803 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:35,804 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:33" (3/4) ... [2025-01-09 21:33:35,805 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:35,807 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:35,807 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:35,807 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:33:35,811 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-01-09 21:33:35,811 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:35,811 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:33:35,811 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:35,886 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:35,886 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:35,886 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:35,887 INFO L158 Benchmark]: Toolchain (without parser) took 3151.64ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 104.3MB in the beginning and 126.4MB in the end (delta: -22.1MB). Peak memory consumption was 148.6MB. Max. memory is 16.1GB. [2025-01-09 21:33:35,891 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:35,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.82ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 91.9MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:33:35,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.52ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:35,891 INFO L158 Benchmark]: Boogie Preprocessor took 21.22ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 87.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:35,891 INFO L158 Benchmark]: RCFGBuilder took 771.01ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 97.2MB in the end (delta: -9.3MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:35,892 INFO L158 Benchmark]: TraceAbstraction took 2074.16ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 96.5MB in the beginning and 133.5MB in the end (delta: -37.0MB). Peak memory consumption was 134.5MB. Max. memory is 16.1GB. [2025-01-09 21:33:35,892 INFO L158 Benchmark]: Witness Printer took 83.07ms. Allocated memory is still 310.4MB. Free memory was 133.5MB in the beginning and 126.4MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:35,893 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.17ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.82ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 91.9MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.52ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 89.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.22ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 87.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 771.01ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 97.2MB in the end (delta: -9.3MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2074.16ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 96.5MB in the beginning and 133.5MB in the end (delta: -37.0MB). Peak memory consumption was 134.5MB. Max. memory is 16.1GB. * Witness Printer took 83.07ms. Allocated memory is still 310.4MB. Free memory was 133.5MB in the beginning and 126.4MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: 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 7 procedures, 293 locations, 60 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: 2.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 306 IncrementalHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 34 mSDtfsCounter, 306 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=448occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 675 NumberOfCodeBlocks, 675 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 666 ConstructedInterpolants, 0 QuantifiedInterpolants, 797 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:35,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE