./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d 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-array-sum-alt2.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 1d936eafcc314e66bb4cd572754c58bf1f2fc59d35c83764f43dae769bce220a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:40:15,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:40:15,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:40:15,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:40:15,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:40:15,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:40:15,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:40:15,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:40:15,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:40:15,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:40:15,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:40:15,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:40:15,300 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:40:15,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:40:15,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:40:15,301 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:40:15,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:40:15,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:40:15,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:40:15,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:40:15,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:40:15,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:40:15,301 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:40:15,301 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:40:15,301 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:40:15,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:40:15,301 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:40:15,301 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:40:15,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:40:15,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:40:15,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:40:15,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:15,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:40:15,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:40:15,302 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:40:15,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:40:15,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:40:15,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:40:15,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:40:15,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:40:15,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:40:15,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:40:15,302 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 -> 1d936eafcc314e66bb4cd572754c58bf1f2fc59d35c83764f43dae769bce220a [2025-02-08 05:40:15,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:40:15,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:40:15,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:40:15,548 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:40:15,548 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:40:15,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2025-02-08 05:40:16,757 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd41f4da0/a3d64bb6e6184c889a491f51c020cc35/FLAGbb1597fdc [2025-02-08 05:40:17,019 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:40:17,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2025-02-08 05:40:17,028 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd41f4da0/a3d64bb6e6184c889a491f51c020cc35/FLAGbb1597fdc [2025-02-08 05:40:17,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd41f4da0/a3d64bb6e6184c889a491f51c020cc35 [2025-02-08 05:40:17,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:40:17,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:40:17,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:17,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:40:17,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:40:17,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:17" (1/1) ... [2025-02-08 05:40:17,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413dff3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17, skipping insertion in model container [2025-02-08 05:40:17,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:17" (1/1) ... [2025-02-08 05:40:17,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:40:17,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:17,482 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:40:17,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:17,509 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:40:17,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17 WrapperNode [2025-02-08 05:40:17,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:17,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:17,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:40:17,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:40:17,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17" (1/1) ... [2025-02-08 05:40:17,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17" (1/1) ... [2025-02-08 05:40:17,543 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 260 [2025-02-08 05:40:17,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:17,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:40:17,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:40:17,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:40:17,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17" (1/1) ... [2025-02-08 05:40:17,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17" (1/1) ... [2025-02-08 05:40:17,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17" (1/1) ... [2025-02-08 05:40:17,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17" (1/1) ... [2025-02-08 05:40:17,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17" (1/1) ... [2025-02-08 05:40:17,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17" (1/1) ... [2025-02-08 05:40:17,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17" (1/1) ... [2025-02-08 05:40:17,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17" (1/1) ... [2025-02-08 05:40:17,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:40:17,568 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:40:17,568 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:40:17,568 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:40:17,569 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17" (1/1) ... [2025-02-08 05:40:17,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:17,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:40:17,602 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-02-08 05:40:17,612 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-02-08 05:40:17,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:40:17,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:40:17,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:40:17,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:40:17,628 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:40:17,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:40:17,629 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:40:17,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:40:17,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:40:17,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:40:17,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:40:17,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:40:17,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:40:17,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:40:17,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:40:17,630 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:40:17,705 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:40:17,706 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:40:17,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49: havoc #t~nondet3#1; [2025-02-08 05:40:17,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-1: havoc #t~ret2#1; [2025-02-08 05:40:17,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-2: assume #race~res1~0 == #t~nondet3#1; [2025-02-08 05:40:17,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-2: assume !(#race~res1~0 == #t~nondet3#1); [2025-02-08 05:40:17,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-3: havoc #t~mem1#1; [2025-02-08 05:40:17,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-4: #race~res1~0 := #t~nondet3#1; [2025-02-08 05:40:17,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-5: havoc #t~nondet3#1; [2025-02-08 05:40:17,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-6: ~res1~0 := #t~ret2#1; [2025-02-08 05:40:17,811 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 05:40:17,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:17,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:17,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-10: #t~ret2#1 := plus_#res#1; [2025-02-08 05:40:17,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50: [2025-02-08 05:40:17,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-2: havoc #t~post4#1; [2025-02-08 05:40:17,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-3: ~i~0#1 := 1 + #t~post4#1; [2025-02-08 05:40:17,812 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-4: #t~post4#1 := ~i~0#1; [2025-02-08 05:40:17,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60: [2025-02-08 05:40:17,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-2: havoc #t~post8#1; [2025-02-08 05:40:17,859 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-3: ~i~1#1 := 1 + #t~post8#1; [2025-02-08 05:40:17,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-4: #t~post8#1 := ~i~1#1; [2025-02-08 05:40:17,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc #t~nondet7#1; [2025-02-08 05:40:17,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-1: havoc #t~ret6#1; [2025-02-08 05:40:17,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-2: assume #race~res2~0 == #t~nondet7#1; [2025-02-08 05:40:17,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-2: assume !(#race~res2~0 == #t~nondet7#1); [2025-02-08 05:40:17,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-3: havoc #t~mem5#1; [2025-02-08 05:40:17,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-4: #race~res2~0 := #t~nondet7#1; [2025-02-08 05:40:17,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-5: havoc #t~nondet7#1; [2025-02-08 05:40:17,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-6: ~res2~0 := #t~ret6#1; [2025-02-08 05:40:17,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647; [2025-02-08 05:40:17,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:17,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:17,860 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-10: #t~ret6#1 := plus_#res#1; [2025-02-08 05:40:17,932 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69: havoc #t~nondet11#1; [2025-02-08 05:40:17,932 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-1: havoc #t~ret10#1; [2025-02-08 05:40:17,932 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-2: assume #race~res2~0 == #t~nondet11#1; [2025-02-08 05:40:17,932 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-2: assume !(#race~res2~0 == #t~nondet11#1); [2025-02-08 05:40:17,932 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-3: havoc #t~mem9#1; [2025-02-08 05:40:17,932 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-4: #race~res2~0 := #t~nondet11#1; [2025-02-08 05:40:17,932 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-5: havoc #t~nondet11#1; [2025-02-08 05:40:17,932 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-6: ~res2~0 := #t~ret10#1; [2025-02-08 05:40:17,932 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-7: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647; [2025-02-08 05:40:17,932 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-8: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:17,933 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:17,933 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-10: #t~ret10#1 := plus_#res#1; [2025-02-08 05:40:17,933 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: [2025-02-08 05:40:17,933 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-2: havoc #t~post12#1; [2025-02-08 05:40:17,933 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-3: ~i~2#1 := 1 + #t~post12#1; [2025-02-08 05:40:17,933 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-4: #t~post12#1 := ~i~2#1; [2025-02-08 05:40:18,028 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:40:18,028 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:40:18,119 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L114 is not an error location. [2025-02-08 05:40:18,119 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L114 is not an error location. [2025-02-08 05:40:18,120 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L114 is not an error location. [2025-02-08 05:40:18,120 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:40:18,121 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:40:18,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:18 BoogieIcfgContainer [2025-02-08 05:40:18,121 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:40:18,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:40:18,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:40:18,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:40:18,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:40:17" (1/3) ... [2025-02-08 05:40:18,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190f5e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:18, skipping insertion in model container [2025-02-08 05:40:18,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17" (2/3) ... [2025-02-08 05:40:18,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190f5e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:18, skipping insertion in model container [2025-02-08 05:40:18,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:18" (3/3) ... [2025-02-08 05:40:18,128 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2025-02-08 05:40:18,137 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:40:18,138 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt2.wvr.c that has 4 procedures, 198 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-02-08 05:40:18,138 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:40:18,205 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:40:18,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 206 transitions, 433 flow [2025-02-08 05:40:18,273 INFO L124 PetriNetUnfolderBase]: 9/203 cut-off events. [2025-02-08 05:40:18,274 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:40:18,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 9/203 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 225 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2025-02-08 05:40:18,278 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 206 transitions, 433 flow [2025-02-08 05:40:18,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 188 places, 186 transitions, 390 flow [2025-02-08 05:40:18,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:40:18,294 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;@2bb78eea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:40:18,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-02-08 05:40:18,299 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:40:18,299 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-02-08 05:40:18,299 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:40:18,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:18,300 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] [2025-02-08 05:40:18,300 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:40:18,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:18,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1370993158, now seen corresponding path program 1 times [2025-02-08 05:40:18,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:18,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323869019] [2025-02-08 05:40:18,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:18,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:18,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:40:18,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:40:18,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:18,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:18,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:18,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323869019] [2025-02-08 05:40:18,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323869019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:18,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:18,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:18,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700234333] [2025-02-08 05:40:18,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:18,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:18,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:18,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:18,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 206 [2025-02-08 05:40:18,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 186 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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-02-08 05:40:18,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:18,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 206 [2025-02-08 05:40:18,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:18,551 INFO L124 PetriNetUnfolderBase]: 40/357 cut-off events. [2025-02-08 05:40:18,552 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-08 05:40:18,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 357 events. 40/357 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1326 event pairs, 38 based on Foata normal form. 26/327 useless extension candidates. Maximal degree in co-relation 227. Up to 83 conditions per place. [2025-02-08 05:40:18,555 INFO L140 encePairwiseOnDemand]: 188/206 looper letters, 16 selfloop transitions, 2 changer transitions 3/170 dead transitions. [2025-02-08 05:40:18,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 170 transitions, 394 flow [2025-02-08 05:40:18,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2025-02-08 05:40:18,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8754045307443366 [2025-02-08 05:40:18,566 INFO L175 Difference]: Start difference. First operand has 188 places, 186 transitions, 390 flow. Second operand 3 states and 541 transitions. [2025-02-08 05:40:18,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 170 transitions, 394 flow [2025-02-08 05:40:18,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 170 transitions, 382 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:40:18,573 INFO L231 Difference]: Finished difference. Result has 174 places, 167 transitions, 344 flow [2025-02-08 05:40:18,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=174, PETRI_TRANSITIONS=167} [2025-02-08 05:40:18,577 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -14 predicate places. [2025-02-08 05:40:18,577 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 167 transitions, 344 flow [2025-02-08 05:40:18,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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-02-08 05:40:18,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:18,578 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] [2025-02-08 05:40:18,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:40:18,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:40:18,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:18,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1490468336, now seen corresponding path program 1 times [2025-02-08 05:40:18,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:18,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785377550] [2025-02-08 05:40:18,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:18,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:18,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:40:18,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:40:18,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:18,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:18,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:18,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785377550] [2025-02-08 05:40:18,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785377550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:18,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:18,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:18,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834378301] [2025-02-08 05:40:18,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:18,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:18,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:18,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:18,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:18,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 206 [2025-02-08 05:40:18,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 167 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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-02-08 05:40:18,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:18,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 206 [2025-02-08 05:40:18,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:18,703 INFO L124 PetriNetUnfolderBase]: 36/261 cut-off events. [2025-02-08 05:40:18,704 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:40:18,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 261 events. 36/261 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 712 event pairs, 34 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 324. Up to 77 conditions per place. [2025-02-08 05:40:18,705 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 16 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-02-08 05:40:18,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 166 transitions, 378 flow [2025-02-08 05:40:18,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:18,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2025-02-08 05:40:18,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8511326860841424 [2025-02-08 05:40:18,707 INFO L175 Difference]: Start difference. First operand has 174 places, 167 transitions, 344 flow. Second operand 3 states and 526 transitions. [2025-02-08 05:40:18,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 166 transitions, 378 flow [2025-02-08 05:40:18,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 166 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:18,710 INFO L231 Difference]: Finished difference. Result has 170 places, 166 transitions, 342 flow [2025-02-08 05:40:18,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=170, PETRI_TRANSITIONS=166} [2025-02-08 05:40:18,710 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -18 predicate places. [2025-02-08 05:40:18,711 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 342 flow [2025-02-08 05:40:18,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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-02-08 05:40:18,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:18,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:18,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:40:18,711 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:40:18,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:18,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1901334720, now seen corresponding path program 1 times [2025-02-08 05:40:18,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:18,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832577446] [2025-02-08 05:40:18,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:18,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:18,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:40:18,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:40:18,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:18,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:18,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:18,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832577446] [2025-02-08 05:40:18,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832577446] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:18,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:18,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54585950] [2025-02-08 05:40:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:18,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:18,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:18,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:18,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:18,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 206 [2025-02-08 05:40:18,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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-02-08 05:40:18,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:18,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 206 [2025-02-08 05:40:18,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:18,809 INFO L124 PetriNetUnfolderBase]: 61/330 cut-off events. [2025-02-08 05:40:18,809 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:40:18,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 330 events. 61/330 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1146 event pairs, 59 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 431. Up to 120 conditions per place. [2025-02-08 05:40:18,811 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 17 selfloop transitions, 1 changer transitions 0/162 dead transitions. [2025-02-08 05:40:18,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 162 transitions, 370 flow [2025-02-08 05:40:18,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2025-02-08 05:40:18,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8462783171521036 [2025-02-08 05:40:18,813 INFO L175 Difference]: Start difference. First operand has 170 places, 166 transitions, 342 flow. Second operand 3 states and 523 transitions. [2025-02-08 05:40:18,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 162 transitions, 370 flow [2025-02-08 05:40:18,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 162 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:18,816 INFO L231 Difference]: Finished difference. Result has 166 places, 162 transitions, 332 flow [2025-02-08 05:40:18,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=166, PETRI_TRANSITIONS=162} [2025-02-08 05:40:18,816 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -22 predicate places. [2025-02-08 05:40:18,817 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 162 transitions, 332 flow [2025-02-08 05:40:18,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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-02-08 05:40:18,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:18,817 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] [2025-02-08 05:40:18,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:40:18,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:40:18,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash 521427468, now seen corresponding path program 1 times [2025-02-08 05:40:18,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:18,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649378015] [2025-02-08 05:40:18,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:18,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:18,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:40:18,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:40:18,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:18,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:19,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:19,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649378015] [2025-02-08 05:40:19,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649378015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:19,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:19,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:19,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576610780] [2025-02-08 05:40:19,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:19,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:19,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:19,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:19,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:19,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 206 [2025-02-08 05:40:19,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 162 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 167.5) internal successors, (1005), 6 states have internal predecessors, (1005), 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-02-08 05:40:19,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:19,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 206 [2025-02-08 05:40:19,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:19,442 INFO L124 PetriNetUnfolderBase]: 17/217 cut-off events. [2025-02-08 05:40:19,443 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:40:19,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 217 events. 17/217 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs, 15 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 240. Up to 45 conditions per place. [2025-02-08 05:40:19,444 INFO L140 encePairwiseOnDemand]: 200/206 looper letters, 17 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2025-02-08 05:40:19,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 161 transitions, 374 flow [2025-02-08 05:40:19,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1019 transitions. [2025-02-08 05:40:19,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8244336569579288 [2025-02-08 05:40:19,446 INFO L175 Difference]: Start difference. First operand has 166 places, 162 transitions, 332 flow. Second operand 6 states and 1019 transitions. [2025-02-08 05:40:19,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 161 transitions, 374 flow [2025-02-08 05:40:19,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 161 transitions, 373 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:19,448 INFO L231 Difference]: Finished difference. Result has 169 places, 161 transitions, 339 flow [2025-02-08 05:40:19,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=339, PETRI_PLACES=169, PETRI_TRANSITIONS=161} [2025-02-08 05:40:19,449 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -19 predicate places. [2025-02-08 05:40:19,449 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 161 transitions, 339 flow [2025-02-08 05:40:19,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 167.5) internal successors, (1005), 6 states have internal predecessors, (1005), 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-02-08 05:40:19,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:19,450 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] [2025-02-08 05:40:19,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:40:19,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:40:19,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:19,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1547385340, now seen corresponding path program 1 times [2025-02-08 05:40:19,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:19,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651215861] [2025-02-08 05:40:19,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:19,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:19,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:40:19,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:40:19,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:19,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:19,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:19,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:19,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651215861] [2025-02-08 05:40:19,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651215861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:19,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:19,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:19,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581866795] [2025-02-08 05:40:19,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:19,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:19,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:19,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:19,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:19,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 206 [2025-02-08 05:40:19,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 161 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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-02-08 05:40:19,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:19,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 206 [2025-02-08 05:40:19,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:19,527 INFO L124 PetriNetUnfolderBase]: 17/216 cut-off events. [2025-02-08 05:40:19,527 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:40:19,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 216 events. 17/216 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 443 event pairs, 15 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 255. Up to 40 conditions per place. [2025-02-08 05:40:19,528 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 12 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2025-02-08 05:40:19,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 160 transitions, 365 flow [2025-02-08 05:40:19,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2025-02-08 05:40:19,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8640776699029126 [2025-02-08 05:40:19,530 INFO L175 Difference]: Start difference. First operand has 169 places, 161 transitions, 339 flow. Second operand 3 states and 534 transitions. [2025-02-08 05:40:19,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 160 transitions, 365 flow [2025-02-08 05:40:19,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 160 transitions, 355 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:40:19,532 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 331 flow [2025-02-08 05:40:19,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2025-02-08 05:40:19,533 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -23 predicate places. [2025-02-08 05:40:19,533 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 331 flow [2025-02-08 05:40:19,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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-02-08 05:40:19,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:19,534 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] [2025-02-08 05:40:19,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:40:19,534 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:40:19,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:19,535 INFO L85 PathProgramCache]: Analyzing trace with hash -118081792, now seen corresponding path program 1 times [2025-02-08 05:40:19,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:19,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688993180] [2025-02-08 05:40:19,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:19,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:19,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:40:19,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:40:19,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:19,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:19,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:19,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688993180] [2025-02-08 05:40:19,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688993180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:19,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:19,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:19,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739040285] [2025-02-08 05:40:19,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:19,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:19,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:19,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:19,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:19,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 206 [2025-02-08 05:40:19,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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-02-08 05:40:19,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:19,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 206 [2025-02-08 05:40:19,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:19,670 INFO L124 PetriNetUnfolderBase]: 73/413 cut-off events. [2025-02-08 05:40:19,670 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-02-08 05:40:19,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 413 events. 73/413 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1802 event pairs, 71 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 531. Up to 138 conditions per place. [2025-02-08 05:40:19,672 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 14 selfloop transitions, 1 changer transitions 3/156 dead transitions. [2025-02-08 05:40:19,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 156 transitions, 359 flow [2025-02-08 05:40:19,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2025-02-08 05:40:19,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8462783171521036 [2025-02-08 05:40:19,673 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 331 flow. Second operand 3 states and 523 transitions. [2025-02-08 05:40:19,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 156 transitions, 359 flow [2025-02-08 05:40:19,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 156 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:19,675 INFO L231 Difference]: Finished difference. Result has 161 places, 153 transitions, 315 flow [2025-02-08 05:40:19,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=315, PETRI_PLACES=161, PETRI_TRANSITIONS=153} [2025-02-08 05:40:19,677 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -27 predicate places. [2025-02-08 05:40:19,677 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 153 transitions, 315 flow [2025-02-08 05:40:19,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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-02-08 05:40:19,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:19,677 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] [2025-02-08 05:40:19,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:40:19,677 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:40:19,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash 407563280, now seen corresponding path program 1 times [2025-02-08 05:40:19,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:19,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255257180] [2025-02-08 05:40:19,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:19,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:19,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-08 05:40:19,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-08 05:40:19,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:19,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:19,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:19,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255257180] [2025-02-08 05:40:19,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255257180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:19,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:19,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:19,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909774087] [2025-02-08 05:40:19,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:19,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:19,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:19,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:19,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:19,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 206 [2025-02-08 05:40:19,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 153 transitions, 315 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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-02-08 05:40:19,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:19,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 206 [2025-02-08 05:40:19,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:19,807 INFO L124 PetriNetUnfolderBase]: 2/152 cut-off events. [2025-02-08 05:40:19,807 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:40:19,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 152 events. 2/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 97 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 131. Up to 7 conditions per place. [2025-02-08 05:40:19,807 INFO L140 encePairwiseOnDemand]: 204/206 looper letters, 7 selfloop transitions, 1 changer transitions 3/152 dead transitions. [2025-02-08 05:40:19,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 152 transitions, 329 flow [2025-02-08 05:40:19,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2025-02-08 05:40:19,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8737864077669902 [2025-02-08 05:40:19,811 INFO L175 Difference]: Start difference. First operand has 161 places, 153 transitions, 315 flow. Second operand 3 states and 540 transitions. [2025-02-08 05:40:19,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 152 transitions, 329 flow [2025-02-08 05:40:19,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 152 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:19,818 INFO L231 Difference]: Finished difference. Result has 158 places, 149 transitions, 308 flow [2025-02-08 05:40:19,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=158, PETRI_TRANSITIONS=149} [2025-02-08 05:40:19,818 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -30 predicate places. [2025-02-08 05:40:19,819 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 149 transitions, 308 flow [2025-02-08 05:40:19,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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-02-08 05:40:19,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:19,819 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] [2025-02-08 05:40:19,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:40:19,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-02-08 05:40:19,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:19,820 INFO L85 PathProgramCache]: Analyzing trace with hash 647064850, now seen corresponding path program 1 times [2025-02-08 05:40:19,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:19,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431727665] [2025-02-08 05:40:19,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:19,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:19,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 05:40:19,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 05:40:19,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:19,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:19,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:19,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431727665] [2025-02-08 05:40:19,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431727665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:19,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:19,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:19,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828783384] [2025-02-08 05:40:19,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:19,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:19,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:19,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:19,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:19,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 206 [2025-02-08 05:40:19,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 149 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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-02-08 05:40:19,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:19,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 206 [2025-02-08 05:40:19,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:19,909 INFO L124 PetriNetUnfolderBase]: 2/148 cut-off events. [2025-02-08 05:40:19,909 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:40:19,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 148 events. 2/148 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 1/147 useless extension candidates. Maximal degree in co-relation 156. Up to 7 conditions per place. [2025-02-08 05:40:19,909 INFO L140 encePairwiseOnDemand]: 204/206 looper letters, 0 selfloop transitions, 0 changer transitions 148/148 dead transitions. [2025-02-08 05:40:19,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 148 transitions, 320 flow [2025-02-08 05:40:19,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2025-02-08 05:40:19,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.872168284789644 [2025-02-08 05:40:19,911 INFO L175 Difference]: Start difference. First operand has 158 places, 149 transitions, 308 flow. Second operand 3 states and 539 transitions. [2025-02-08 05:40:19,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 148 transitions, 320 flow [2025-02-08 05:40:19,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 148 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:19,913 INFO L231 Difference]: Finished difference. Result has 155 places, 0 transitions, 0 flow [2025-02-08 05:40:19,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=155, PETRI_TRANSITIONS=0} [2025-02-08 05:40:19,913 INFO L279 CegarLoopForPetriNet]: 188 programPoint places, -33 predicate places. [2025-02-08 05:40:19,914 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 0 transitions, 0 flow [2025-02-08 05:40:19,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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-02-08 05:40:19,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (38 of 39 remaining) [2025-02-08 05:40:19,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2025-02-08 05:40:19,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2025-02-08 05:40:19,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2025-02-08 05:40:19,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2025-02-08 05:40:19,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2025-02-08 05:40:19,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (32 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (28 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (21 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2025-02-08 05:40:19,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2025-02-08 05:40:19,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2025-02-08 05:40:19,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2025-02-08 05:40:19,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2025-02-08 05:40:19,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2025-02-08 05:40:19,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2025-02-08 05:40:19,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (0 of 39 remaining) [2025-02-08 05:40:19,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:40:19,920 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:19,929 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:40:19,929 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:40:19,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:40:19 BasicIcfg [2025-02-08 05:40:19,934 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:40:19,934 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:40:19,934 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:40:19,934 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:40:19,935 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:18" (3/4) ... [2025-02-08 05:40:19,936 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:40:19,938 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:40:19,938 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:40:19,938 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:40:19,944 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-02-08 05:40:19,944 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:40:19,944 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:40:19,944 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:40:20,017 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:40:20,017 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:40:20,017 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:40:20,018 INFO L158 Benchmark]: Toolchain (without parser) took 2675.60ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 104.8MB in the beginning and 209.6MB in the end (delta: -104.8MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2025-02-08 05:40:20,019 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:20,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.28ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 92.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:20,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.87ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 89.9MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:20,019 INFO L158 Benchmark]: Boogie Preprocessor took 23.89ms. 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-02-08 05:40:20,019 INFO L158 Benchmark]: IcfgBuilder took 553.10ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 42.0MB in the end (delta: 45.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 05:40:20,020 INFO L158 Benchmark]: TraceAbstraction took 1811.19ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 42.0MB in the beginning and 216.9MB in the end (delta: -174.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:20,020 INFO L158 Benchmark]: Witness Printer took 83.21ms. Allocated memory is still 285.2MB. Free memory was 216.7MB in the beginning and 209.6MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:20,021 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.13ms. Allocated memory is still 226.5MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.28ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 92.1MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.87ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 89.9MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.89ms. 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. * IcfgBuilder took 553.10ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 42.0MB in the end (delta: 45.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1811.19ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 42.0MB in the beginning and 216.9MB in the end (delta: -174.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 83.21ms. Allocated memory is still 285.2MB. Free memory was 216.7MB in the beginning and 209.6MB 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: 47]: 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: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: 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, 249 locations, 39 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 207 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 49 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=0, InterpolantAutomatonStates: 27, 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, 536 NumberOfCodeBlocks, 536 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 528 ConstructedInterpolants, 0 QuantifiedInterpolants, 657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 26 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:40:20,040 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