./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_03-list2_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_03-list2_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 395b7ffa5647b483120369e4dc84c1d19589cf18217c1a04022b1d6c5afa045f --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:08:44,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:08:44,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:08:44,974 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:08:44,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:08:44,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:08:44,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:08:44,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:08:44,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:08:44,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:08:44,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:08:44,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:08:44,993 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:08:44,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:08:44,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:08:44,993 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:08:44,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:08:44,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:08:44,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:08:44,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:08:44,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:08:44,993 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:08:44,993 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:08:44,993 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:08:44,993 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:08:44,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:08:44,993 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:08:44,993 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:08:44,995 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:08:44,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:44,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:44,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:44,995 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:08:44,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:44,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:44,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:44,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:08:44,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:08:44,996 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:08:44,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:08:44,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:08:44,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:08:44,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:08:44,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:08:44,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:08:44,996 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 -> 395b7ffa5647b483120369e4dc84c1d19589cf18217c1a04022b1d6c5afa045f [2025-04-29 11:08:45,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:08:45,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:08:45,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:08:45,211 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:08:45,211 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:08:45,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.c [2025-04-29 11:08:46,485 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afecfa47c/6e87733e98b040fbb1d4a6faf03b51fe/FLAGd4aafe003 [2025-04-29 11:08:46,709 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:08:46,710 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_03-list2_rc.c [2025-04-29 11:08:46,711 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:46,711 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:46,711 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:46,718 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afecfa47c/6e87733e98b040fbb1d4a6faf03b51fe/FLAGd4aafe003 [2025-04-29 11:08:47,535 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afecfa47c/6e87733e98b040fbb1d4a6faf03b51fe [2025-04-29 11:08:47,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:08:47,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:08:47,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:47,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:08:47,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:08:47,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:47" (1/1) ... [2025-04-29 11:08:47,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2841bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:47, skipping insertion in model container [2025-04-29 11:08:47,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:47" (1/1) ... [2025-04-29 11:08:47,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:08:47,725 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:47,735 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:08:47,759 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:47,769 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:08:47,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:47 WrapperNode [2025-04-29 11:08:47,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:47,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:47,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:08:47,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:08:47,777 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:08:47" (1/1) ... [2025-04-29 11:08:47,784 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:08:47" (1/1) ... [2025-04-29 11:08:47,802 INFO L138 Inliner]: procedures = 15, calls = 35, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2025-04-29 11:08:47,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:47,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:08:47,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:08:47,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:08:47,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:47" (1/1) ... [2025-04-29 11:08:47,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:47" (1/1) ... [2025-04-29 11:08:47,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:47" (1/1) ... [2025-04-29 11:08:47,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:47" (1/1) ... [2025-04-29 11:08:47,824 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:47" (1/1) ... [2025-04-29 11:08:47,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:47" (1/1) ... [2025-04-29 11:08:47,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:47" (1/1) ... [2025-04-29 11:08:47,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:47" (1/1) ... [2025-04-29 11:08:47,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:47" (1/1) ... [2025-04-29 11:08:47,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:08:47,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:08:47,832 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:08:47,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:08:47,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:47" (1/1) ... [2025-04-29 11:08:47,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:47,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:47,860 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:08:47,864 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:08:47,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-29 11:08:47,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:08:47,878 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:08:47,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:08:47,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-29 11:08:47,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:08:47,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:08:47,878 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:08:47,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:08:47,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:08:47,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:08:47,879 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:08:47,879 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:08:47,880 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:08:47,951 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:08:47,952 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:08:48,320 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:08:48,320 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:08:48,346 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:08:48,346 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:08:48,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:48 BoogieIcfgContainer [2025-04-29 11:08:48,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:08:48,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:08:48,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:08:48,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:08:48,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:08:47" (1/3) ... [2025-04-29 11:08:48,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150eb76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:48, skipping insertion in model container [2025-04-29 11:08:48,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:47" (2/3) ... [2025-04-29 11:08:48,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150eb76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:48, skipping insertion in model container [2025-04-29 11:08:48,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:48" (3/3) ... [2025-04-29 11:08:48,353 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.c [2025-04-29 11:08:48,363 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:08:48,365 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_03-list2_rc.c that has 2 procedures, 269 locations, 267 edges, 1 initial locations, 0 loop locations, and 28 error locations. [2025-04-29 11:08:48,366 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:08:48,420 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:08:48,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 272 places, 268 transitions, 540 flow [2025-04-29 11:08:48,533 INFO L116 PetriNetUnfolderBase]: 0/267 cut-off events. [2025-04-29 11:08:48,535 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:48,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 267 events. 0/267 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 159 event pairs, 0 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-29 11:08:48,540 INFO L82 GeneralOperation]: Start removeDead. Operand has 272 places, 268 transitions, 540 flow [2025-04-29 11:08:48,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 271 places, 267 transitions, 537 flow [2025-04-29 11:08:48,555 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:08:48,565 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;@6fb6a9a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:08:48,565 INFO L341 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-04-29 11:08:48,572 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:08:48,572 INFO L116 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-04-29 11:08:48,573 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:48,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:48,574 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] [2025-04-29 11:08:48,574 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:08:48,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:48,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2051787763, now seen corresponding path program 1 times [2025-04-29 11:08:48,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:48,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359896968] [2025-04-29 11:08:48,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:48,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:48,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:08:48,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:08:48,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:48,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:49,118 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:08:49,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:49,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359896968] [2025-04-29 11:08:49,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359896968] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:49,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:49,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:49,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809036635] [2025-04-29 11:08:49,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:49,125 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:49,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:49,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:49,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:49,617 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 268 [2025-04-29 11:08:49,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 267 transitions, 537 flow. Second operand has 6 states, 6 states have (on average 179.33333333333334) internal successors, (1076), 6 states have internal predecessors, (1076), 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:08:49,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:49,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 268 [2025-04-29 11:08:49,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:49,993 INFO L116 PetriNetUnfolderBase]: 560/2317 cut-off events. [2025-04-29 11:08:49,993 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:49,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3529 conditions, 2317 events. 560/2317 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14861 event pairs, 560 based on Foata normal form. 0/2107 useless extension candidates. Maximal degree in co-relation 3350. Up to 1193 conditions per place. [2025-04-29 11:08:50,007 INFO L140 encePairwiseOnDemand]: 250/268 looper letters, 72 selfloop transitions, 15 changer transitions 0/264 dead transitions. [2025-04-29 11:08:50,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 264 transitions, 705 flow [2025-04-29 11:08:50,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:50,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1158 transitions. [2025-04-29 11:08:50,020 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7201492537313433 [2025-04-29 11:08:50,024 INFO L175 Difference]: Start difference. First operand has 271 places, 267 transitions, 537 flow. Second operand 6 states and 1158 transitions. [2025-04-29 11:08:50,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 264 transitions, 705 flow [2025-04-29 11:08:50,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 264 transitions, 704 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:50,035 INFO L231 Difference]: Finished difference. Result has 272 places, 264 transitions, 560 flow [2025-04-29 11:08:50,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=560, PETRI_PLACES=272, PETRI_TRANSITIONS=264} [2025-04-29 11:08:50,040 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, 1 predicate places. [2025-04-29 11:08:50,041 INFO L485 AbstractCegarLoop]: Abstraction has has 272 places, 264 transitions, 560 flow [2025-04-29 11:08:50,042 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 179.33333333333334) internal successors, (1076), 6 states have internal predecessors, (1076), 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:08:50,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:50,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:50,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:08:50,042 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:08:50,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:50,043 INFO L85 PathProgramCache]: Analyzing trace with hash 733622317, now seen corresponding path program 1 times [2025-04-29 11:08:50,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:50,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903645257] [2025-04-29 11:08:50,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:50,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:50,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:08:50,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:08:50,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:50,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:50,302 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:08:50,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:50,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903645257] [2025-04-29 11:08:50,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903645257] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:50,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:50,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:50,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206115942] [2025-04-29 11:08:50,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:50,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:50,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:50,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:50,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:50,760 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 268 [2025-04-29 11:08:50,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 264 transitions, 560 flow. Second operand has 6 states, 6 states have (on average 179.33333333333334) internal successors, (1076), 6 states have internal predecessors, (1076), 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:08:50,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:50,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 268 [2025-04-29 11:08:50,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:51,034 INFO L116 PetriNetUnfolderBase]: 560/2314 cut-off events. [2025-04-29 11:08:51,034 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:51,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3541 conditions, 2314 events. 560/2314 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14858 event pairs, 560 based on Foata normal form. 0/2107 useless extension candidates. Maximal degree in co-relation 3391. Up to 1193 conditions per place. [2025-04-29 11:08:51,044 INFO L140 encePairwiseOnDemand]: 250/268 looper letters, 72 selfloop transitions, 15 changer transitions 0/261 dead transitions. [2025-04-29 11:08:51,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 261 transitions, 728 flow [2025-04-29 11:08:51,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:51,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1158 transitions. [2025-04-29 11:08:51,047 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7201492537313433 [2025-04-29 11:08:51,047 INFO L175 Difference]: Start difference. First operand has 272 places, 264 transitions, 560 flow. Second operand 6 states and 1158 transitions. [2025-04-29 11:08:51,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 261 transitions, 728 flow [2025-04-29 11:08:51,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 261 transitions, 698 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:51,052 INFO L231 Difference]: Finished difference. Result has 269 places, 261 transitions, 554 flow [2025-04-29 11:08:51,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=554, PETRI_PLACES=269, PETRI_TRANSITIONS=261} [2025-04-29 11:08:51,053 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, -2 predicate places. [2025-04-29 11:08:51,053 INFO L485 AbstractCegarLoop]: Abstraction has has 269 places, 261 transitions, 554 flow [2025-04-29 11:08:51,054 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 179.33333333333334) internal successors, (1076), 6 states have internal predecessors, (1076), 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:08:51,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:51,054 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] [2025-04-29 11:08:51,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:08:51,054 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:08:51,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:51,055 INFO L85 PathProgramCache]: Analyzing trace with hash 282170032, now seen corresponding path program 1 times [2025-04-29 11:08:51,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:51,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074561488] [2025-04-29 11:08:51,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:51,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:51,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:08:51,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:08:51,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:51,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:51,095 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:08:51,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:51,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074561488] [2025-04-29 11:08:51,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074561488] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:51,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:51,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:08:51,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856599819] [2025-04-29 11:08:51,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:51,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:51,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:51,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:51,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:51,114 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 268 [2025-04-29 11:08:51,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 261 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 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:08:51,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:51,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 268 [2025-04-29 11:08:51,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:51,194 INFO L116 PetriNetUnfolderBase]: 30/710 cut-off events. [2025-04-29 11:08:51,195 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:51,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 710 events. 30/710 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2631 event pairs, 30 based on Foata normal form. 0/635 useless extension candidates. Maximal degree in co-relation 671. Up to 78 conditions per place. [2025-04-29 11:08:51,199 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 17 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2025-04-29 11:08:51,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 260 transitions, 590 flow [2025-04-29 11:08:51,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 764 transitions. [2025-04-29 11:08:51,201 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9502487562189055 [2025-04-29 11:08:51,201 INFO L175 Difference]: Start difference. First operand has 269 places, 261 transitions, 554 flow. Second operand 3 states and 764 transitions. [2025-04-29 11:08:51,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 260 transitions, 590 flow [2025-04-29 11:08:51,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 260 transitions, 560 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:51,208 INFO L231 Difference]: Finished difference. Result has 265 places, 260 transitions, 526 flow [2025-04-29 11:08:51,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=265, PETRI_TRANSITIONS=260} [2025-04-29 11:08:51,209 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, -6 predicate places. [2025-04-29 11:08:51,209 INFO L485 AbstractCegarLoop]: Abstraction has has 265 places, 260 transitions, 526 flow [2025-04-29 11:08:51,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 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:08:51,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:51,210 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] [2025-04-29 11:08:51,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:08:51,210 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:08:51,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:51,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1411733829, now seen corresponding path program 1 times [2025-04-29 11:08:51,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:51,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860572340] [2025-04-29 11:08:51,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:51,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:51,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:08:51,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-29 11:08:51,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:51,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:51,253 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:08:51,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:51,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860572340] [2025-04-29 11:08:51,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860572340] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:51,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:51,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:08:51,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446433977] [2025-04-29 11:08:51,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:51,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:51,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:51,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:51,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:51,268 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 268 [2025-04-29 11:08:51,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 260 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 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:08:51,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:51,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 268 [2025-04-29 11:08:51,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:51,349 INFO L116 PetriNetUnfolderBase]: 36/742 cut-off events. [2025-04-29 11:08:51,350 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:51,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 742 events. 36/742 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3003 event pairs, 36 based on Foata normal form. 0/673 useless extension candidates. Maximal degree in co-relation 788. Up to 89 conditions per place. [2025-04-29 11:08:51,352 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 17 selfloop transitions, 1 changer transitions 0/256 dead transitions. [2025-04-29 11:08:51,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 256 transitions, 554 flow [2025-04-29 11:08:51,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2025-04-29 11:08:51,354 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.945273631840796 [2025-04-29 11:08:51,354 INFO L175 Difference]: Start difference. First operand has 265 places, 260 transitions, 526 flow. Second operand 3 states and 760 transitions. [2025-04-29 11:08:51,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 256 transitions, 554 flow [2025-04-29 11:08:51,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 256 transitions, 550 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:51,357 INFO L231 Difference]: Finished difference. Result has 261 places, 256 transitions, 516 flow [2025-04-29 11:08:51,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=261, PETRI_TRANSITIONS=256} [2025-04-29 11:08:51,358 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, -10 predicate places. [2025-04-29 11:08:51,359 INFO L485 AbstractCegarLoop]: Abstraction has has 261 places, 256 transitions, 516 flow [2025-04-29 11:08:51,359 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 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:08:51,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:51,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:51,360 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:08:51,360 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:08:51,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:51,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1555962330, now seen corresponding path program 1 times [2025-04-29 11:08:51,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:51,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208428481] [2025-04-29 11:08:51,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:51,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:51,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-04-29 11:08:51,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-04-29 11:08:51,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:51,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:51,667 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:08:51,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:51,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208428481] [2025-04-29 11:08:51,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208428481] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:51,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:51,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:51,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203180785] [2025-04-29 11:08:51,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:51,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:51,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:51,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:51,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:51,910 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 268 [2025-04-29 11:08:51,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 256 transitions, 516 flow. Second operand has 6 states, 6 states have (on average 181.16666666666666) internal successors, (1087), 6 states have internal predecessors, (1087), 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:08:51,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:51,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 268 [2025-04-29 11:08:51,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:52,222 INFO L116 PetriNetUnfolderBase]: 638/2511 cut-off events. [2025-04-29 11:08:52,222 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:52,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3883 conditions, 2511 events. 638/2511 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 16289 event pairs, 638 based on Foata normal form. 0/2309 useless extension candidates. Maximal degree in co-relation 3822. Up to 1362 conditions per place. [2025-04-29 11:08:52,230 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 85 selfloop transitions, 5 changer transitions 0/255 dead transitions. [2025-04-29 11:08:52,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 255 transitions, 694 flow [2025-04-29 11:08:52,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:52,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1153 transitions. [2025-04-29 11:08:52,233 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7170398009950248 [2025-04-29 11:08:52,233 INFO L175 Difference]: Start difference. First operand has 261 places, 256 transitions, 516 flow. Second operand 6 states and 1153 transitions. [2025-04-29 11:08:52,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 255 transitions, 694 flow [2025-04-29 11:08:52,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 255 transitions, 693 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:52,236 INFO L231 Difference]: Finished difference. Result has 264 places, 255 transitions, 523 flow [2025-04-29 11:08:52,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=523, PETRI_PLACES=264, PETRI_TRANSITIONS=255} [2025-04-29 11:08:52,237 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, -7 predicate places. [2025-04-29 11:08:52,237 INFO L485 AbstractCegarLoop]: Abstraction has has 264 places, 255 transitions, 523 flow [2025-04-29 11:08:52,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.16666666666666) internal successors, (1087), 6 states have internal predecessors, (1087), 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:08:52,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:52,238 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] [2025-04-29 11:08:52,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:08:52,238 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:08:52,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:52,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2026789694, now seen corresponding path program 1 times [2025-04-29 11:08:52,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:52,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178976350] [2025-04-29 11:08:52,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:52,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-29 11:08:52,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-29 11:08:52,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:52,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:52,290 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:08:52,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:52,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178976350] [2025-04-29 11:08:52,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178976350] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:52,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:52,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:08:52,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930880041] [2025-04-29 11:08:52,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:52,291 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:52,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:52,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:52,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:52,311 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 268 [2025-04-29 11:08:52,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 255 transitions, 523 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 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:08:52,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:52,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 268 [2025-04-29 11:08:52,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:52,365 INFO L116 PetriNetUnfolderBase]: 30/698 cut-off events. [2025-04-29 11:08:52,366 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:52,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 698 events. 30/698 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2657 event pairs, 30 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 737. Up to 78 conditions per place. [2025-04-29 11:08:52,368 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 17 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2025-04-29 11:08:52,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 254 transitions, 559 flow [2025-04-29 11:08:52,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 764 transitions. [2025-04-29 11:08:52,369 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9502487562189055 [2025-04-29 11:08:52,370 INFO L175 Difference]: Start difference. First operand has 264 places, 255 transitions, 523 flow. Second operand 3 states and 764 transitions. [2025-04-29 11:08:52,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 254 transitions, 559 flow [2025-04-29 11:08:52,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 254 transitions, 549 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:52,372 INFO L231 Difference]: Finished difference. Result has 260 places, 254 transitions, 515 flow [2025-04-29 11:08:52,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=515, PETRI_PLACES=260, PETRI_TRANSITIONS=254} [2025-04-29 11:08:52,373 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, -11 predicate places. [2025-04-29 11:08:52,373 INFO L485 AbstractCegarLoop]: Abstraction has has 260 places, 254 transitions, 515 flow [2025-04-29 11:08:52,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 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:08:52,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:52,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:52,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:08:52,374 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:08:52,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:52,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1720435595, now seen corresponding path program 1 times [2025-04-29 11:08:52,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:52,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223897527] [2025-04-29 11:08:52,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:52,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:52,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-29 11:08:52,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-29 11:08:52,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:52,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:52,432 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:08:52,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:52,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223897527] [2025-04-29 11:08:52,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223897527] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:52,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:52,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:08:52,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711860964] [2025-04-29 11:08:52,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:52,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:52,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:52,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:52,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:52,449 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 268 [2025-04-29 11:08:52,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 254 transitions, 515 flow. Second operand has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 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:08:52,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:52,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 268 [2025-04-29 11:08:52,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:52,516 INFO L116 PetriNetUnfolderBase]: 36/726 cut-off events. [2025-04-29 11:08:52,516 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:52,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 726 events. 36/726 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2938 event pairs, 36 based on Foata normal form. 0/670 useless extension candidates. Maximal degree in co-relation 774. Up to 89 conditions per place. [2025-04-29 11:08:52,519 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 17 selfloop transitions, 1 changer transitions 0/250 dead transitions. [2025-04-29 11:08:52,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 250 transitions, 543 flow [2025-04-29 11:08:52,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2025-04-29 11:08:52,521 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.945273631840796 [2025-04-29 11:08:52,521 INFO L175 Difference]: Start difference. First operand has 260 places, 254 transitions, 515 flow. Second operand 3 states and 760 transitions. [2025-04-29 11:08:52,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 250 transitions, 543 flow [2025-04-29 11:08:52,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 250 transitions, 539 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:52,524 INFO L231 Difference]: Finished difference. Result has 256 places, 250 transitions, 505 flow [2025-04-29 11:08:52,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=505, PETRI_PLACES=256, PETRI_TRANSITIONS=250} [2025-04-29 11:08:52,525 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, -15 predicate places. [2025-04-29 11:08:52,526 INFO L485 AbstractCegarLoop]: Abstraction has has 256 places, 250 transitions, 505 flow [2025-04-29 11:08:52,527 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 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:08:52,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:52,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:52,527 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:08:52,527 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:08:52,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:52,528 INFO L85 PathProgramCache]: Analyzing trace with hash -56879980, now seen corresponding path program 1 times [2025-04-29 11:08:52,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:52,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517142361] [2025-04-29 11:08:52,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:52,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:52,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-29 11:08:52,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:08:52,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:52,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:52,925 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:08:52,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:52,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517142361] [2025-04-29 11:08:52,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517142361] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:52,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:52,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:52,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947574128] [2025-04-29 11:08:52,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:52,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:52,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:52,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:52,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:53,199 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 268 [2025-04-29 11:08:53,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 250 transitions, 505 flow. Second operand has 6 states, 6 states have (on average 183.16666666666666) internal successors, (1099), 6 states have internal predecessors, (1099), 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:08:53,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:53,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 268 [2025-04-29 11:08:53,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:53,515 INFO L116 PetriNetUnfolderBase]: 638/2420 cut-off events. [2025-04-29 11:08:53,515 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:53,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3793 conditions, 2420 events. 638/2420 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 15426 event pairs, 638 based on Foata normal form. 0/2273 useless extension candidates. Maximal degree in co-relation 3733. Up to 1362 conditions per place. [2025-04-29 11:08:53,525 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 85 selfloop transitions, 5 changer transitions 0/249 dead transitions. [2025-04-29 11:08:53,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 249 transitions, 683 flow [2025-04-29 11:08:53,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:53,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1153 transitions. [2025-04-29 11:08:53,528 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7170398009950248 [2025-04-29 11:08:53,528 INFO L175 Difference]: Start difference. First operand has 256 places, 250 transitions, 505 flow. Second operand 6 states and 1153 transitions. [2025-04-29 11:08:53,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 249 transitions, 683 flow [2025-04-29 11:08:53,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 249 transitions, 682 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:53,533 INFO L231 Difference]: Finished difference. Result has 259 places, 249 transitions, 512 flow [2025-04-29 11:08:53,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=512, PETRI_PLACES=259, PETRI_TRANSITIONS=249} [2025-04-29 11:08:53,534 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, -12 predicate places. [2025-04-29 11:08:53,534 INFO L485 AbstractCegarLoop]: Abstraction has has 259 places, 249 transitions, 512 flow [2025-04-29 11:08:53,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 183.16666666666666) internal successors, (1099), 6 states have internal predecessors, (1099), 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:08:53,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:53,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:53,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:08:53,536 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:08:53,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:53,537 INFO L85 PathProgramCache]: Analyzing trace with hash 281126589, now seen corresponding path program 1 times [2025-04-29 11:08:53,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:53,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057270320] [2025-04-29 11:08:53,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:53,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:53,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-04-29 11:08:53,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-04-29 11:08:53,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:53,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:53,922 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:08:53,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:53,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057270320] [2025-04-29 11:08:53,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057270320] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:53,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:53,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:53,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522161106] [2025-04-29 11:08:53,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:53,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:53,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:53,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:53,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:54,308 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 268 [2025-04-29 11:08:54,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 249 transitions, 512 flow. Second operand has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:08:54,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:54,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 268 [2025-04-29 11:08:54,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:54,580 INFO L116 PetriNetUnfolderBase]: 232/1779 cut-off events. [2025-04-29 11:08:54,581 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:54,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2337 conditions, 1779 events. 232/1779 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11403 event pairs, 20 based on Foata normal form. 0/1655 useless extension candidates. Maximal degree in co-relation 2277. Up to 305 conditions per place. [2025-04-29 11:08:54,585 INFO L140 encePairwiseOnDemand]: 249/268 looper letters, 100 selfloop transitions, 38 changer transitions 0/323 dead transitions. [2025-04-29 11:08:54,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 323 transitions, 936 flow [2025-04-29 11:08:54,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:54,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1364 transitions. [2025-04-29 11:08:54,588 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8482587064676617 [2025-04-29 11:08:54,588 INFO L175 Difference]: Start difference. First operand has 259 places, 249 transitions, 512 flow. Second operand 6 states and 1364 transitions. [2025-04-29 11:08:54,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 323 transitions, 936 flow [2025-04-29 11:08:54,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 323 transitions, 926 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:54,595 INFO L231 Difference]: Finished difference. Result has 263 places, 285 transitions, 760 flow [2025-04-29 11:08:54,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=760, PETRI_PLACES=263, PETRI_TRANSITIONS=285} [2025-04-29 11:08:54,596 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, -8 predicate places. [2025-04-29 11:08:54,597 INFO L485 AbstractCegarLoop]: Abstraction has has 263 places, 285 transitions, 760 flow [2025-04-29 11:08:54,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:08:54,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:54,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:54,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:08:54,598 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:08:54,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:54,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1327646529, now seen corresponding path program 1 times [2025-04-29 11:08:54,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:54,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322141646] [2025-04-29 11:08:54,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:54,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:54,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-04-29 11:08:54,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-04-29 11:08:54,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:54,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:54,923 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:08:54,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:54,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322141646] [2025-04-29 11:08:54,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322141646] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:54,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:54,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:54,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435398722] [2025-04-29 11:08:54,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:54,924 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:54,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:54,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:54,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:55,351 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 268 [2025-04-29 11:08:55,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 285 transitions, 760 flow. Second operand has 6 states, 6 states have (on average 216.66666666666666) internal successors, (1300), 6 states have internal predecessors, (1300), 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:08:55,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:55,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 268 [2025-04-29 11:08:55,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:55,538 INFO L116 PetriNetUnfolderBase]: 185/1583 cut-off events. [2025-04-29 11:08:55,538 INFO L117 PetriNetUnfolderBase]: For 206/211 co-relation queries the response was YES. [2025-04-29 11:08:55,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2355 conditions, 1583 events. 185/1583 cut-off events. For 206/211 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 9991 event pairs, 75 based on Foata normal form. 0/1463 useless extension candidates. Maximal degree in co-relation 2293. Up to 354 conditions per place. [2025-04-29 11:08:55,544 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 96 selfloop transitions, 5 changer transitions 0/300 dead transitions. [2025-04-29 11:08:55,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 300 transitions, 992 flow [2025-04-29 11:08:55,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1334 transitions. [2025-04-29 11:08:55,547 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8296019900497512 [2025-04-29 11:08:55,547 INFO L175 Difference]: Start difference. First operand has 263 places, 285 transitions, 760 flow. Second operand 6 states and 1334 transitions. [2025-04-29 11:08:55,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 300 transitions, 992 flow [2025-04-29 11:08:55,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 300 transitions, 992 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:55,554 INFO L231 Difference]: Finished difference. Result has 267 places, 284 transitions, 768 flow [2025-04-29 11:08:55,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=768, PETRI_PLACES=267, PETRI_TRANSITIONS=284} [2025-04-29 11:08:55,556 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, -4 predicate places. [2025-04-29 11:08:55,557 INFO L485 AbstractCegarLoop]: Abstraction has has 267 places, 284 transitions, 768 flow [2025-04-29 11:08:55,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.66666666666666) internal successors, (1300), 6 states have internal predecessors, (1300), 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:08:55,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:55,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:55,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:08:55,558 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:08:55,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:55,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1554015371, now seen corresponding path program 1 times [2025-04-29 11:08:55,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:55,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550974297] [2025-04-29 11:08:55,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:55,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:55,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-04-29 11:08:55,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-04-29 11:08:55,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:55,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:08:55,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:55,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550974297] [2025-04-29 11:08:55,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550974297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:55,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:55,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:55,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973315633] [2025-04-29 11:08:55,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:55,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:55,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:55,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:55,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:56,294 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 268 [2025-04-29 11:08:56,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 284 transitions, 768 flow. Second operand has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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:08:56,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:56,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 268 [2025-04-29 11:08:56,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:56,667 INFO L116 PetriNetUnfolderBase]: 583/2940 cut-off events. [2025-04-29 11:08:56,668 INFO L117 PetriNetUnfolderBase]: For 706/713 co-relation queries the response was YES. [2025-04-29 11:08:56,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5018 conditions, 2940 events. 583/2940 cut-off events. For 706/713 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 21837 event pairs, 69 based on Foata normal form. 0/2753 useless extension candidates. Maximal degree in co-relation 4953. Up to 795 conditions per place. [2025-04-29 11:08:56,676 INFO L140 encePairwiseOnDemand]: 246/268 looper letters, 111 selfloop transitions, 72 changer transitions 0/373 dead transitions. [2025-04-29 11:08:56,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 373 transitions, 1504 flow [2025-04-29 11:08:56,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:56,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1341 transitions. [2025-04-29 11:08:56,679 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8339552238805971 [2025-04-29 11:08:56,679 INFO L175 Difference]: Start difference. First operand has 267 places, 284 transitions, 768 flow. Second operand 6 states and 1341 transitions. [2025-04-29 11:08:56,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 373 transitions, 1504 flow [2025-04-29 11:08:56,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 373 transitions, 1486 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:56,685 INFO L231 Difference]: Finished difference. Result has 272 places, 354 transitions, 1424 flow [2025-04-29 11:08:56,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1424, PETRI_PLACES=272, PETRI_TRANSITIONS=354} [2025-04-29 11:08:56,686 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, 1 predicate places. [2025-04-29 11:08:56,686 INFO L485 AbstractCegarLoop]: Abstraction has has 272 places, 354 transitions, 1424 flow [2025-04-29 11:08:56,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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:08:56,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:56,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:56,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:08:56,687 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:08:56,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:56,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2088981702, now seen corresponding path program 1 times [2025-04-29 11:08:56,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:56,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410129119] [2025-04-29 11:08:56,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:56,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:56,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-04-29 11:08:56,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-04-29 11:08:56,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:56,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:08:57,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:57,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410129119] [2025-04-29 11:08:57,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410129119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:57,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:57,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:57,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369155971] [2025-04-29 11:08:57,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:57,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:57,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:57,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:57,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:57,417 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 268 [2025-04-29 11:08:57,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 354 transitions, 1424 flow. Second operand has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 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:08:57,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:57,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 268 [2025-04-29 11:08:57,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:58,075 INFO L116 PetriNetUnfolderBase]: 1657/5687 cut-off events. [2025-04-29 11:08:58,075 INFO L117 PetriNetUnfolderBase]: For 3347/3407 co-relation queries the response was YES. [2025-04-29 11:08:58,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12776 conditions, 5687 events. 1657/5687 cut-off events. For 3347/3407 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 45861 event pairs, 861 based on Foata normal form. 0/5358 useless extension candidates. Maximal degree in co-relation 12709. Up to 3147 conditions per place. [2025-04-29 11:08:58,095 INFO L140 encePairwiseOnDemand]: 245/268 looper letters, 201 selfloop transitions, 89 changer transitions 0/454 dead transitions. [2025-04-29 11:08:58,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 454 transitions, 2408 flow [2025-04-29 11:08:58,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:58,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1254 transitions. [2025-04-29 11:08:58,098 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7798507462686567 [2025-04-29 11:08:58,098 INFO L175 Difference]: Start difference. First operand has 272 places, 354 transitions, 1424 flow. Second operand 6 states and 1254 transitions. [2025-04-29 11:08:58,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 454 transitions, 2408 flow [2025-04-29 11:08:58,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 454 transitions, 2408 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:58,109 INFO L231 Difference]: Finished difference. Result has 282 places, 438 transitions, 2226 flow [2025-04-29 11:08:58,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2226, PETRI_PLACES=282, PETRI_TRANSITIONS=438} [2025-04-29 11:08:58,112 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, 11 predicate places. [2025-04-29 11:08:58,112 INFO L485 AbstractCegarLoop]: Abstraction has has 282 places, 438 transitions, 2226 flow [2025-04-29 11:08:58,112 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 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:08:58,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:58,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:58,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:08:58,113 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:08:58,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:58,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1057441083, now seen corresponding path program 1 times [2025-04-29 11:08:58,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:58,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193599107] [2025-04-29 11:08:58,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:58,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:58,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-04-29 11:08:58,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-04-29 11:08:58,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:58,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:08:58,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:58,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193599107] [2025-04-29 11:08:58,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193599107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:58,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:58,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:08:58,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222184016] [2025-04-29 11:08:58,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:58,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:58,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:58,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:58,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:58,221 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 268 [2025-04-29 11:08:58,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 438 transitions, 2226 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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:08:58,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:58,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 268 [2025-04-29 11:08:58,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:58,385 INFO L116 PetriNetUnfolderBase]: 306/1953 cut-off events. [2025-04-29 11:08:58,385 INFO L117 PetriNetUnfolderBase]: For 1112/1178 co-relation queries the response was YES. [2025-04-29 11:08:58,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4085 conditions, 1953 events. 306/1953 cut-off events. For 1112/1178 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13379 event pairs, 31 based on Foata normal form. 4/1877 useless extension candidates. Maximal degree in co-relation 4020. Up to 312 conditions per place. [2025-04-29 11:08:58,393 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 10 selfloop transitions, 6 changer transitions 0/378 dead transitions. [2025-04-29 11:08:58,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 378 transitions, 1694 flow [2025-04-29 11:08:58,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2025-04-29 11:08:58,396 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9850746268656716 [2025-04-29 11:08:58,396 INFO L175 Difference]: Start difference. First operand has 282 places, 438 transitions, 2226 flow. Second operand 3 states and 792 transitions. [2025-04-29 11:08:58,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 378 transitions, 1694 flow [2025-04-29 11:08:58,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 378 transitions, 1606 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:58,407 INFO L231 Difference]: Finished difference. Result has 285 places, 376 transitions, 1596 flow [2025-04-29 11:08:58,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=1562, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1596, PETRI_PLACES=285, PETRI_TRANSITIONS=376} [2025-04-29 11:08:58,408 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, 14 predicate places. [2025-04-29 11:08:58,409 INFO L485 AbstractCegarLoop]: Abstraction has has 285 places, 376 transitions, 1596 flow [2025-04-29 11:08:58,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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:08:58,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:58,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:58,409 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:08:58,409 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:08:58,410 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:58,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1746068354, now seen corresponding path program 1 times [2025-04-29 11:08:58,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:58,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367411656] [2025-04-29 11:08:58,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:58,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:58,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-04-29 11:08:58,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-04-29 11:08:58,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:58,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:08:58,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:58,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367411656] [2025-04-29 11:08:58,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367411656] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:58,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:58,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:58,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369928731] [2025-04-29 11:08:58,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:58,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:58,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:58,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:59,107 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 268 [2025-04-29 11:08:59,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 376 transitions, 1596 flow. Second operand has 6 states, 6 states have (on average 211.33333333333334) internal successors, (1268), 6 states have internal predecessors, (1268), 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:08:59,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:59,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 268 [2025-04-29 11:08:59,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:59,492 INFO L116 PetriNetUnfolderBase]: 690/3105 cut-off events. [2025-04-29 11:08:59,492 INFO L117 PetriNetUnfolderBase]: For 2951/3144 co-relation queries the response was YES. [2025-04-29 11:08:59,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7432 conditions, 3105 events. 690/3105 cut-off events. For 2951/3144 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 23936 event pairs, 54 based on Foata normal form. 20/3014 useless extension candidates. Maximal degree in co-relation 7357. Up to 734 conditions per place. [2025-04-29 11:08:59,503 INFO L140 encePairwiseOnDemand]: 249/268 looper letters, 184 selfloop transitions, 124 changer transitions 4/534 dead transitions. [2025-04-29 11:08:59,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 534 transitions, 3187 flow [2025-04-29 11:08:59,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:59,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1382 transitions. [2025-04-29 11:08:59,509 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8594527363184079 [2025-04-29 11:08:59,509 INFO L175 Difference]: Start difference. First operand has 285 places, 376 transitions, 1596 flow. Second operand 6 states and 1382 transitions. [2025-04-29 11:08:59,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 534 transitions, 3187 flow [2025-04-29 11:08:59,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 534 transitions, 3164 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:59,524 INFO L231 Difference]: Finished difference. Result has 293 places, 478 transitions, 2972 flow [2025-04-29 11:08:59,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=1588, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2972, PETRI_PLACES=293, PETRI_TRANSITIONS=478} [2025-04-29 11:08:59,525 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, 22 predicate places. [2025-04-29 11:08:59,525 INFO L485 AbstractCegarLoop]: Abstraction has has 293 places, 478 transitions, 2972 flow [2025-04-29 11:08:59,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.33333333333334) internal successors, (1268), 6 states have internal predecessors, (1268), 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:08:59,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:59,526 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:59,526 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:08:59,526 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:08:59,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:59,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1006763380, now seen corresponding path program 1 times [2025-04-29 11:08:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:59,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055267110] [2025-04-29 11:08:59,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:59,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:59,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-04-29 11:08:59,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-04-29 11:08:59,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:59,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:08:59,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:59,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055267110] [2025-04-29 11:08:59,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055267110] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:59,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:59,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:59,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031825124] [2025-04-29 11:08:59,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:59,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:59,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:59,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:59,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:00,150 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 268 [2025-04-29 11:09:00,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 478 transitions, 2972 flow. Second operand has 6 states, 6 states have (on average 217.66666666666666) internal successors, (1306), 6 states have internal predecessors, (1306), 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:00,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:00,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 268 [2025-04-29 11:09:00,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:00,527 INFO L116 PetriNetUnfolderBase]: 608/2908 cut-off events. [2025-04-29 11:09:00,527 INFO L117 PetriNetUnfolderBase]: For 5393/5605 co-relation queries the response was YES. [2025-04-29 11:09:00,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7884 conditions, 2908 events. 608/2908 cut-off events. For 5393/5605 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 22143 event pairs, 92 based on Foata normal form. 18/2870 useless extension candidates. Maximal degree in co-relation 7806. Up to 810 conditions per place. [2025-04-29 11:09:00,539 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 218 selfloop transitions, 17 changer transitions 0/493 dead transitions. [2025-04-29 11:09:00,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 493 transitions, 3496 flow [2025-04-29 11:09:00,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1334 transitions. [2025-04-29 11:09:00,542 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8296019900497512 [2025-04-29 11:09:00,542 INFO L175 Difference]: Start difference. First operand has 293 places, 478 transitions, 2972 flow. Second operand 6 states and 1334 transitions. [2025-04-29 11:09:00,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 493 transitions, 3496 flow [2025-04-29 11:09:00,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 493 transitions, 3478 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:00,561 INFO L231 Difference]: Finished difference. Result has 297 places, 477 transitions, 2986 flow [2025-04-29 11:09:00,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=2952, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2986, PETRI_PLACES=297, PETRI_TRANSITIONS=477} [2025-04-29 11:09:00,562 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, 26 predicate places. [2025-04-29 11:09:00,562 INFO L485 AbstractCegarLoop]: Abstraction has has 297 places, 477 transitions, 2986 flow [2025-04-29 11:09:00,563 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.66666666666666) internal successors, (1306), 6 states have internal predecessors, (1306), 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:00,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:00,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,563 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:09:00,563 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:00,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:00,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1499388153, now seen corresponding path program 1 times [2025-04-29 11:09:00,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:00,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065505856] [2025-04-29 11:09:00,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:00,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:00,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-04-29 11:09:00,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-04-29 11:09:00,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:00,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:09:00,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:00,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065505856] [2025-04-29 11:09:00,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065505856] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:00,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:00,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:00,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106259848] [2025-04-29 11:09:00,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:00,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:00,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:00,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:00,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:01,191 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 268 [2025-04-29 11:09:01,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 477 transitions, 2986 flow. Second operand has 6 states, 6 states have (on average 190.66666666666666) internal successors, (1144), 6 states have internal predecessors, (1144), 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:01,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:01,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 268 [2025-04-29 11:09:01,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:01,870 INFO L116 PetriNetUnfolderBase]: 1547/5153 cut-off events. [2025-04-29 11:09:01,870 INFO L117 PetriNetUnfolderBase]: For 7514/7594 co-relation queries the response was YES. [2025-04-29 11:09:01,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15130 conditions, 5153 events. 1547/5153 cut-off events. For 7514/7594 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 41290 event pairs, 582 based on Foata normal form. 1/5001 useless extension candidates. Maximal degree in co-relation 15051. Up to 2881 conditions per place. [2025-04-29 11:09:01,898 INFO L140 encePairwiseOnDemand]: 245/268 looper letters, 304 selfloop transitions, 103 changer transitions 8/583 dead transitions. [2025-04-29 11:09:01,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 583 transitions, 4426 flow [2025-04-29 11:09:01,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:01,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1254 transitions. [2025-04-29 11:09:01,900 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7798507462686567 [2025-04-29 11:09:01,900 INFO L175 Difference]: Start difference. First operand has 297 places, 477 transitions, 2986 flow. Second operand 6 states and 1254 transitions. [2025-04-29 11:09:01,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 583 transitions, 4426 flow [2025-04-29 11:09:01,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 583 transitions, 4392 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:01,925 INFO L231 Difference]: Finished difference. Result has 302 places, 563 transitions, 3970 flow [2025-04-29 11:09:01,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=2952, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3970, PETRI_PLACES=302, PETRI_TRANSITIONS=563} [2025-04-29 11:09:01,926 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, 31 predicate places. [2025-04-29 11:09:01,927 INFO L485 AbstractCegarLoop]: Abstraction has has 302 places, 563 transitions, 3970 flow [2025-04-29 11:09:01,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.66666666666666) internal successors, (1144), 6 states have internal predecessors, (1144), 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:01,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:01,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,927 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:09:01,928 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:01,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:01,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1027911899, now seen corresponding path program 1 times [2025-04-29 11:09:01,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:01,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566621415] [2025-04-29 11:09:01,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:01,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-04-29 11:09:01,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-04-29 11:09:01,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:01,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:03,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:03,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566621415] [2025-04-29 11:09:03,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566621415] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:03,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052829891] [2025-04-29 11:09:03,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:03,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:03,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:03,397 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:09:03,398 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:09:03,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-04-29 11:09:03,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-04-29 11:09:03,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:03,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:03,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-29 11:09:03,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:03,653 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:09:03,730 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:09:03,730 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 11:09:03,867 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 1 [2025-04-29 11:09:03,921 INFO L325 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2025-04-29 11:09:03,922 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2025-04-29 11:09:04,058 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 19 treesize of output 14 [2025-04-29 11:09:04,096 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 19 treesize of output 14 [2025-04-29 11:09:04,132 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 19 treesize of output 14 [2025-04-29 11:09:04,271 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 8 [2025-04-29 11:09:04,309 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:09:04,332 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:09:04,362 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:04,362 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:09:04,400 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:04,400 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:09:04,467 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:09:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:04,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:04,499 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2020 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet6| (select (select (store |c_#race| c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem3.base|) (+ 2 |c_t_funThread1of1ForFork0_#t~mem3.offset|)))) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem3.base|) |c_t_funThread1of1ForFork0_#t~mem3.offset|) |c_t_funThread1of1ForFork0_#t~nondet6|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet6| (select (select (store |c_#race| c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem3.base|) (+ |c_t_funThread1of1ForFork0_#t~mem3.offset| 3)))) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store |c_#race| c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem3.base|) (+ |c_t_funThread1of1ForFork0_#t~mem3.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet6|))) is different from false [2025-04-29 11:09:04,547 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_#t~mem3.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem3.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_#t~mem3.base|) .cse1 |c_t_funThread1of1ForFork0_#t~nondet6|)))) (and (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem3.base|) (+ |c_t_funThread1of1ForFork0_#t~mem3.offset| 1)) |c_t_funThread1of1ForFork0_#t~nondet6|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet6| (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem3.base|) .cse1))) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem3.base|) |c_t_funThread1of1ForFork0_#t~mem3.offset|) |c_t_funThread1of1ForFork0_#t~nondet6|)) (forall ((v_ArrVal_2020 (Array Int Int))) (= (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem3.base|) (+ 2 |c_t_funThread1of1ForFork0_#t~mem3.offset|)) |c_t_funThread1of1ForFork0_#t~nondet6|))))) is different from false [2025-04-29 11:09:04,560 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_t_funThread1of1ForFork0_#t~mem3.offset|)) (.cse1 (+ |c_t_funThread1of1ForFork0_#t~mem3.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem3.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_#t~mem3.base|) .cse2 |c_t_funThread1of1ForFork0_#t~nondet6|) .cse1 |c_t_funThread1of1ForFork0_#t~nondet6|)))) (and (forall ((v_ArrVal_2020 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet6| (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem3.base|) .cse1))) (forall ((v_ArrVal_2020 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet6| (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem3.base|) .cse2))) (forall ((v_ArrVal_2020 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet6| (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem3.base|) (+ |c_t_funThread1of1ForFork0_#t~mem3.offset| 1)))) (forall ((v_ArrVal_2020 (Array Int Int))) (= |c_t_funThread1of1ForFork0_#t~nondet6| (select (select (store .cse0 c_~B~0.base v_ArrVal_2020) |c_t_funThread1of1ForFork0_#t~mem3.base|) |c_t_funThread1of1ForFork0_#t~mem3.offset|)))))) is different from false [2025-04-29 11:09:06,584 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2014 (Array Int Int)) (v_ArrVal_2013 (Array Int Int))) (not (= c_~B~0.base (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2013) c_~B~0.base v_ArrVal_2014) c_~A~0.base) (+ c_~A~0.offset 4))))) is different from false [2025-04-29 11:09:06,755 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2014 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~malloc18#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_2014) c_~A~0.base) (+ c_~A~0.offset 4))))) is different from false [2025-04-29 11:09:06,843 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:06,843 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2025-04-29 11:09:06,847 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-04-29 11:09:06,850 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-04-29 11:09:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:07,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052829891] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:07,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:07,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 17] total 46 [2025-04-29 11:09:07,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476021088] [2025-04-29 11:09:07,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:07,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-29 11:09:07,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:07,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-29 11:09:07,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1508, Unknown=45, NotChecked=420, Total=2162 [2025-04-29 11:09:07,176 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 268 [2025-04-29 11:09:07,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 563 transitions, 3970 flow. Second operand has 47 states, 47 states have (on average 103.93617021276596) internal successors, (4885), 47 states have internal predecessors, (4885), 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:07,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:07,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 268 [2025-04-29 11:09:07,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:09,727 INFO L116 PetriNetUnfolderBase]: 2472/6980 cut-off events. [2025-04-29 11:09:09,727 INFO L117 PetriNetUnfolderBase]: For 12295/12321 co-relation queries the response was YES. [2025-04-29 11:09:09,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23205 conditions, 6980 events. 2472/6980 cut-off events. For 12295/12321 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 55479 event pairs, 326 based on Foata normal form. 19/6942 useless extension candidates. Maximal degree in co-relation 23101. Up to 2994 conditions per place. [2025-04-29 11:09:09,758 INFO L140 encePairwiseOnDemand]: 237/268 looper letters, 619 selfloop transitions, 101 changer transitions 28/835 dead transitions. [2025-04-29 11:09:09,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 835 transitions, 7348 flow [2025-04-29 11:09:09,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-29 11:09:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-29 11:09:09,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3071 transitions. [2025-04-29 11:09:09,763 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40924840085287845 [2025-04-29 11:09:09,763 INFO L175 Difference]: Start difference. First operand has 302 places, 563 transitions, 3970 flow. Second operand 28 states and 3071 transitions. [2025-04-29 11:09:09,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 835 transitions, 7348 flow [2025-04-29 11:09:09,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 835 transitions, 7144 flow, removed 102 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:09,811 INFO L231 Difference]: Finished difference. Result has 339 places, 599 transitions, 4450 flow [2025-04-29 11:09:09,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=3822, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4450, PETRI_PLACES=339, PETRI_TRANSITIONS=599} [2025-04-29 11:09:09,812 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, 68 predicate places. [2025-04-29 11:09:09,813 INFO L485 AbstractCegarLoop]: Abstraction has has 339 places, 599 transitions, 4450 flow [2025-04-29 11:09:09,814 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 103.93617021276596) internal successors, (4885), 47 states have internal predecessors, (4885), 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:09,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:09,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:09:10,016 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,SelfDestructingSolverStorable16 [2025-04-29 11:09:10,017 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:10,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:10,017 INFO L85 PathProgramCache]: Analyzing trace with hash -894708196, now seen corresponding path program 1 times [2025-04-29 11:09:10,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:10,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279403216] [2025-04-29 11:09:10,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:10,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:10,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-04-29 11:09:10,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-04-29 11:09:10,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:10,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:10,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:10,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279403216] [2025-04-29 11:09:10,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279403216] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:10,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592310254] [2025-04-29 11:09:10,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:10,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:10,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:10,952 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:09:10,954 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:09:11,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-04-29 11:09:11,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-04-29 11:09:11,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:11,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:11,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-29 11:09:11,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:11,150 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:09:11,204 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:09:11,204 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 11:09:11,348 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 19 treesize of output 1 [2025-04-29 11:09:11,402 INFO L325 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2025-04-29 11:09:11,402 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2025-04-29 11:09:11,518 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 29 treesize of output 22 [2025-04-29 11:09:11,554 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 29 treesize of output 22 [2025-04-29 11:09:11,598 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 29 treesize of output 22 [2025-04-29 11:09:11,789 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:09:11,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-04-29 11:09:11,853 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:11,853 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-04-29 11:09:11,901 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:11,901 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-04-29 11:09:11,944 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 30 treesize of output 12 [2025-04-29 11:09:11,987 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-29 11:09:11,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-29 11:09:12,010 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-29 11:09:12,022 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-04-29 11:09:12,047 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 45 treesize of output 34 [2025-04-29 11:09:12,056 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 45 treesize of output 34 [2025-04-29 11:09:12,065 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 45 treesize of output 34 [2025-04-29 11:09:12,076 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 45 treesize of output 34 [2025-04-29 11:09:12,107 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 45 treesize of output 34 [2025-04-29 11:09:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:12,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:12,124 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2389 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem3.base| v_ArrVal_2389) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2389 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem3.base| v_ArrVal_2389) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2389 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem3.base| v_ArrVal_2389) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2389 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_#t~mem3.base| v_ArrVal_2389) c_~B~0.base) (+ 7 c_~B~0.offset)) 0))) is different from false [2025-04-29 11:09:12,232 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2384) |c_t_funThread1of1ForFork0_#t~mem3.base| v_ArrVal_2389) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2384) |c_t_funThread1of1ForFork0_#t~mem3.base| v_ArrVal_2389) c_~B~0.base) (+ 7 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2384) |c_t_funThread1of1ForFork0_#t~mem3.base| v_ArrVal_2389) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2384) |c_t_funThread1of1ForFork0_#t~mem3.base| v_ArrVal_2389) c_~B~0.base) (+ 5 c_~B~0.offset)) 0))) is different from false [2025-04-29 11:09:12,265 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2384) .cse0 v_ArrVal_2389) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2384) .cse0 v_ArrVal_2389) c_~B~0.base) (+ 7 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2384) .cse0 v_ArrVal_2389) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2384) .cse0 v_ArrVal_2389) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)))) is different from false [2025-04-29 11:09:12,277 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= 0 (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2384) .cse1 v_ArrVal_2389) c_~B~0.base) (+ 4 c_~B~0.offset)))) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2384) .cse1 v_ArrVal_2389) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2384) .cse1 v_ArrVal_2389) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2384) .cse1 v_ArrVal_2389) c_~B~0.base) (+ 5 c_~B~0.offset)) 0))))) is different from false [2025-04-29 11:09:12,290 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse3 0) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2384) .cse1 v_ArrVal_2389) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2384) .cse1 v_ArrVal_2389) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2384) .cse1 v_ArrVal_2389) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2384) .cse1 v_ArrVal_2389) c_~B~0.base) (+ 5 c_~B~0.offset)) 0))))) is different from false [2025-04-29 11:09:12,304 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 5 c_~B~0.offset)) (.cse4 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) .cse3 0) .cse4 0) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= 0 (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2384) .cse1 v_ArrVal_2389) c_~B~0.base) .cse2))) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2384) .cse1 v_ArrVal_2389) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2384) .cse1 v_ArrVal_2389) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2389 (Array Int Int)) (v_ArrVal_2384 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2384) .cse1 v_ArrVal_2389) c_~B~0.base) .cse4) 0))))) is different from false [2025-04-29 11:09:12,320 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:12,320 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 62 [2025-04-29 11:09:12,325 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:12,325 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 94 [2025-04-29 11:09:12,327 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2025-04-29 11:09:12,330 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-04-29 11:09:12,348 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-29 11:09:12,348 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-04-29 11:09:12,353 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-29 11:09:12,353 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-04-29 11:09:12,358 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-29 11:09:12,358 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-04-29 11:09:12,558 WARN L849 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2373 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2373) c_~A~0.base) (+ c_~A~0.offset 4)) c_~B~0.base))) (not (= c_~B~0.base c_~A~0.base))) is different from false [2025-04-29 11:09:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:12,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592310254] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:12,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:12,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 44 [2025-04-29 11:09:12,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375062330] [2025-04-29 11:09:12,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:12,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-29 11:09:12,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:12,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-29 11:09:12,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1253, Unknown=15, NotChecked=546, Total=1980 [2025-04-29 11:09:13,119 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 268 [2025-04-29 11:09:13,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 599 transitions, 4450 flow. Second operand has 45 states, 45 states have (on average 105.26666666666667) internal successors, (4737), 45 states have internal predecessors, (4737), 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:13,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:13,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 268 [2025-04-29 11:09:13,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:16,072 INFO L116 PetriNetUnfolderBase]: 3029/8463 cut-off events. [2025-04-29 11:09:16,073 INFO L117 PetriNetUnfolderBase]: For 19493/19512 co-relation queries the response was YES. [2025-04-29 11:09:16,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29732 conditions, 8463 events. 3029/8463 cut-off events. For 19493/19512 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 70902 event pairs, 508 based on Foata normal form. 20/8395 useless extension candidates. Maximal degree in co-relation 29611. Up to 2077 conditions per place. [2025-04-29 11:09:16,113 INFO L140 encePairwiseOnDemand]: 229/268 looper letters, 799 selfloop transitions, 153 changer transitions 23/1064 dead transitions. [2025-04-29 11:09:16,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 1064 transitions, 9643 flow [2025-04-29 11:09:16,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-29 11:09:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-29 11:09:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2930 transitions. [2025-04-29 11:09:16,115 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4373134328358209 [2025-04-29 11:09:16,115 INFO L175 Difference]: Start difference. First operand has 339 places, 599 transitions, 4450 flow. Second operand 25 states and 2930 transitions. [2025-04-29 11:09:16,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 1064 transitions, 9643 flow [2025-04-29 11:09:16,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 1064 transitions, 9517 flow, removed 52 selfloop flow, removed 10 redundant places. [2025-04-29 11:09:16,195 INFO L231 Difference]: Finished difference. Result has 365 places, 678 transitions, 5871 flow [2025-04-29 11:09:16,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=4368, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=5871, PETRI_PLACES=365, PETRI_TRANSITIONS=678} [2025-04-29 11:09:16,196 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, 94 predicate places. [2025-04-29 11:09:16,196 INFO L485 AbstractCegarLoop]: Abstraction has has 365 places, 678 transitions, 5871 flow [2025-04-29 11:09:16,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 105.26666666666667) internal successors, (4737), 45 states have internal predecessors, (4737), 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:16,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:16,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:09:16,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-29 11:09:16,398 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:16,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:16,399 INFO L85 PathProgramCache]: Analyzing trace with hash 335773084, now seen corresponding path program 2 times [2025-04-29 11:09:16,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:16,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493870321] [2025-04-29 11:09:16,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:16,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:16,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-04-29 11:09:16,475 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 180 of 180 statements. [2025-04-29 11:09:16,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:09:16,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:17,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:17,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493870321] [2025-04-29 11:09:17,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493870321] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:17,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768244081] [2025-04-29 11:09:17,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:17,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:17,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:17,491 INFO L229 MonitoredProcess]: Starting monitored process 4 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:09:17,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:09:17,648 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-04-29 11:09:18,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 180 of 180 statements. [2025-04-29 11:09:18,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:09:18,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:18,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-29 11:09:18,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:18,666 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:09:18,805 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-04-29 11:09:18,847 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:09:18,847 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:09:19,005 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 16 treesize of output 11 [2025-04-29 11:09:19,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 16 treesize of output 11 [2025-04-29 11:09:19,124 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 16 treesize of output 11 [2025-04-29 11:09:19,369 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-04-29 11:09:19,371 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-04-29 11:09:19,415 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-04-29 11:09:19,440 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 19 treesize of output 18 [2025-04-29 11:09:19,474 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:19,474 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-04-29 11:09:19,502 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:19,502 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-04-29 11:09:19,532 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:19,532 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-04-29 11:09:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:19,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:19,968 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2025-04-29 11:09:19,970 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2025-04-29 11:09:20,047 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_2743 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| c_~B~0.base v_ArrVal_2743) c_~A~0.base) .cse0) (+ 4 c_~B~0.offset)))) (forall ((v_ArrVal_2743 (Array Int Int))) (not (= (+ 5 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| c_~B~0.base v_ArrVal_2743) c_~A~0.base) .cse0)))))) is different from false [2025-04-29 11:09:20,085 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_2743 (Array Int Int)) (v_ArrVal_2742 (Array Int Int))) (not (= (+ 4 c_~B~0.offset) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2742) c_~B~0.base v_ArrVal_2743) c_~A~0.base) .cse0)))) (forall ((v_ArrVal_2743 (Array Int Int)) (v_ArrVal_2742 (Array Int Int))) (not (= (+ 5 c_~B~0.offset) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2742) c_~B~0.base v_ArrVal_2743) c_~A~0.base) .cse0)))))) is different from false [2025-04-29 11:09:20,128 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_2743 (Array Int Int)) (v_ArrVal_2742 (Array Int Int))) (not (= (+ 5 c_~B~0.offset) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2742) c_~B~0.base v_ArrVal_2743) c_~A~0.base) .cse0)))) (forall ((v_ArrVal_2743 (Array Int Int)) (v_ArrVal_2742 (Array Int Int))) (not (= (+ 4 c_~B~0.offset) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2742) c_~B~0.base v_ArrVal_2743) c_~A~0.base) .cse0)))))) is different from false [2025-04-29 11:09:20,160 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_2743 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~malloc18#1.offset| 4) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_2743) c_~A~0.base) .cse0)))) (forall ((v_ArrVal_2743 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~malloc18#1.offset| 5) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_2743) c_~A~0.base) .cse0)))))) is different from false [2025-04-29 11:09:20,252 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:20,252 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2025-04-29 11:09:20,254 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-04-29 11:09:20,256 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-04-29 11:09:20,264 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:20,264 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2025-04-29 11:09:20,265 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:20,266 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-04-29 11:09:20,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:20,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768244081] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:20,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:20,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 47 [2025-04-29 11:09:20,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698211748] [2025-04-29 11:09:20,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:20,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-29 11:09:20,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:20,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-29 11:09:20,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1712, Unknown=4, NotChecked=348, Total=2256 [2025-04-29 11:09:20,749 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 268 [2025-04-29 11:09:20,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 678 transitions, 5871 flow. Second operand has 48 states, 48 states have (on average 105.58333333333333) internal successors, (5068), 48 states have internal predecessors, (5068), 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:20,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:20,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 268 [2025-04-29 11:09:20,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:24,316 INFO L116 PetriNetUnfolderBase]: 3471/9706 cut-off events. [2025-04-29 11:09:24,317 INFO L117 PetriNetUnfolderBase]: For 28230/28265 co-relation queries the response was YES. [2025-04-29 11:09:24,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36600 conditions, 9706 events. 3471/9706 cut-off events. For 28230/28265 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 84309 event pairs, 522 based on Foata normal form. 17/9616 useless extension candidates. Maximal degree in co-relation 36463. Up to 1470 conditions per place. [2025-04-29 11:09:24,363 INFO L140 encePairwiseOnDemand]: 234/268 looper letters, 877 selfloop transitions, 206 changer transitions 19/1191 dead transitions. [2025-04-29 11:09:24,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 1191 transitions, 11893 flow [2025-04-29 11:09:24,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:09:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-29 11:09:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3449 transitions. [2025-04-29 11:09:24,365 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42898009950248756 [2025-04-29 11:09:24,365 INFO L175 Difference]: Start difference. First operand has 365 places, 678 transitions, 5871 flow. Second operand 30 states and 3449 transitions. [2025-04-29 11:09:24,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 1191 transitions, 11893 flow [2025-04-29 11:09:24,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 1191 transitions, 11825 flow, removed 20 selfloop flow, removed 12 redundant places. [2025-04-29 11:09:24,496 INFO L231 Difference]: Finished difference. Result has 396 places, 770 transitions, 7506 flow [2025-04-29 11:09:24,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=5829, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=7506, PETRI_PLACES=396, PETRI_TRANSITIONS=770} [2025-04-29 11:09:24,496 INFO L279 CegarLoopForPetriNet]: 271 programPoint places, 125 predicate places. [2025-04-29 11:09:24,497 INFO L485 AbstractCegarLoop]: Abstraction has has 396 places, 770 transitions, 7506 flow [2025-04-29 11:09:24,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 105.58333333333333) internal successors, (5068), 48 states have internal predecessors, (5068), 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:24,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:24,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:09:24,699 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:24,699 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:24,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:24,700 INFO L85 PathProgramCache]: Analyzing trace with hash -146686016, now seen corresponding path program 3 times [2025-04-29 11:09:24,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:24,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885770320] [2025-04-29 11:09:24,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:09:24,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:24,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 180 statements into 5 equivalence classes. [2025-04-29 11:09:24,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 179 of 180 statements. [2025-04-29 11:09:24,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 11:09:24,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:32,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:32,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885770320] [2025-04-29 11:09:32,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885770320] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:32,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343340716] [2025-04-29 11:09:32,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:09:32,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:32,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:32,230 INFO L229 MonitoredProcess]: Starting monitored process 5 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:09:32,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:09:32,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 180 statements into 5 equivalence classes. [2025-04-29 11:09:36,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 179 of 180 statements. [2025-04-29 11:09:36,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 11:09:36,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:36,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-04-29 11:09:36,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:36,932 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:09:37,023 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2025-04-29 11:09:37,085 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:09:37,085 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:09:37,265 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 16 treesize of output 11 [2025-04-29 11:09:37,318 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 16 treesize of output 11 [2025-04-29 11:09:37,384 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 19 treesize of output 18 [2025-04-29 11:09:37,668 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:09:37,705 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-29 11:09:37,749 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-04-29 11:09:37,828 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 11:09:37,868 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 30 treesize of output 21 [2025-04-29 11:09:37,879 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 30 treesize of output 21 [2025-04-29 11:09:37,888 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 30 treesize of output 21 [2025-04-29 11:09:37,898 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 30 treesize of output 21 [2025-04-29 11:09:37,944 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:37,945 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-04-29 11:09:37,985 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:37,985 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2025-04-29 11:09:38,031 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:38,032 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 51 [2025-04-29 11:09:38,048 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:38,048 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 51 [2025-04-29 11:09:38,077 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:38,077 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 58 [2025-04-29 11:09:38,163 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:38,163 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 58 treesize of output 54 [2025-04-29 11:09:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:38,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:39,299 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_t_funThread1of1ForFork0_#t~mem3.offset| 3)) (.cse3 (+ 7 c_~B~0.offset))) (and (forall ((|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3123 Int) (v_ArrVal_3120 Int)) (= (select (select (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_3114))) (let ((.cse2 (store .cse0 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (select .cse0 |t_funThread1of1ForFork0_#t~mem3.base|) |c_t_funThread1of1ForFork0_#t~mem3.offset| 0) .cse4 v_ArrVal_3120)))) (let ((.cse1 (store (select .cse2 c_~B~0.base) .cse3 0))) (store (store .cse0 c_~B~0.base .cse1) |t_funThread1of1ForFork0_#t~mem3.base| (store (select (store .cse2 c_~B~0.base .cse1) |t_funThread1of1ForFork0_#t~mem3.base|) |c_t_funThread1of1ForFork0_#t~mem3.offset| v_ArrVal_3123))))) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3123 Int) (v_ArrVal_3120 Int)) (= (select (select (let ((.cse5 (store |c_#race| c_~A~0.base v_ArrVal_3114))) (let ((.cse7 (store .cse5 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (select .cse5 |t_funThread1of1ForFork0_#t~mem3.base|) |c_t_funThread1of1ForFork0_#t~mem3.offset| 0) .cse4 v_ArrVal_3120)))) (let ((.cse6 (store (select .cse7 c_~B~0.base) .cse3 0))) (store (store .cse5 c_~B~0.base .cse6) |t_funThread1of1ForFork0_#t~mem3.base| (store (select (store .cse7 c_~B~0.base .cse6) |t_funThread1of1ForFork0_#t~mem3.base|) |c_t_funThread1of1ForFork0_#t~mem3.offset| v_ArrVal_3123))))) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3123 Int) (v_ArrVal_3120 Int)) (= (select (select (let ((.cse8 (store |c_#race| c_~A~0.base v_ArrVal_3114))) (let ((.cse10 (store .cse8 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (select .cse8 |t_funThread1of1ForFork0_#t~mem3.base|) |c_t_funThread1of1ForFork0_#t~mem3.offset| 0) .cse4 v_ArrVal_3120)))) (let ((.cse9 (store (select .cse10 c_~B~0.base) .cse3 0))) (store (store .cse8 c_~B~0.base .cse9) |t_funThread1of1ForFork0_#t~mem3.base| (store (select (store .cse10 c_~B~0.base .cse9) |t_funThread1of1ForFork0_#t~mem3.base|) |c_t_funThread1of1ForFork0_#t~mem3.offset| v_ArrVal_3123))))) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3123 Int) (v_ArrVal_3120 Int)) (= (select (select (let ((.cse11 (store |c_#race| c_~A~0.base v_ArrVal_3114))) (let ((.cse13 (store .cse11 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (select .cse11 |t_funThread1of1ForFork0_#t~mem3.base|) |c_t_funThread1of1ForFork0_#t~mem3.offset| 0) .cse4 v_ArrVal_3120)))) (let ((.cse12 (store (select .cse13 c_~B~0.base) .cse3 0))) (store (store .cse11 c_~B~0.base .cse12) |t_funThread1of1ForFork0_#t~mem3.base| (store (select (store .cse13 c_~B~0.base .cse12) |t_funThread1of1ForFork0_#t~mem3.base|) |c_t_funThread1of1ForFork0_#t~mem3.offset| v_ArrVal_3123))))) c_~B~0.base) .cse3) 0)))) is different from false [2025-04-29 11:09:39,369 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| c_~A~0.base) (+ c_~A~0.offset 4)))) (let ((.cse4 (+ 7 c_~B~0.offset)) (.cse5 (+ 3 .cse3))) (and (forall ((|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3123 Int) (v_ArrVal_3120 Int)) (= (select (select (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_3114))) (let ((.cse2 (store .cse0 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (select .cse0 |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 0) .cse5 v_ArrVal_3120)))) (let ((.cse1 (store (select .cse2 c_~B~0.base) .cse4 0))) (store (store .cse0 c_~B~0.base .cse1) |t_funThread1of1ForFork0_#t~mem3.base| (store (select (store .cse2 c_~B~0.base .cse1) |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 v_ArrVal_3123))))) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3123 Int) (v_ArrVal_3120 Int)) (= (select (select (let ((.cse6 (store |c_#race| c_~A~0.base v_ArrVal_3114))) (let ((.cse8 (store .cse6 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (select .cse6 |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 0) .cse5 v_ArrVal_3120)))) (let ((.cse7 (store (select .cse8 c_~B~0.base) .cse4 0))) (store (store .cse6 c_~B~0.base .cse7) |t_funThread1of1ForFork0_#t~mem3.base| (store (select (store .cse8 c_~B~0.base .cse7) |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 v_ArrVal_3123))))) c_~B~0.base) .cse4) 0)) (forall ((|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3123 Int) (v_ArrVal_3120 Int)) (= (select (select (let ((.cse9 (store |c_#race| c_~A~0.base v_ArrVal_3114))) (let ((.cse11 (store .cse9 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (select .cse9 |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 0) .cse5 v_ArrVal_3120)))) (let ((.cse10 (store (select .cse11 c_~B~0.base) .cse4 0))) (store (store .cse9 c_~B~0.base .cse10) |t_funThread1of1ForFork0_#t~mem3.base| (store (select (store .cse11 c_~B~0.base .cse10) |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 v_ArrVal_3123))))) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3123 Int) (v_ArrVal_3120 Int)) (= (select (select (let ((.cse12 (store |c_#race| c_~A~0.base v_ArrVal_3114))) (let ((.cse14 (store .cse12 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (select .cse12 |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 0) .cse5 v_ArrVal_3120)))) (let ((.cse13 (store (select .cse14 c_~B~0.base) .cse4 0))) (store (store .cse12 c_~B~0.base .cse13) |t_funThread1of1ForFork0_#t~mem3.base| (store (select (store .cse14 c_~B~0.base .cse13) |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 v_ArrVal_3123))))) c_~B~0.base) (+ 6 c_~B~0.offset)) 0))))) is different from false [2025-04-29 11:09:39,461 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 6 c_~B~0.offset)) (.cse3 (select (select |c_#memory_$Pointer$.offset| c_~A~0.base) (+ c_~A~0.offset 4)))) (let ((.cse5 (+ 7 c_~B~0.offset)) (.cse6 (+ 3 .cse3)) (.cse7 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse16 0)))) (and (forall ((|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3123 Int) (v_ArrVal_3120 Int)) (= (select (select (let ((.cse4 (store .cse7 c_~A~0.base v_ArrVal_3114))) (let ((.cse2 (store (store (select .cse4 |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 0) .cse6 v_ArrVal_3120))) (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_3114)) (.cse1 (store (select (store .cse4 |t_funThread1of1ForFork0_#t~mem3.base| .cse2) c_~B~0.base) .cse5 0))) (store (store .cse0 c_~B~0.base .cse1) |t_funThread1of1ForFork0_#t~mem3.base| (store (select (store (store .cse0 |t_funThread1of1ForFork0_#t~mem3.base| .cse2) c_~B~0.base .cse1) |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 v_ArrVal_3123))))) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3123 Int) (v_ArrVal_3120 Int)) (= 0 (select (select (let ((.cse11 (store .cse7 c_~A~0.base v_ArrVal_3114))) (let ((.cse10 (store (store (select .cse11 |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 0) .cse6 v_ArrVal_3120))) (let ((.cse8 (store |c_#race| c_~A~0.base v_ArrVal_3114)) (.cse9 (store (select (store .cse11 |t_funThread1of1ForFork0_#t~mem3.base| .cse10) c_~B~0.base) .cse5 0))) (store (store .cse8 c_~B~0.base .cse9) |t_funThread1of1ForFork0_#t~mem3.base| (store (select (store (store .cse8 |t_funThread1of1ForFork0_#t~mem3.base| .cse10) c_~B~0.base .cse9) |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 v_ArrVal_3123))))) c_~B~0.base) .cse5))) (forall ((|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3123 Int) (v_ArrVal_3120 Int)) (= (select (select (let ((.cse15 (store .cse7 c_~A~0.base v_ArrVal_3114))) (let ((.cse14 (store (store (select .cse15 |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 0) .cse6 v_ArrVal_3120))) (let ((.cse12 (store |c_#race| c_~A~0.base v_ArrVal_3114)) (.cse13 (store (select (store .cse15 |t_funThread1of1ForFork0_#t~mem3.base| .cse14) c_~B~0.base) .cse5 0))) (store (store .cse12 c_~B~0.base .cse13) |t_funThread1of1ForFork0_#t~mem3.base| (store (select (store (store .cse12 |t_funThread1of1ForFork0_#t~mem3.base| .cse14) c_~B~0.base .cse13) |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 v_ArrVal_3123))))) c_~B~0.base) .cse16) 0)) (forall ((|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3123 Int) (v_ArrVal_3120 Int)) (= (select (select (let ((.cse20 (store .cse7 c_~A~0.base v_ArrVal_3114))) (let ((.cse19 (store (store (select .cse20 |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 0) .cse6 v_ArrVal_3120))) (let ((.cse17 (store |c_#race| c_~A~0.base v_ArrVal_3114)) (.cse18 (store (select (store .cse20 |t_funThread1of1ForFork0_#t~mem3.base| .cse19) c_~B~0.base) .cse5 0))) (store (store .cse17 c_~B~0.base .cse18) |t_funThread1of1ForFork0_#t~mem3.base| (store (select (store (store .cse17 |t_funThread1of1ForFork0_#t~mem3.base| .cse19) c_~B~0.base .cse18) |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 v_ArrVal_3123))))) c_~B~0.base) (+ 5 c_~B~0.offset)) 0))))) is different from false [2025-04-29 11:09:39,491 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 5 c_~B~0.offset)) (.cse17 (+ 6 c_~B~0.offset)) (.cse3 (select (select |c_#memory_$Pointer$.offset| c_~A~0.base) (+ c_~A~0.offset 4)))) (let ((.cse6 (+ 3 .cse3)) (.cse7 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse8 0) .cse17 0))) (.cse5 (+ 7 c_~B~0.offset))) (and (forall ((|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3123 Int) (v_ArrVal_3120 Int)) (= (select (select (let ((.cse4 (store .cse7 c_~A~0.base v_ArrVal_3114))) (let ((.cse2 (store (store (select .cse4 |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 0) .cse6 v_ArrVal_3120))) (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_3114)) (.cse1 (store (select (store .cse4 |t_funThread1of1ForFork0_#t~mem3.base| .cse2) c_~B~0.base) .cse5 0))) (store (store .cse0 c_~B~0.base .cse1) |t_funThread1of1ForFork0_#t~mem3.base| (store (select (store (store .cse0 |t_funThread1of1ForFork0_#t~mem3.base| .cse2) c_~B~0.base .cse1) |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 v_ArrVal_3123))))) c_~B~0.base) .cse8) 0)) (forall ((|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3123 Int) (v_ArrVal_3120 Int)) (= (select (select (let ((.cse12 (store .cse7 c_~A~0.base v_ArrVal_3114))) (let ((.cse11 (store (store (select .cse12 |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 0) .cse6 v_ArrVal_3120))) (let ((.cse9 (store |c_#race| c_~A~0.base v_ArrVal_3114)) (.cse10 (store (select (store .cse12 |t_funThread1of1ForFork0_#t~mem3.base| .cse11) c_~B~0.base) .cse5 0))) (store (store .cse9 c_~B~0.base .cse10) |t_funThread1of1ForFork0_#t~mem3.base| (store (select (store (store .cse9 |t_funThread1of1ForFork0_#t~mem3.base| .cse11) c_~B~0.base .cse10) |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 v_ArrVal_3123))))) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3123 Int) (v_ArrVal_3120 Int)) (= (select (select (let ((.cse16 (store .cse7 c_~A~0.base v_ArrVal_3114))) (let ((.cse15 (store (store (select .cse16 |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 0) .cse6 v_ArrVal_3120))) (let ((.cse13 (store |c_#race| c_~A~0.base v_ArrVal_3114)) (.cse14 (store (select (store .cse16 |t_funThread1of1ForFork0_#t~mem3.base| .cse15) c_~B~0.base) .cse5 0))) (store (store .cse13 c_~B~0.base .cse14) |t_funThread1of1ForFork0_#t~mem3.base| (store (select (store (store .cse13 |t_funThread1of1ForFork0_#t~mem3.base| .cse15) c_~B~0.base .cse14) |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 v_ArrVal_3123))))) c_~B~0.base) .cse17) 0)) (forall ((|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_3114 (Array Int Int)) (v_ArrVal_3123 Int) (v_ArrVal_3120 Int)) (= (select (select (let ((.cse21 (store .cse7 c_~A~0.base v_ArrVal_3114))) (let ((.cse20 (store (store (select .cse21 |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 0) .cse6 v_ArrVal_3120))) (let ((.cse18 (store |c_#race| c_~A~0.base v_ArrVal_3114)) (.cse19 (store (select (store .cse21 |t_funThread1of1ForFork0_#t~mem3.base| .cse20) c_~B~0.base) .cse5 0))) (store (store .cse18 c_~B~0.base .cse19) |t_funThread1of1ForFork0_#t~mem3.base| (store (select (store (store .cse18 |t_funThread1of1ForFork0_#t~mem3.base| .cse20) c_~B~0.base .cse19) |t_funThread1of1ForFork0_#t~mem3.base|) .cse3 v_ArrVal_3123))))) c_~B~0.base) .cse5) 0))))) is different from false [2025-04-29 11:09:39,511 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:39,512 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 176 [2025-04-29 11:09:39,520 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:39,521 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 544 treesize of output 530 [2025-04-29 11:09:39,530 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 566 treesize of output 542 [2025-04-29 11:09:39,543 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-29 11:09:39,560 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:39,560 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 614 treesize of output 586 [2025-04-29 11:09:39,662 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:39,672 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:39,672 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 176 [2025-04-29 11:09:39,674 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:39,682 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:09:39,682 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 286 treesize of output 272 [2025-04-29 11:09:39,694 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 218 [2025-04-29 11:09:39,699 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:39,706 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:39,706 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 135 [2025-04-29 11:09:39,708 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:39,709 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 65 treesize of output 57 [2025-04-29 11:09:39,714 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2025-04-29 11:09:39,717 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:39,729 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:39,729 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 176 [2025-04-29 11:09:39,731 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:39,738 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:09:39,738 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 286 treesize of output 272 [2025-04-29 11:09:39,746 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 102 [2025-04-29 11:09:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:42,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343340716] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:42,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:42,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 19] total 60 [2025-04-29 11:09:42,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899155544] [2025-04-29 11:09:42,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:42,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-04-29 11:09:42,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:42,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-04-29 11:09:42,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2947, Unknown=8, NotChecked=452, Total=3660 [2025-04-29 11:09:42,035 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 268 [2025-04-29 11:09:42,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 770 transitions, 7506 flow. Second operand has 61 states, 61 states have (on average 103.88524590163935) internal successors, (6337), 61 states have internal predecessors, (6337), 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:42,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:42,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 268 [2025-04-29 11:09:42,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15