./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_28-list2alloc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/goblint-regression/09-regions_28-list2alloc.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! data-race) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '318281cc312c05fd633ca0d066d65c4887939b5717e7fb2aba02dbd1a639e1ad'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_28-list2alloc.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 318281cc312c05fd633ca0d066d65c4887939b5717e7fb2aba02dbd1a639e1ad --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:37:03,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:37:03,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-07 15:37:03,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:37:03,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:37:03,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:37:03,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:37:03,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:37:03,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:37:03,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:37:03,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:37:03,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:37:03,210 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:37:03,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:37:03,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:37:03,210 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:37:03,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:37:03,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:37:03,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:37:03,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:37:03,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:37:03,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:37:03,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:37:03,212 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 -> 318281cc312c05fd633ca0d066d65c4887939b5717e7fb2aba02dbd1a639e1ad [2024-11-07 15:37:03,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:37:03,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:37:03,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:37:03,439 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:37:03,439 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:37:03,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_28-list2alloc.i [2024-11-07 15:37:04,646 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:37:04,981 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:37:04,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_28-list2alloc.i [2024-11-07 15:37:04,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/532e6ae8c/9e4f419e7a6a45e2a611f8720a32169b/FLAGbe9c50569 [2024-11-07 15:37:05,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/532e6ae8c/9e4f419e7a6a45e2a611f8720a32169b [2024-11-07 15:37:05,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:37:05,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:37:05,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:37:05,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:37:05,033 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:37:05,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:37:05" (1/1) ... [2024-11-07 15:37:05,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743084e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:37:05, skipping insertion in model container [2024-11-07 15:37:05,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:37:05" (1/1) ... [2024-11-07 15:37:05,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:37:05,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:37:05,521 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:37:05,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:37:05,618 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:37:05,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:37:05 WrapperNode [2024-11-07 15:37:05,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:37:05,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:37:05,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:37:05,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:37:05,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:37:05" (1/1) ... [2024-11-07 15:37:05,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:37:05" (1/1) ... [2024-11-07 15:37:05,663 INFO L138 Inliner]: procedures = 368, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 105 [2024-11-07 15:37:05,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:37:05,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:37:05,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:37:05,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:37:05,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:37:05" (1/1) ... [2024-11-07 15:37:05,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:37:05" (1/1) ... [2024-11-07 15:37:05,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:37:05" (1/1) ... [2024-11-07 15:37:05,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:37:05" (1/1) ... [2024-11-07 15:37:05,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:37:05" (1/1) ... [2024-11-07 15:37:05,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:37:05" (1/1) ... [2024-11-07 15:37:05,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:37:05" (1/1) ... [2024-11-07 15:37:05,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:37:05" (1/1) ... [2024-11-07 15:37:05,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:37:05,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:37:05,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:37:05,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:37:05,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:37:05" (1/1) ... [2024-11-07 15:37:05,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:37:05,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:37:05,759 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) [2024-11-07 15:37:05,763 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 [2024-11-07 15:37:05,781 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 15:37:05,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 15:37:05,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 15:37:05,781 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 15:37:05,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 15:37:05,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:37:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-07 15:37:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-07 15:37:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-07 15:37:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:37:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:37:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:37:05,783 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 15:37:05,912 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:37:05,913 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:37:06,176 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:37:06,176 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:37:06,194 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:37:06,195 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 15:37:06,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:37:06 BoogieIcfgContainer [2024-11-07 15:37:06,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:37:06,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:37:06,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:37:06,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:37:06,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:37:05" (1/3) ... [2024-11-07 15:37:06,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7d9dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:37:06, skipping insertion in model container [2024-11-07 15:37:06,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:37:05" (2/3) ... [2024-11-07 15:37:06,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7d9dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:37:06, skipping insertion in model container [2024-11-07 15:37:06,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:37:06" (3/3) ... [2024-11-07 15:37:06,202 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_28-list2alloc.i [2024-11-07 15:37:06,211 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:37:06,212 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-07 15:37:06,212 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:37:06,274 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 15:37:06,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 177 transitions, 358 flow [2024-11-07 15:37:06,388 INFO L124 PetriNetUnfolderBase]: 0/176 cut-off events. [2024-11-07 15:37:06,390 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:37:06,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 176 events. 0/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-11-07 15:37:06,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 177 transitions, 358 flow [2024-11-07 15:37:06,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 176 transitions, 355 flow [2024-11-07 15:37:06,409 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:37:06,418 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;@7115234, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:37:06,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-07 15:37:06,426 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:37:06,426 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2024-11-07 15:37:06,426 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:37:06,426 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:37:06,427 INFO L204 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] [2024-11-07 15:37:06,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-07 15:37:06,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:37:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1230530595, now seen corresponding path program 1 times [2024-11-07 15:37:06,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:37:06,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471187384] [2024-11-07 15:37:06,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:37:06,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:37:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:37:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:37:07,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:37:07,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471187384] [2024-11-07 15:37:07,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471187384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:37:07,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:37:07,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:37:07,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045171999] [2024-11-07 15:37:07,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:37:07,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:37:07,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:37:07,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:37:07,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:37:07,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 177 [2024-11-07 15:37:07,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 176 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 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) [2024-11-07 15:37:07,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:37:07,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 177 [2024-11-07 15:37:07,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:37:07,580 INFO L124 PetriNetUnfolderBase]: 120/630 cut-off events. [2024-11-07 15:37:07,580 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 15:37:07,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 630 events. 120/630 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2697 event pairs, 120 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 801. Up to 278 conditions per place. [2024-11-07 15:37:07,584 INFO L140 encePairwiseOnDemand]: 165/177 looper letters, 37 selfloop transitions, 10 changer transitions 0/174 dead transitions. [2024-11-07 15:37:07,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 174 transitions, 445 flow [2024-11-07 15:37:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:37:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:37:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2024-11-07 15:37:07,594 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7693032015065914 [2024-11-07 15:37:07,595 INFO L175 Difference]: Start difference. First operand has 180 places, 176 transitions, 355 flow. Second operand 6 states and 817 transitions. [2024-11-07 15:37:07,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 174 transitions, 445 flow [2024-11-07 15:37:07,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 174 transitions, 444 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:37:07,605 INFO L231 Difference]: Finished difference. Result has 182 places, 174 transitions, 370 flow [2024-11-07 15:37:07,606 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=370, PETRI_PLACES=182, PETRI_TRANSITIONS=174} [2024-11-07 15:37:07,608 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 2 predicate places. [2024-11-07 15:37:07,609 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 174 transitions, 370 flow [2024-11-07 15:37:07,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 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) [2024-11-07 15:37:07,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:37:07,609 INFO L204 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] [2024-11-07 15:37:07,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:37:07,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-07 15:37:07,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:37:07,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1677527440, now seen corresponding path program 1 times [2024-11-07 15:37:07,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:37:07,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968068931] [2024-11-07 15:37:07,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:37:07,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:37:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:37:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:37:07,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:37:07,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968068931] [2024-11-07 15:37:07,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968068931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:37:07,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:37:07,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:37:07,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116058353] [2024-11-07 15:37:07,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:37:07,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:37:07,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:37:07,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:37:07,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:37:08,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 177 [2024-11-07 15:37:08,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 174 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 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) [2024-11-07 15:37:08,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:37:08,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 177 [2024-11-07 15:37:08,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:37:08,296 INFO L124 PetriNetUnfolderBase]: 120/635 cut-off events. [2024-11-07 15:37:08,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:37:08,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 635 events. 120/635 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2765 event pairs, 120 based on Foata normal form. 0/579 useless extension candidates. Maximal degree in co-relation 842. Up to 278 conditions per place. [2024-11-07 15:37:08,299 INFO L140 encePairwiseOnDemand]: 165/177 looper letters, 37 selfloop transitions, 10 changer transitions 0/172 dead transitions. [2024-11-07 15:37:08,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 172 transitions, 460 flow [2024-11-07 15:37:08,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:37:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:37:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2024-11-07 15:37:08,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7693032015065914 [2024-11-07 15:37:08,301 INFO L175 Difference]: Start difference. First operand has 182 places, 174 transitions, 370 flow. Second operand 6 states and 817 transitions. [2024-11-07 15:37:08,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 172 transitions, 460 flow [2024-11-07 15:37:08,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 172 transitions, 440 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:37:08,303 INFO L231 Difference]: Finished difference. Result has 180 places, 172 transitions, 366 flow [2024-11-07 15:37:08,304 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=180, PETRI_TRANSITIONS=172} [2024-11-07 15:37:08,304 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 0 predicate places. [2024-11-07 15:37:08,304 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 172 transitions, 366 flow [2024-11-07 15:37:08,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 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) [2024-11-07 15:37:08,305 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:37:08,305 INFO L204 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] [2024-11-07 15:37:08,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:37:08,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-07 15:37:08,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:37:08,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1607055914, now seen corresponding path program 1 times [2024-11-07 15:37:08,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:37:08,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106005185] [2024-11-07 15:37:08,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:37:08,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:37:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:37:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:37:08,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:37:08,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106005185] [2024-11-07 15:37:08,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106005185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:37:08,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:37:08,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:37:08,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137631733] [2024-11-07 15:37:08,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:37:08,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:37:08,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:37:08,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:37:08,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:37:08,348 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 177 [2024-11-07 15:37:08,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 172 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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) [2024-11-07 15:37:08,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:37:08,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 177 [2024-11-07 15:37:08,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:37:08,404 INFO L124 PetriNetUnfolderBase]: 20/407 cut-off events. [2024-11-07 15:37:08,404 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:37:08,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 407 events. 20/407 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1266 event pairs, 20 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 382. Up to 54 conditions per place. [2024-11-07 15:37:08,406 INFO L140 encePairwiseOnDemand]: 174/177 looper letters, 13 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2024-11-07 15:37:08,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 171 transitions, 394 flow [2024-11-07 15:37:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:37:08,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:37:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2024-11-07 15:37:08,407 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9397363465160076 [2024-11-07 15:37:08,407 INFO L175 Difference]: Start difference. First operand has 180 places, 172 transitions, 366 flow. Second operand 3 states and 499 transitions. [2024-11-07 15:37:08,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 171 transitions, 394 flow [2024-11-07 15:37:08,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 171 transitions, 374 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:37:08,409 INFO L231 Difference]: Finished difference. Result has 176 places, 171 transitions, 348 flow [2024-11-07 15:37:08,410 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=176, PETRI_TRANSITIONS=171} [2024-11-07 15:37:08,413 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, -4 predicate places. [2024-11-07 15:37:08,413 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 171 transitions, 348 flow [2024-11-07 15:37:08,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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) [2024-11-07 15:37:08,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:37:08,414 INFO L204 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] [2024-11-07 15:37:08,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:37:08,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-07 15:37:08,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:37:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash -438055570, now seen corresponding path program 1 times [2024-11-07 15:37:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:37:08,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897562350] [2024-11-07 15:37:08,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:37:08,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:37:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:37:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:37:08,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:37:08,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897562350] [2024-11-07 15:37:08,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897562350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:37:08,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:37:08,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:37:08,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697144519] [2024-11-07 15:37:08,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:37:08,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:37:08,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:37:08,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:37:08,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:37:08,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 177 [2024-11-07 15:37:08,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 171 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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) [2024-11-07 15:37:08,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:37:08,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 177 [2024-11-07 15:37:08,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:37:08,527 INFO L124 PetriNetUnfolderBase]: 15/347 cut-off events. [2024-11-07 15:37:08,527 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:37:08,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 347 events. 15/347 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 910 event pairs, 15 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 338. Up to 43 conditions per place. [2024-11-07 15:37:08,528 INFO L140 encePairwiseOnDemand]: 174/177 looper letters, 12 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2024-11-07 15:37:08,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 170 transitions, 374 flow [2024-11-07 15:37:08,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:37:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:37:08,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2024-11-07 15:37:08,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.943502824858757 [2024-11-07 15:37:08,532 INFO L175 Difference]: Start difference. First operand has 176 places, 171 transitions, 348 flow. Second operand 3 states and 501 transitions. [2024-11-07 15:37:08,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 170 transitions, 374 flow [2024-11-07 15:37:08,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 170 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:37:08,535 INFO L231 Difference]: Finished difference. Result has 175 places, 170 transitions, 346 flow [2024-11-07 15:37:08,536 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=173, 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=346, PETRI_PLACES=175, PETRI_TRANSITIONS=170} [2024-11-07 15:37:08,536 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, -5 predicate places. [2024-11-07 15:37:08,536 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 170 transitions, 346 flow [2024-11-07 15:37:08,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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) [2024-11-07 15:37:08,537 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:37:08,537 INFO L204 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] [2024-11-07 15:37:08,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:37:08,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-07 15:37:08,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:37:08,537 INFO L85 PathProgramCache]: Analyzing trace with hash 5804600, now seen corresponding path program 1 times [2024-11-07 15:37:08,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:37:08,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176460426] [2024-11-07 15:37:08,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:37:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:37:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:37:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:37:08,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:37:08,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176460426] [2024-11-07 15:37:08,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176460426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:37:08,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:37:08,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:37:08,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22240993] [2024-11-07 15:37:08,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:37:08,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:37:08,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:37:08,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:37:08,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:37:08,598 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 177 [2024-11-07 15:37:08,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 170 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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) [2024-11-07 15:37:08,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:37:08,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 177 [2024-11-07 15:37:08,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:37:08,632 INFO L124 PetriNetUnfolderBase]: 24/353 cut-off events. [2024-11-07 15:37:08,632 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:37:08,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 353 events. 24/353 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 920 event pairs, 13 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 327. Up to 54 conditions per place. [2024-11-07 15:37:08,633 INFO L140 encePairwiseOnDemand]: 173/177 looper letters, 14 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2024-11-07 15:37:08,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 172 transitions, 382 flow [2024-11-07 15:37:08,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:37:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:37:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2024-11-07 15:37:08,635 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9548022598870056 [2024-11-07 15:37:08,635 INFO L175 Difference]: Start difference. First operand has 175 places, 170 transitions, 346 flow. Second operand 3 states and 507 transitions. [2024-11-07 15:37:08,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 172 transitions, 382 flow [2024-11-07 15:37:08,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 172 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:37:08,639 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 352 flow [2024-11-07 15:37:08,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=174, PETRI_TRANSITIONS=170} [2024-11-07 15:37:08,640 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, -6 predicate places. [2024-11-07 15:37:08,640 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 352 flow [2024-11-07 15:37:08,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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) [2024-11-07 15:37:08,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:37:08,640 INFO L204 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] [2024-11-07 15:37:08,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:37:08,640 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-07 15:37:08,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:37:08,641 INFO L85 PathProgramCache]: Analyzing trace with hash 471380028, now seen corresponding path program 1 times [2024-11-07 15:37:08,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:37:08,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049093772] [2024-11-07 15:37:08,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:37:08,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:37:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:37:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:37:09,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:37:09,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049093772] [2024-11-07 15:37:09,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049093772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:37:09,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:37:09,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:37:09,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738931509] [2024-11-07 15:37:09,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:37:09,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:37:09,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:37:09,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:37:09,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:37:09,230 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 177 [2024-11-07 15:37:09,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 170 transitions, 352 flow. Second operand has 6 states, 6 states have (on average 137.16666666666666) internal successors, (823), 6 states have internal predecessors, (823), 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) [2024-11-07 15:37:09,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:37:09,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 177 [2024-11-07 15:37:09,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:37:09,353 INFO L124 PetriNetUnfolderBase]: 129/688 cut-off events. [2024-11-07 15:37:09,353 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:37:09,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 688 events. 129/688 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3153 event pairs, 78 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 894. Up to 258 conditions per place. [2024-11-07 15:37:09,356 INFO L140 encePairwiseOnDemand]: 166/177 looper letters, 51 selfloop transitions, 22 changer transitions 0/199 dead transitions. [2024-11-07 15:37:09,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 199 transitions, 556 flow [2024-11-07 15:37:09,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:37:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:37:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 872 transitions. [2024-11-07 15:37:09,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8210922787193974 [2024-11-07 15:37:09,357 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 352 flow. Second operand 6 states and 872 transitions. [2024-11-07 15:37:09,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 199 transitions, 556 flow [2024-11-07 15:37:09,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 199 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:37:09,360 INFO L231 Difference]: Finished difference. Result has 184 places, 191 transitions, 502 flow [2024-11-07 15:37:09,360 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=502, PETRI_PLACES=184, PETRI_TRANSITIONS=191} [2024-11-07 15:37:09,361 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 4 predicate places. [2024-11-07 15:37:09,361 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 191 transitions, 502 flow [2024-11-07 15:37:09,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.16666666666666) internal successors, (823), 6 states have internal predecessors, (823), 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) [2024-11-07 15:37:09,361 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:37:09,361 INFO L204 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] [2024-11-07 15:37:09,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:37:09,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-07 15:37:09,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:37:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2145989061, now seen corresponding path program 1 times [2024-11-07 15:37:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:37:09,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977210848] [2024-11-07 15:37:09,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:37:09,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:37:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:37:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:37:09,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:37:09,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977210848] [2024-11-07 15:37:09,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977210848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:37:09,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:37:09,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:37:09,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986170665] [2024-11-07 15:37:09,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:37:09,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:37:09,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:37:09,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:37:09,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:37:09,768 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 177 [2024-11-07 15:37:09,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 191 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 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) [2024-11-07 15:37:09,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:37:09,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 177 [2024-11-07 15:37:09,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:37:10,099 INFO L124 PetriNetUnfolderBase]: 394/1373 cut-off events. [2024-11-07 15:37:10,099 INFO L125 PetriNetUnfolderBase]: For 266/280 co-relation queries the response was YES. [2024-11-07 15:37:10,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2675 conditions, 1373 events. 394/1373 cut-off events. For 266/280 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 7590 event pairs, 142 based on Foata normal form. 4/1286 useless extension candidates. Maximal degree in co-relation 2556. Up to 686 conditions per place. [2024-11-07 15:37:10,108 INFO L140 encePairwiseOnDemand]: 154/177 looper letters, 78 selfloop transitions, 84 changer transitions 4/286 dead transitions. [2024-11-07 15:37:10,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 286 transitions, 1118 flow [2024-11-07 15:37:10,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:37:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:37:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 893 transitions. [2024-11-07 15:37:10,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8408662900188324 [2024-11-07 15:37:10,110 INFO L175 Difference]: Start difference. First operand has 184 places, 191 transitions, 502 flow. Second operand 6 states and 893 transitions. [2024-11-07 15:37:10,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 286 transitions, 1118 flow [2024-11-07 15:37:10,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 286 transitions, 1118 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:37:10,118 INFO L231 Difference]: Finished difference. Result has 194 places, 270 transitions, 1148 flow [2024-11-07 15:37:10,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1148, PETRI_PLACES=194, PETRI_TRANSITIONS=270} [2024-11-07 15:37:10,119 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 14 predicate places. [2024-11-07 15:37:10,120 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 270 transitions, 1148 flow [2024-11-07 15:37:10,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 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) [2024-11-07 15:37:10,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:37:10,120 INFO L204 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] [2024-11-07 15:37:10,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:37:10,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-07 15:37:10,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:37:10,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2142416959, now seen corresponding path program 1 times [2024-11-07 15:37:10,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:37:10,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990489796] [2024-11-07 15:37:10,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:37:10,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:37:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:37:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:37:10,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:37:10,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990489796] [2024-11-07 15:37:10,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990489796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:37:10,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:37:10,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:37:10,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61913134] [2024-11-07 15:37:10,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:37:10,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:37:10,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:37:10,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:37:10,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:37:10,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 177 [2024-11-07 15:37:10,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 270 transitions, 1148 flow. Second operand has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 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) [2024-11-07 15:37:10,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:37:10,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 177 [2024-11-07 15:37:10,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:37:10,840 INFO L124 PetriNetUnfolderBase]: 344/1224 cut-off events. [2024-11-07 15:37:10,840 INFO L125 PetriNetUnfolderBase]: For 754/766 co-relation queries the response was YES. [2024-11-07 15:37:10,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3238 conditions, 1224 events. 344/1224 cut-off events. For 754/766 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6668 event pairs, 77 based on Foata normal form. 0/1173 useless extension candidates. Maximal degree in co-relation 3113. Up to 606 conditions per place. [2024-11-07 15:37:10,847 INFO L140 encePairwiseOnDemand]: 166/177 looper letters, 146 selfloop transitions, 37 changer transitions 0/305 dead transitions. [2024-11-07 15:37:10,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 305 transitions, 1692 flow [2024-11-07 15:37:10,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:37:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:37:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 842 transitions. [2024-11-07 15:37:10,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7928436911487758 [2024-11-07 15:37:10,849 INFO L175 Difference]: Start difference. First operand has 194 places, 270 transitions, 1148 flow. Second operand 6 states and 842 transitions. [2024-11-07 15:37:10,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 305 transitions, 1692 flow [2024-11-07 15:37:10,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 305 transitions, 1674 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-07 15:37:10,864 INFO L231 Difference]: Finished difference. Result has 204 places, 297 transitions, 1472 flow [2024-11-07 15:37:10,864 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1472, PETRI_PLACES=204, PETRI_TRANSITIONS=297} [2024-11-07 15:37:10,864 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 24 predicate places. [2024-11-07 15:37:10,865 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 297 transitions, 1472 flow [2024-11-07 15:37:10,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 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) [2024-11-07 15:37:10,865 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:37:10,865 INFO L204 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] [2024-11-07 15:37:10,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:37:10,865 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-07 15:37:10,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:37:10,866 INFO L85 PathProgramCache]: Analyzing trace with hash 626842857, now seen corresponding path program 1 times [2024-11-07 15:37:10,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:37:10,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811430870] [2024-11-07 15:37:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:37:10,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:37:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:37:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:37:10,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:37:10,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811430870] [2024-11-07 15:37:10,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811430870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:37:10,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:37:10,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:37:10,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035935503] [2024-11-07 15:37:10,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:37:10,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:37:10,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:37:10,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:37:10,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:37:10,968 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 177 [2024-11-07 15:37:10,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 297 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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) [2024-11-07 15:37:10,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:37:10,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 177 [2024-11-07 15:37:10,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:37:11,060 INFO L124 PetriNetUnfolderBase]: 257/1033 cut-off events. [2024-11-07 15:37:11,060 INFO L125 PetriNetUnfolderBase]: For 847/857 co-relation queries the response was YES. [2024-11-07 15:37:11,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2636 conditions, 1033 events. 257/1033 cut-off events. For 847/857 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5324 event pairs, 18 based on Foata normal form. 2/1009 useless extension candidates. Maximal degree in co-relation 2523. Up to 251 conditions per place. [2024-11-07 15:37:11,078 INFO L140 encePairwiseOnDemand]: 172/177 looper letters, 6 selfloop transitions, 5 changer transitions 0/300 dead transitions. [2024-11-07 15:37:11,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 300 transitions, 1500 flow [2024-11-07 15:37:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:37:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:37:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2024-11-07 15:37:11,080 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9792843691148776 [2024-11-07 15:37:11,080 INFO L175 Difference]: Start difference. First operand has 204 places, 297 transitions, 1472 flow. Second operand 3 states and 520 transitions. [2024-11-07 15:37:11,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 300 transitions, 1500 flow [2024-11-07 15:37:11,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 300 transitions, 1444 flow, removed 28 selfloop flow, removed 0 redundant places. [2024-11-07 15:37:11,091 INFO L231 Difference]: Finished difference. Result has 207 places, 299 transitions, 1439 flow [2024-11-07 15:37:11,092 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1416, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1439, PETRI_PLACES=207, PETRI_TRANSITIONS=299} [2024-11-07 15:37:11,092 INFO L277 CegarLoopForPetriNet]: 180 programPoint places, 27 predicate places. [2024-11-07 15:37:11,093 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 299 transitions, 1439 flow [2024-11-07 15:37:11,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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) [2024-11-07 15:37:11,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:37:11,093 INFO L204 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] [2024-11-07 15:37:11,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:37:11,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-07 15:37:11,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:37:11,094 INFO L85 PathProgramCache]: Analyzing trace with hash -104082715, now seen corresponding path program 2 times [2024-11-07 15:37:11,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:37:11,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210842072] [2024-11-07 15:37:11,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:37:11,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:37:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:37:11,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:37:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:37:11,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:37:11,187 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:37:11,188 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (20 of 21 remaining) [2024-11-07 15:37:11,190 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2024-11-07 15:37:11,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2024-11-07 15:37:11,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2024-11-07 15:37:11,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2024-11-07 15:37:11,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2024-11-07 15:37:11,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2024-11-07 15:37:11,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2024-11-07 15:37:11,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2024-11-07 15:37:11,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 21 remaining) [2024-11-07 15:37:11,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2024-11-07 15:37:11,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2024-11-07 15:37:11,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2024-11-07 15:37:11,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2024-11-07 15:37:11,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2024-11-07 15:37:11,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2024-11-07 15:37:11,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2024-11-07 15:37:11,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2024-11-07 15:37:11,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2024-11-07 15:37:11,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2024-11-07 15:37:11,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2024-11-07 15:37:11,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:37:11,195 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:37:11,273 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 15:37:11,273 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 15:37:11,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:37:11 BasicIcfg [2024-11-07 15:37:11,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 15:37:11,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 15:37:11,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 15:37:11,281 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 15:37:11,281 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:37:06" (3/4) ... [2024-11-07 15:37:11,282 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 15:37:11,341 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 15:37:11,345 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 15:37:11,346 INFO L158 Benchmark]: Toolchain (without parser) took 6320.36ms. Allocated memory was 109.1MB in the beginning and 293.6MB in the end (delta: 184.5MB). Free memory was 83.7MB in the beginning and 206.9MB in the end (delta: -123.2MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2024-11-07 15:37:11,346 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:37:11,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.87ms. Allocated memory is still 109.1MB. Free memory was 83.6MB in the beginning and 45.4MB in the end (delta: 38.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-07 15:37:11,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.73ms. Allocated memory is still 109.1MB. Free memory was 45.4MB in the beginning and 42.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:37:11,346 INFO L158 Benchmark]: Boogie Preprocessor took 34.69ms. Allocated memory is still 109.1MB. Free memory was 42.7MB in the beginning and 40.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:37:11,347 INFO L158 Benchmark]: RCFGBuilder took 494.55ms. Allocated memory is still 109.1MB. Free memory was 40.7MB in the beginning and 63.0MB in the end (delta: -22.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-11-07 15:37:11,347 INFO L158 Benchmark]: TraceAbstraction took 5083.17ms. Allocated memory was 109.1MB in the beginning and 293.6MB in the end (delta: 184.5MB). Free memory was 62.5MB in the beginning and 218.4MB in the end (delta: -156.0MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-07 15:37:11,347 INFO L158 Benchmark]: Witness Printer took 64.78ms. Allocated memory is still 293.6MB. Free memory was 218.4MB in the beginning and 206.9MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:37:11,348 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.62ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 593.87ms. Allocated memory is still 109.1MB. Free memory was 83.6MB in the beginning and 45.4MB in the end (delta: 38.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.73ms. Allocated memory is still 109.1MB. Free memory was 45.4MB in the beginning and 42.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.69ms. Allocated memory is still 109.1MB. Free memory was 42.7MB in the beginning and 40.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 494.55ms. Allocated memory is still 109.1MB. Free memory was 40.7MB in the beginning and 63.0MB in the end (delta: -22.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5083.17ms. Allocated memory was 109.1MB in the beginning and 293.6MB in the end (delta: 184.5MB). Free memory was 62.5MB in the beginning and 218.4MB in the end (delta: -156.0MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * Witness Printer took 64.78ms. Allocated memory is still 293.6MB. Free memory was 218.4MB in the beginning and 206.9MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1237]: Data race detected Data race detected The following path leads to a data race: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; VAL [A={0:0}, B={0:0}] [L1233] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={1:0}, B={0:0}] [L1234] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1245] 0 pthread_t t1; [L1246] CALL, EXPR 0 new(3) [L1228] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=3, p={-2:0}, x=3] [L1229] 0 p->datum = x VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=3, p={-2:0}, x=3] [L1230] 0 p->next = ((void *)0) VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=3, p={-2:0}, x=3] [L1231] 0 return p; VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=3, \result={-2:0}, p={-2:0}, x=3] [L1246] RET, EXPR 0 new(3) [L1246] 0 A = new(3) VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1247] CALL, EXPR 0 new(5) [L1228] 0 struct s *p = malloc(sizeof(struct s)); VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=5, p={-3:0}, x=5] [L1229] 0 p->datum = x VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=5, p={-3:0}, x=5] [L1230] 0 p->next = ((void *)0) VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=5, p={-3:0}, x=5] [L1231] 0 return p; VAL [A={-2:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}, \old(x)=5, \result={-3:0}, p={-3:0}, x=5] [L1247] RET, EXPR 0 new(5) [L1247] 0 B = new(5) VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}] [L1248] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, t1=-1] [L1249] 0 int *data; VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, t1=-1] [L1251] EXPR 0 A->datum VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, t1=-1] [L1251] EXPR 0 A->datum VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, t1=-1] [L1251] 0 data = &A->datum VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, data={-2:0}, t1=-1] [L1237] EXPR 1 A->datum VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}] [L1237] 1 A->datum++ VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}] [L1253] 0 *data = 42 VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}, data={-2:0}, t1=-1] [L1237] 1 A->datum++ VAL [A={-2:0}, A_mutex={1:0}, B={-3:0}, B_mutex={2:0}, \old(arg)={0:0}, arg={0:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: p->next = ((void *)0) [1230] * C: p->datum = x [1229] * C: p->datum = x [1229] * C: p->datum = x [1229] * C: p->datum = x [1229] * C: B = new(5) [1247] * C: p->next = ((void *)0) [1230] * C: *data = 42 [1253] * C: p->next = ((void *)0) [1230] * C: p->next = ((void *)0) [1230] * C: A = new(3) [1246] and C: A->datum++ [1237] - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1230]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1246]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1229]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1230]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1247]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1251]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1248]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1237]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 235 locations, 21 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: 4.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 706 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 450 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1684 IncrementalHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 10 mSDtfsCounter, 1684 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1472occurred in iteration=8, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 861 NumberOfCodeBlocks, 861 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 737 ConstructedInterpolants, 0 QuantifiedInterpolants, 1168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-07 15:37:11,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE