./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_26-alloc_region_rc.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_26-alloc_region_rc.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 f3b2ae0644e4461660d158d21313c8c5bd1a218cef344af564eada57cf6b8643 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:09:41,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:09:41,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:09:41,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:09:41,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:09:42,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:09:42,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:09:42,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:09:42,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:09:42,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:09:42,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:09:42,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:09:42,018 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:09:42,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:09:42,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:09:42,019 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:09:42,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:09:42,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:09:42,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:09:42,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:09:42,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:09:42,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:09:42,020 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:09:42,020 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:09:42,020 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:09:42,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:09:42,020 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:09:42,020 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:09:42,021 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:09:42,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:09:42,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:09:42,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:42,021 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:09:42,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:09:42,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:09:42,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:42,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:09:42,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:09:42,021 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:09:42,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:09:42,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:09:42,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:09:42,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:09:42,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:09:42,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:09:42,021 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/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 -> f3b2ae0644e4461660d158d21313c8c5bd1a218cef344af564eada57cf6b8643 [2025-04-29 11:09:42,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:09:42,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:09:42,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:09:42,236 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:09:42,237 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:09:42,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_26-alloc_region_rc.c [2025-04-29 11:09:43,580 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564567213/ebeeb1935468479c9215f1449d0f927d/FLAG3191b1b19 [2025-04-29 11:09:43,762 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:09:43,763 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_26-alloc_region_rc.c [2025-04-29 11:09:43,764 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:09:43,764 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:09:43,764 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:09:43,768 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564567213/ebeeb1935468479c9215f1449d0f927d/FLAG3191b1b19 [2025-04-29 11:09:44,781 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564567213/ebeeb1935468479c9215f1449d0f927d [2025-04-29 11:09:44,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:09:44,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:09:44,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:09:44,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:09:44,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:09:44,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:09:44" (1/1) ... [2025-04-29 11:09:44,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a13a62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:44, skipping insertion in model container [2025-04-29 11:09:44,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:09:44" (1/1) ... [2025-04-29 11:09:44,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:09:44,953 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:09:44,959 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:09:44,984 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:09:44,996 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:09:44,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:44 WrapperNode [2025-04-29 11:09:44,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:09:44,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:09:44,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:09:44,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:09:45,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:44" (1/1) ... [2025-04-29 11:09:45,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:44" (1/1) ... [2025-04-29 11:09:45,041 INFO L138 Inliner]: procedures = 17, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 235 [2025-04-29 11:09:45,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:09:45,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:09:45,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:09:45,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:09:45,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:44" (1/1) ... [2025-04-29 11:09:45,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:44" (1/1) ... [2025-04-29 11:09:45,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:44" (1/1) ... [2025-04-29 11:09:45,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:44" (1/1) ... [2025-04-29 11:09:45,070 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:44" (1/1) ... [2025-04-29 11:09:45,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:44" (1/1) ... [2025-04-29 11:09:45,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:44" (1/1) ... [2025-04-29 11:09:45,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:44" (1/1) ... [2025-04-29 11:09:45,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:44" (1/1) ... [2025-04-29 11:09:45,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:09:45,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:09:45,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:09:45,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:09:45,094 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:44" (1/1) ... [2025-04-29 11:09:45,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:45,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:45,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:09:45,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:09:45,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-29 11:09:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-29 11:09:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:09:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:09:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:09:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-29 11:09:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:09:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:09:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:09:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:09:45,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:09:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:09:45,132 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:09:45,132 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:09:45,133 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:09:45,226 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:09:45,227 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:09:45,651 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:09:45,651 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:09:45,678 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:09:45,678 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 11:09:45,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:45 BoogieIcfgContainer [2025-04-29 11:09:45,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:09:45,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:09:45,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:09:45,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:09:45,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:09:44" (1/3) ... [2025-04-29 11:09:45,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6bc3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:09:45, skipping insertion in model container [2025-04-29 11:09:45,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:44" (2/3) ... [2025-04-29 11:09:45,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6bc3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:09:45, skipping insertion in model container [2025-04-29 11:09:45,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:45" (3/3) ... [2025-04-29 11:09:45,688 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_26-alloc_region_rc.c [2025-04-29 11:09:45,701 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:09:45,703 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_26-alloc_region_rc.c that has 2 procedures, 264 locations, 264 edges, 1 initial locations, 1 loop locations, and 20 error locations. [2025-04-29 11:09:45,703 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:09:45,772 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:09:45,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 265 transitions, 534 flow [2025-04-29 11:09:45,913 INFO L116 PetriNetUnfolderBase]: 2/264 cut-off events. [2025-04-29 11:09:45,915 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:45,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 264 events. 2/264 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 202. Up to 2 conditions per place. [2025-04-29 11:09:45,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 265 transitions, 534 flow [2025-04-29 11:09:45,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 264 transitions, 531 flow [2025-04-29 11:09:45,934 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:09:45,946 INFO L340 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;@ce23eac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:09:45,948 INFO L341 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-04-29 11:09:45,952 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:09:45,953 INFO L116 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-04-29 11:09:45,953 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:45,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:45,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:45,954 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-29 11:09:45,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:45,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2064010994, now seen corresponding path program 1 times [2025-04-29 11:09:45,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:45,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57381648] [2025-04-29 11:09:45,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:45,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:46,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:09:46,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:09:46,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:46,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:46,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:46,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57381648] [2025-04-29 11:09:46,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57381648] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:46,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:46,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:46,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162268298] [2025-04-29 11:09:46,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:46,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:46,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:46,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:46,853 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 265 [2025-04-29 11:09:46,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 264 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 167.33333333333334) internal successors, (1004), 6 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:46,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:46,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 265 [2025-04-29 11:09:46,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:47,512 INFO L116 PetriNetUnfolderBase]: 1377/5007 cut-off events. [2025-04-29 11:09:47,512 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:09:47,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7801 conditions, 5007 events. 1377/5007 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 37650 event pairs, 1344 based on Foata normal form. 36/4679 useless extension candidates. Maximal degree in co-relation 7712. Up to 2785 conditions per place. [2025-04-29 11:09:47,537 INFO L140 encePairwiseOnDemand]: 258/265 looper letters, 92 selfloop transitions, 5 changer transitions 0/262 dead transitions. [2025-04-29 11:09:47,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 262 transitions, 721 flow [2025-04-29 11:09:47,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1095 transitions. [2025-04-29 11:09:47,557 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6886792452830188 [2025-04-29 11:09:47,558 INFO L175 Difference]: Start difference. First operand has 266 places, 264 transitions, 531 flow. Second operand 6 states and 1095 transitions. [2025-04-29 11:09:47,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 262 transitions, 721 flow [2025-04-29 11:09:47,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 262 transitions, 720 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:47,569 INFO L231 Difference]: Finished difference. Result has 269 places, 262 transitions, 536 flow [2025-04-29 11:09:47,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=536, PETRI_PLACES=269, PETRI_TRANSITIONS=262} [2025-04-29 11:09:47,574 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, 3 predicate places. [2025-04-29 11:09:47,575 INFO L485 AbstractCegarLoop]: Abstraction has has 269 places, 262 transitions, 536 flow [2025-04-29 11:09:47,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 167.33333333333334) internal successors, (1004), 6 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:47,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:47,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:47,577 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:09:47,577 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-29 11:09:47,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:47,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1957356427, now seen corresponding path program 1 times [2025-04-29 11:09:47,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:47,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921464892] [2025-04-29 11:09:47,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:47,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:47,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:09:47,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:09:47,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:47,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:47,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:47,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921464892] [2025-04-29 11:09:47,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921464892] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:47,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:47,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:47,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875620205] [2025-04-29 11:09:47,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:47,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:47,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:47,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:47,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:48,324 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 265 [2025-04-29 11:09:48,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 262 transitions, 536 flow. Second operand has 6 states, 6 states have (on average 194.83333333333334) internal successors, (1169), 6 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:48,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:48,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 265 [2025-04-29 11:09:48,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:48,783 INFO L116 PetriNetUnfolderBase]: 762/4086 cut-off events. [2025-04-29 11:09:48,783 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:09:48,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5670 conditions, 4086 events. 762/4086 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 31538 event pairs, 460 based on Foata normal form. 0/3726 useless extension candidates. Maximal degree in co-relation 5631. Up to 1372 conditions per place. [2025-04-29 11:09:48,797 INFO L140 encePairwiseOnDemand]: 233/265 looper letters, 81 selfloop transitions, 90 changer transitions 0/362 dead transitions. [2025-04-29 11:09:48,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 362 transitions, 1078 flow [2025-04-29 11:09:48,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1331 transitions. [2025-04-29 11:09:48,800 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8371069182389937 [2025-04-29 11:09:48,800 INFO L175 Difference]: Start difference. First operand has 269 places, 262 transitions, 536 flow. Second operand 6 states and 1331 transitions. [2025-04-29 11:09:48,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 362 transitions, 1078 flow [2025-04-29 11:09:48,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 362 transitions, 1068 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:48,808 INFO L231 Difference]: Finished difference. Result has 273 places, 345 transitions, 1102 flow [2025-04-29 11:09:48,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1102, PETRI_PLACES=273, PETRI_TRANSITIONS=345} [2025-04-29 11:09:48,810 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, 7 predicate places. [2025-04-29 11:09:48,810 INFO L485 AbstractCegarLoop]: Abstraction has has 273 places, 345 transitions, 1102 flow [2025-04-29 11:09:48,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.83333333333334) internal successors, (1169), 6 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:48,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:48,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:48,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:09:48,811 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-29 11:09:48,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:48,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1268004625, now seen corresponding path program 1 times [2025-04-29 11:09:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:48,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339324479] [2025-04-29 11:09:48,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:48,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:48,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:09:48,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:09:48,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:48,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:49,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:49,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339324479] [2025-04-29 11:09:49,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339324479] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:49,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:49,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:49,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304523361] [2025-04-29 11:09:49,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:49,065 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:49,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:49,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:49,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:49,417 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 265 [2025-04-29 11:09:49,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 345 transitions, 1102 flow. Second operand has 6 states, 6 states have (on average 171.66666666666666) internal successors, (1030), 6 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:49,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:49,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 265 [2025-04-29 11:09:49,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:50,224 INFO L116 PetriNetUnfolderBase]: 2110/7414 cut-off events. [2025-04-29 11:09:50,224 INFO L117 PetriNetUnfolderBase]: For 1549/1554 co-relation queries the response was YES. [2025-04-29 11:09:50,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13844 conditions, 7414 events. 2110/7414 cut-off events. For 1549/1554 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 59993 event pairs, 1264 based on Foata normal form. 0/6796 useless extension candidates. Maximal degree in co-relation 13747. Up to 4041 conditions per place. [2025-04-29 11:09:50,250 INFO L140 encePairwiseOnDemand]: 224/265 looper letters, 187 selfloop transitions, 123 changer transitions 0/477 dead transitions. [2025-04-29 11:09:50,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 477 transitions, 2146 flow [2025-04-29 11:09:50,251 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1243 transitions. [2025-04-29 11:09:50,255 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7817610062893082 [2025-04-29 11:09:50,256 INFO L175 Difference]: Start difference. First operand has 273 places, 345 transitions, 1102 flow. Second operand 6 states and 1243 transitions. [2025-04-29 11:09:50,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 477 transitions, 2146 flow [2025-04-29 11:09:50,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 477 transitions, 2146 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:50,271 INFO L231 Difference]: Finished difference. Result has 282 places, 461 transitions, 2054 flow [2025-04-29 11:09:50,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1100, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2054, PETRI_PLACES=282, PETRI_TRANSITIONS=461} [2025-04-29 11:09:50,272 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, 16 predicate places. [2025-04-29 11:09:50,272 INFO L485 AbstractCegarLoop]: Abstraction has has 282 places, 461 transitions, 2054 flow [2025-04-29 11:09:50,272 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.66666666666666) internal successors, (1030), 6 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:50,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:50,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:50,273 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:09:50,273 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-29 11:09:50,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:50,274 INFO L85 PathProgramCache]: Analyzing trace with hash 41952325, now seen corresponding path program 1 times [2025-04-29 11:09:50,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:50,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985911147] [2025-04-29 11:09:50,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:50,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:50,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:09:50,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:09:50,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:50,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:09:50,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:50,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985911147] [2025-04-29 11:09:50,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985911147] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:50,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:50,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:50,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490099094] [2025-04-29 11:09:50,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:50,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:50,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:50,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:50,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:51,032 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 265 [2025-04-29 11:09:51,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 461 transitions, 2054 flow. Second operand has 6 states, 6 states have (on average 171.66666666666666) internal successors, (1030), 6 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:51,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:51,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 265 [2025-04-29 11:09:51,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:52,298 INFO L116 PetriNetUnfolderBase]: 2410/8357 cut-off events. [2025-04-29 11:09:52,298 INFO L117 PetriNetUnfolderBase]: For 3694/3705 co-relation queries the response was YES. [2025-04-29 11:09:52,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17805 conditions, 8357 events. 2410/8357 cut-off events. For 3694/3705 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 68362 event pairs, 1292 based on Foata normal form. 0/7713 useless extension candidates. Maximal degree in co-relation 17694. Up to 4365 conditions per place. [2025-04-29 11:09:52,329 INFO L140 encePairwiseOnDemand]: 224/265 looper letters, 299 selfloop transitions, 123 changer transitions 0/593 dead transitions. [2025-04-29 11:09:52,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 593 transitions, 3546 flow [2025-04-29 11:09:52,329 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1243 transitions. [2025-04-29 11:09:52,331 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7817610062893082 [2025-04-29 11:09:52,332 INFO L175 Difference]: Start difference. First operand has 282 places, 461 transitions, 2054 flow. Second operand 6 states and 1243 transitions. [2025-04-29 11:09:52,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 593 transitions, 3546 flow [2025-04-29 11:09:52,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 593 transitions, 3386 flow, removed 80 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:52,346 INFO L231 Difference]: Finished difference. Result has 291 places, 577 transitions, 3070 flow [2025-04-29 11:09:52,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1892, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3070, PETRI_PLACES=291, PETRI_TRANSITIONS=577} [2025-04-29 11:09:52,347 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, 25 predicate places. [2025-04-29 11:09:52,347 INFO L485 AbstractCegarLoop]: Abstraction has has 291 places, 577 transitions, 3070 flow [2025-04-29 11:09:52,347 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.66666666666666) internal successors, (1030), 6 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:52,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:52,347 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:52,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:09:52,348 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-29 11:09:52,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:52,348 INFO L85 PathProgramCache]: Analyzing trace with hash -861029848, now seen corresponding path program 1 times [2025-04-29 11:09:52,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:52,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894196298] [2025-04-29 11:09:52,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:52,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:52,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 11:09:52,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 11:09:52,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:52,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:09:52,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:52,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894196298] [2025-04-29 11:09:52,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894196298] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:52,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:52,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:52,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997574810] [2025-04-29 11:09:52,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:52,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:52,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:52,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:52,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:52,958 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 265 [2025-04-29 11:09:52,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 577 transitions, 3070 flow. Second operand has 6 states, 6 states have (on average 176.16666666666666) internal successors, (1057), 6 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:52,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:52,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 265 [2025-04-29 11:09:52,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:54,075 INFO L116 PetriNetUnfolderBase]: 2734/9154 cut-off events. [2025-04-29 11:09:54,075 INFO L117 PetriNetUnfolderBase]: For 5351/5417 co-relation queries the response was YES. [2025-04-29 11:09:54,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21651 conditions, 9154 events. 2734/9154 cut-off events. For 5351/5417 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 75232 event pairs, 1246 based on Foata normal form. 0/8487 useless extension candidates. Maximal degree in co-relation 21527. Up to 4881 conditions per place. [2025-04-29 11:09:54,106 INFO L140 encePairwiseOnDemand]: 222/265 looper letters, 360 selfloop transitions, 180 changer transitions 0/760 dead transitions. [2025-04-29 11:09:54,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 760 transitions, 4738 flow [2025-04-29 11:09:54,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1290 transitions. [2025-04-29 11:09:54,109 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8113207547169812 [2025-04-29 11:09:54,109 INFO L175 Difference]: Start difference. First operand has 291 places, 577 transitions, 3070 flow. Second operand 6 states and 1290 transitions. [2025-04-29 11:09:54,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 760 transitions, 4738 flow [2025-04-29 11:09:54,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 760 transitions, 4342 flow, removed 198 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:54,128 INFO L231 Difference]: Finished difference. Result has 301 places, 744 transitions, 4070 flow [2025-04-29 11:09:54,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=2686, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4070, PETRI_PLACES=301, PETRI_TRANSITIONS=744} [2025-04-29 11:09:54,129 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, 35 predicate places. [2025-04-29 11:09:54,129 INFO L485 AbstractCegarLoop]: Abstraction has has 301 places, 744 transitions, 4070 flow [2025-04-29 11:09:54,129 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 176.16666666666666) internal successors, (1057), 6 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:54,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:54,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:54,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:09:54,130 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-29 11:09:54,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:54,130 INFO L85 PathProgramCache]: Analyzing trace with hash 549962029, now seen corresponding path program 1 times [2025-04-29 11:09:54,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:54,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939090595] [2025-04-29 11:09:54,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:54,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:54,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-04-29 11:09:54,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-04-29 11:09:54,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:54,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:09:54,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:54,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939090595] [2025-04-29 11:09:54,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939090595] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:54,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:54,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:54,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311126523] [2025-04-29 11:09:54,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:54,406 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:54,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:54,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:54,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:54,635 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 265 [2025-04-29 11:09:54,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 744 transitions, 4070 flow. Second operand has 6 states, 6 states have (on average 176.16666666666666) internal successors, (1057), 6 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:54,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:54,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 265 [2025-04-29 11:09:54,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:56,147 INFO L116 PetriNetUnfolderBase]: 3188/10500 cut-off events. [2025-04-29 11:09:56,148 INFO L117 PetriNetUnfolderBase]: For 8567/8655 co-relation queries the response was YES. [2025-04-29 11:09:56,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27946 conditions, 10500 events. 3188/10500 cut-off events. For 8567/8655 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 87844 event pairs, 1284 based on Foata normal form. 0/9807 useless extension candidates. Maximal degree in co-relation 27817. Up to 5368 conditions per place. [2025-04-29 11:09:56,203 INFO L140 encePairwiseOnDemand]: 222/265 looper letters, 513 selfloop transitions, 180 changer transitions 0/927 dead transitions. [2025-04-29 11:09:56,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 927 transitions, 6338 flow [2025-04-29 11:09:56,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1290 transitions. [2025-04-29 11:09:56,206 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8113207547169812 [2025-04-29 11:09:56,206 INFO L175 Difference]: Start difference. First operand has 301 places, 744 transitions, 4070 flow. Second operand 6 states and 1290 transitions. [2025-04-29 11:09:56,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 927 transitions, 6338 flow [2025-04-29 11:09:56,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 927 transitions, 6284 flow, removed 27 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:56,244 INFO L231 Difference]: Finished difference. Result has 311 places, 911 transitions, 5706 flow [2025-04-29 11:09:56,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=4016, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5706, PETRI_PLACES=311, PETRI_TRANSITIONS=911} [2025-04-29 11:09:56,245 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, 45 predicate places. [2025-04-29 11:09:56,245 INFO L485 AbstractCegarLoop]: Abstraction has has 311 places, 911 transitions, 5706 flow [2025-04-29 11:09:56,246 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 176.16666666666666) internal successors, (1057), 6 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:56,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:56,246 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:56,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:09:56,246 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-29 11:09:56,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:56,247 INFO L85 PathProgramCache]: Analyzing trace with hash -956985956, now seen corresponding path program 1 times [2025-04-29 11:09:56,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:56,247 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899689057] [2025-04-29 11:09:56,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:56,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:56,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-04-29 11:09:56,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-29 11:09:56,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:56,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:09:56,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:56,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899689057] [2025-04-29 11:09:56,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899689057] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:56,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:56,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-29 11:09:56,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441169861] [2025-04-29 11:09:56,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:56,663 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:09:56,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:56,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:09:56,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:09:58,440 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 265 [2025-04-29 11:09:58,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 911 transitions, 5706 flow. Second operand has 15 states, 15 states have (on average 151.86666666666667) internal successors, (2278), 15 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:58,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:58,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 265 [2025-04-29 11:09:58,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:01,649 INFO L116 PetriNetUnfolderBase]: 4113/12830 cut-off events. [2025-04-29 11:10:01,649 INFO L117 PetriNetUnfolderBase]: For 15725/15814 co-relation queries the response was YES. [2025-04-29 11:10:01,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38549 conditions, 12830 events. 4113/12830 cut-off events. For 15725/15814 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 106676 event pairs, 1212 based on Foata normal form. 37/12182 useless extension candidates. Maximal degree in co-relation 38408. Up to 4181 conditions per place. [2025-04-29 11:10:01,720 INFO L140 encePairwiseOnDemand]: 208/265 looper letters, 921 selfloop transitions, 276 changer transitions 0/1408 dead transitions. [2025-04-29 11:10:01,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 1408 transitions, 11016 flow [2025-04-29 11:10:01,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-29 11:10:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-29 11:10:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5294 transitions. [2025-04-29 11:10:01,729 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6444309190505173 [2025-04-29 11:10:01,729 INFO L175 Difference]: Start difference. First operand has 311 places, 911 transitions, 5706 flow. Second operand 31 states and 5294 transitions. [2025-04-29 11:10:01,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 1408 transitions, 11016 flow [2025-04-29 11:10:01,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 1408 transitions, 10656 flow, removed 180 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:01,807 INFO L231 Difference]: Finished difference. Result has 366 places, 1018 transitions, 7318 flow [2025-04-29 11:10:01,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=5346, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=911, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=7318, PETRI_PLACES=366, PETRI_TRANSITIONS=1018} [2025-04-29 11:10:01,810 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, 100 predicate places. [2025-04-29 11:10:01,811 INFO L485 AbstractCegarLoop]: Abstraction has has 366 places, 1018 transitions, 7318 flow [2025-04-29 11:10:01,812 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 151.86666666666667) internal successors, (2278), 15 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:01,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:01,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:01,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:10:01,812 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-29 11:10:01,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:01,813 INFO L85 PathProgramCache]: Analyzing trace with hash 549773428, now seen corresponding path program 2 times [2025-04-29 11:10:01,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:01,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363094172] [2025-04-29 11:10:01,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:10:01,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:01,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-04-29 11:10:01,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 84 of 85 statements. [2025-04-29 11:10:01,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:10:01,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:02,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:02,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363094172] [2025-04-29 11:10:02,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363094172] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:02,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:02,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-29 11:10:02,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614936689] [2025-04-29 11:10:02,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:02,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:10:02,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:02,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:10:02,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:10:03,764 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 265 [2025-04-29 11:10:03,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 1018 transitions, 7318 flow. Second operand has 15 states, 15 states have (on average 151.86666666666667) internal successors, (2278), 15 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:03,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:03,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 265 [2025-04-29 11:10:03,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:06,883 INFO L116 PetriNetUnfolderBase]: 5071/15617 cut-off events. [2025-04-29 11:10:06,884 INFO L117 PetriNetUnfolderBase]: For 28900/29211 co-relation queries the response was YES. [2025-04-29 11:10:06,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52427 conditions, 15617 events. 5071/15617 cut-off events. For 28900/29211 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 135056 event pairs, 1270 based on Foata normal form. 38/14879 useless extension candidates. Maximal degree in co-relation 52260. Up to 2883 conditions per place. [2025-04-29 11:10:06,983 INFO L140 encePairwiseOnDemand]: 207/265 looper letters, 1340 selfloop transitions, 200 changer transitions 0/1751 dead transitions. [2025-04-29 11:10:06,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 1751 transitions, 16152 flow [2025-04-29 11:10:06,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:10:06,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-29 11:10:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3770 transitions. [2025-04-29 11:10:06,989 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6466552315608919 [2025-04-29 11:10:06,989 INFO L175 Difference]: Start difference. First operand has 366 places, 1018 transitions, 7318 flow. Second operand 22 states and 3770 transitions. [2025-04-29 11:10:06,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 1751 transitions, 16152 flow [2025-04-29 11:10:07,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 1751 transitions, 15942 flow, removed 64 selfloop flow, removed 5 redundant places. [2025-04-29 11:10:07,132 INFO L231 Difference]: Finished difference. Result has 396 places, 1162 transitions, 9455 flow [2025-04-29 11:10:07,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=7178, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1018, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=859, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=9455, PETRI_PLACES=396, PETRI_TRANSITIONS=1162} [2025-04-29 11:10:07,137 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, 130 predicate places. [2025-04-29 11:10:07,137 INFO L485 AbstractCegarLoop]: Abstraction has has 396 places, 1162 transitions, 9455 flow [2025-04-29 11:10:07,138 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 151.86666666666667) internal successors, (2278), 15 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:07,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:07,138 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:07,138 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:10:07,138 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-29 11:10:07,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:07,139 INFO L85 PathProgramCache]: Analyzing trace with hash 366384590, now seen corresponding path program 1 times [2025-04-29 11:10:07,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:07,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951635171] [2025-04-29 11:10:07,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:07,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:07,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-04-29 11:10:07,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-29 11:10:07,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:07,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:07,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:07,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951635171] [2025-04-29 11:10:07,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951635171] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:07,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:07,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-29 11:10:07,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452234058] [2025-04-29 11:10:07,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:07,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:10:07,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:07,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:10:07,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:10:08,985 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 265 [2025-04-29 11:10:08,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 1162 transitions, 9455 flow. Second operand has 15 states, 15 states have (on average 151.8) internal successors, (2277), 15 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:08,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:08,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 265 [2025-04-29 11:10:08,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:13,502 INFO L116 PetriNetUnfolderBase]: 6145/18343 cut-off events. [2025-04-29 11:10:13,502 INFO L117 PetriNetUnfolderBase]: For 47661/48012 co-relation queries the response was YES. [2025-04-29 11:10:13,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67192 conditions, 18343 events. 6145/18343 cut-off events. For 47661/48012 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 162335 event pairs, 814 based on Foata normal form. 93/17647 useless extension candidates. Maximal degree in co-relation 67012. Up to 5066 conditions per place. [2025-04-29 11:10:13,638 INFO L140 encePairwiseOnDemand]: 213/265 looper letters, 1517 selfloop transitions, 209 changer transitions 0/1967 dead transitions. [2025-04-29 11:10:13,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 1967 transitions, 20161 flow [2025-04-29 11:10:13,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:10:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-29 11:10:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3807 transitions. [2025-04-29 11:10:13,644 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6530017152658663 [2025-04-29 11:10:13,644 INFO L175 Difference]: Start difference. First operand has 396 places, 1162 transitions, 9455 flow. Second operand 22 states and 3807 transitions. [2025-04-29 11:10:13,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 1967 transitions, 20161 flow [2025-04-29 11:10:13,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 1967 transitions, 19890 flow, removed 109 selfloop flow, removed 2 redundant places. [2025-04-29 11:10:13,900 INFO L231 Difference]: Finished difference. Result has 430 places, 1307 transitions, 11510 flow [2025-04-29 11:10:13,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=9252, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=11510, PETRI_PLACES=430, PETRI_TRANSITIONS=1307} [2025-04-29 11:10:13,901 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, 164 predicate places. [2025-04-29 11:10:13,901 INFO L485 AbstractCegarLoop]: Abstraction has has 430 places, 1307 transitions, 11510 flow [2025-04-29 11:10:13,902 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 151.8) internal successors, (2277), 15 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:13,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:13,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:13,902 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:10:13,902 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-29 11:10:13,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:13,903 INFO L85 PathProgramCache]: Analyzing trace with hash -942032542, now seen corresponding path program 3 times [2025-04-29 11:10:13,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:13,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851226286] [2025-04-29 11:10:13,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:10:13,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:13,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 85 statements into 2 equivalence classes. [2025-04-29 11:10:13,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 84 of 85 statements. [2025-04-29 11:10:13,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:10:13,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:14,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:14,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851226286] [2025-04-29 11:10:14,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851226286] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:14,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:14,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-29 11:10:14,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018456815] [2025-04-29 11:10:14,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:14,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:10:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:14,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:10:14,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:10:15,613 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 265 [2025-04-29 11:10:15,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 1307 transitions, 11510 flow. Second operand has 15 states, 15 states have (on average 151.86666666666667) internal successors, (2278), 15 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:15,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:15,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 265 [2025-04-29 11:10:15,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:20,794 INFO L116 PetriNetUnfolderBase]: 7132/21184 cut-off events. [2025-04-29 11:10:20,794 INFO L117 PetriNetUnfolderBase]: For 65080/65753 co-relation queries the response was YES. [2025-04-29 11:10:20,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82778 conditions, 21184 events. 7132/21184 cut-off events. For 65080/65753 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 193146 event pairs, 1468 based on Foata normal form. 125/20387 useless extension candidates. Maximal degree in co-relation 82579. Up to 4103 conditions per place. [2025-04-29 11:10:21,054 INFO L140 encePairwiseOnDemand]: 207/265 looper letters, 1513 selfloop transitions, 248 changer transitions 0/1999 dead transitions. [2025-04-29 11:10:21,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 1999 transitions, 21314 flow [2025-04-29 11:10:21,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:10:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:10:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3595 transitions. [2025-04-29 11:10:21,060 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6460017969451932 [2025-04-29 11:10:21,060 INFO L175 Difference]: Start difference. First operand has 430 places, 1307 transitions, 11510 flow. Second operand 21 states and 3595 transitions. [2025-04-29 11:10:21,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 1999 transitions, 21314 flow [2025-04-29 11:10:21,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 1999 transitions, 21208 flow, removed 32 selfloop flow, removed 2 redundant places. [2025-04-29 11:10:21,596 INFO L231 Difference]: Finished difference. Result has 462 places, 1421 transitions, 14066 flow [2025-04-29 11:10:21,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=11455, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1076, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=14066, PETRI_PLACES=462, PETRI_TRANSITIONS=1421} [2025-04-29 11:10:21,597 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, 196 predicate places. [2025-04-29 11:10:21,597 INFO L485 AbstractCegarLoop]: Abstraction has has 462 places, 1421 transitions, 14066 flow [2025-04-29 11:10:21,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 151.86666666666667) internal successors, (2278), 15 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:21,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:21,598 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:21,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:10:21,599 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-29 11:10:21,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1406486034, now seen corresponding path program 2 times [2025-04-29 11:10:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:21,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039806717] [2025-04-29 11:10:21,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:10:21,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:21,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-04-29 11:10:21,630 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-04-29 11:10:21,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:10:21,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:22,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:22,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039806717] [2025-04-29 11:10:22,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039806717] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:10:22,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806364878] [2025-04-29 11:10:22,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:10:22,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:10:22,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:10:22,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:10:22,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:10:22,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-04-29 11:10:22,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-04-29 11:10:22,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:10:22,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:22,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:10:22,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:10:22,637 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:10:22,661 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:10:22,661 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:10:22,725 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:10:22,744 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-04-29 11:10:22,769 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:22,769 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-04-29 11:10:22,800 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:22,801 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-04-29 11:10:22,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-04-29 11:10:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:23,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:10:23,031 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_757 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_757) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|) |c_ULTIMATE.start_init_#t~nondet0#1|)) (forall ((v_ArrVal_757 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_757) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)) |c_ULTIMATE.start_init_#t~nondet0#1|)) (forall ((v_ArrVal_757 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_757) |c_ULTIMATE.start_init_~p#1.base|) (+ 3 |c_ULTIMATE.start_init_~p#1.offset|)) |c_ULTIMATE.start_init_#t~nondet0#1|)) (forall ((v_ArrVal_757 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet0#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_757) |c_ULTIMATE.start_init_~p#1.base|) (+ 2 |c_ULTIMATE.start_init_~p#1.offset|))))) is different from false [2025-04-29 11:10:23,047 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| (store (select |c_#race| |c_ULTIMATE.start_init_~p#1.base|) .cse1 |c_ULTIMATE.start_init_#t~nondet0#1|)))) (and (forall ((v_ArrVal_757 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_757) |c_ULTIMATE.start_init_~p#1.base|) .cse1) |c_ULTIMATE.start_init_#t~nondet0#1|)) (forall ((v_ArrVal_757 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_757) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|) |c_ULTIMATE.start_init_#t~nondet0#1|)) (forall ((v_ArrVal_757 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_757) |c_ULTIMATE.start_init_~p#1.base|) (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)) |c_ULTIMATE.start_init_#t~nondet0#1|)) (forall ((v_ArrVal_757 (Array Int Int))) (= |c_ULTIMATE.start_init_#t~nondet0#1| (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_757) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1))))))) is different from false [2025-04-29 11:10:23,065 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_init_~p#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_init_~p#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_init_~p#1.base|) .cse1 |c_ULTIMATE.start_init_#t~nondet0#1|) .cse2 |c_ULTIMATE.start_init_#t~nondet0#1|)))) (and (forall ((v_ArrVal_757 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_757) |c_ULTIMATE.start_init_~p#1.base|) .cse1) |c_ULTIMATE.start_init_#t~nondet0#1|)) (forall ((v_ArrVal_757 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_757) |c_ULTIMATE.start_init_~p#1.base|) (+ |c_ULTIMATE.start_init_~p#1.offset| 1)) |c_ULTIMATE.start_init_#t~nondet0#1|)) (forall ((v_ArrVal_757 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_757) |c_ULTIMATE.start_init_~p#1.base|) .cse2) |c_ULTIMATE.start_init_#t~nondet0#1|)) (forall ((v_ArrVal_757 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_757) |c_ULTIMATE.start_init_~p#1.base|) |c_ULTIMATE.start_init_~p#1.offset|) |c_ULTIMATE.start_init_#t~nondet0#1|))))) is different from false [2025-04-29 11:10:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:25,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806364878] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:10:25,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:10:25,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2025-04-29 11:10:25,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452101710] [2025-04-29 11:10:25,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:10:25,028 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-29 11:10:25,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:25,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-29 11:10:25,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=660, Unknown=3, NotChecked=162, Total=930 [2025-04-29 11:10:25,128 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 265 [2025-04-29 11:10:25,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 1421 transitions, 14066 flow. Second operand has 31 states, 31 states have (on average 89.70967741935483) internal successors, (2781), 31 states have internal predecessors, (2781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:25,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:25,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 265 [2025-04-29 11:10:25,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:35,547 INFO L116 PetriNetUnfolderBase]: 13859/34495 cut-off events. [2025-04-29 11:10:35,547 INFO L117 PetriNetUnfolderBase]: For 140327/140393 co-relation queries the response was YES. [2025-04-29 11:10:35,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143349 conditions, 34495 events. 13859/34495 cut-off events. For 140327/140393 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 306975 event pairs, 3298 based on Foata normal form. 63/32767 useless extension candidates. Maximal degree in co-relation 143122. Up to 13002 conditions per place. [2025-04-29 11:10:36,074 INFO L140 encePairwiseOnDemand]: 213/265 looper letters, 2085 selfloop transitions, 223 changer transitions 0/2418 dead transitions. [2025-04-29 11:10:36,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 2418 transitions, 27959 flow [2025-04-29 11:10:36,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 11:10:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-29 11:10:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2746 transitions. [2025-04-29 11:10:36,076 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4505332239540607 [2025-04-29 11:10:36,076 INFO L175 Difference]: Start difference. First operand has 462 places, 1421 transitions, 14066 flow. Second operand 23 states and 2746 transitions. [2025-04-29 11:10:36,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 2418 transitions, 27959 flow [2025-04-29 11:10:37,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 2418 transitions, 27521 flow, removed 152 selfloop flow, removed 6 redundant places. [2025-04-29 11:10:37,163 INFO L231 Difference]: Finished difference. Result has 493 places, 1546 transitions, 16277 flow [2025-04-29 11:10:37,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=13691, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=16277, PETRI_PLACES=493, PETRI_TRANSITIONS=1546} [2025-04-29 11:10:37,164 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, 227 predicate places. [2025-04-29 11:10:37,164 INFO L485 AbstractCegarLoop]: Abstraction has has 493 places, 1546 transitions, 16277 flow [2025-04-29 11:10:37,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 89.70967741935483) internal successors, (2781), 31 states have internal predecessors, (2781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:37,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:37,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:37,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:10:37,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 11:10:37,370 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-04-29 11:10:37,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2060337058, now seen corresponding path program 4 times [2025-04-29 11:10:37,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:37,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913595586] [2025-04-29 11:10:37,371 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:10:37,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:37,383 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-04-29 11:10:37,393 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-29 11:10:37,394 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:10:37,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:37,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:37,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913595586] [2025-04-29 11:10:37,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913595586] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:10:37,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231425673] [2025-04-29 11:10:37,701 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:10:37,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:10:37,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:10:37,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:10:37,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:10:37,947 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-04-29 11:10:37,979 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-04-29 11:10:37,979 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:10:37,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:37,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 11:10:37,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:10:37,993 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:10:38,005 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:10:38,005 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:10:38,023 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 11:10:38,029 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-04-29 11:10:38,042 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:38,042 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-04-29 11:10:38,051 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:38,052 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-04-29 11:10:38,064 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-04-29 11:10:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:38,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:10:38,088 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_922) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t_funThread1of1ForFork0_init_#t~nondet0#1|)) (forall ((v_ArrVal_922 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet0#1| (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_922) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_922 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet0#1| (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_922) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3)))) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_922) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|) |c_t_funThread1of1ForFork0_init_#t~nondet0#1|))) is different from false [2025-04-29 11:10:38,103 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet0#1|)))) (and (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_922) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|) |c_t_funThread1of1ForFork0_init_#t~nondet0#1|)) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_922) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t_funThread1of1ForFork0_init_#t~nondet0#1|)) (forall ((v_ArrVal_922 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_922) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)) |c_t_funThread1of1ForFork0_init_#t~nondet0#1|)) (forall ((v_ArrVal_922 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet0#1| (select (select (store .cse0 |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_922) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1)))))) is different from false [2025-04-29 11:10:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:10:41,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231425673] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:10:41,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:10:41,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 19 [2025-04-29 11:10:41,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221202510] [2025-04-29 11:10:41,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:10:41,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:10:41,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:41,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:10:41,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=247, Unknown=14, NotChecked=66, Total=380 [2025-04-29 11:10:41,799 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 265 [2025-04-29 11:10:41,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 1546 transitions, 16277 flow. Second operand has 20 states, 20 states have (on average 92.2) internal successors, (1844), 20 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:41,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:41,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 265 [2025-04-29 11:10:41,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15