./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_04-list2_nr.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_04-list2_nr.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 6b660f04f83becd21e4ff512c323a1198b0ce2547661a7b848e55ab597e13bce --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:08:45,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:08:45,091 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:45,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:08:45,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:08:45,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:08:45,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:08:45,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:08:45,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:08:45,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:08:45,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:08:45,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:08:45,125 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:08:45,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:08:45,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:08:45,126 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:08:45,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:08:45,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:08:45,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:08:45,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:08:45,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:08:45,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:08:45,127 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:08:45,127 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:08:45,127 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:08:45,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:08:45,127 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:08:45,127 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:08:45,127 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:08:45,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:45,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:45,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:45,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:08:45,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:45,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:45,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:45,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:08:45,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:08:45,128 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:08:45,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:08:45,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:08:45,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:08:45,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:08:45,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:08:45,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:08:45,129 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 -> 6b660f04f83becd21e4ff512c323a1198b0ce2547661a7b848e55ab597e13bce [2025-04-29 11:08:45,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:08:45,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:08:45,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:08:45,369 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:08:45,369 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:08:45,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_04-list2_nr.c [2025-04-29 11:08:46,697 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82921d4a2/44d030a661f94bd1ac8ce5ec7013fa76/FLAGfb75bfbde [2025-04-29 11:08:46,894 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:08:46,899 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_04-list2_nr.c [2025-04-29 11:08:46,901 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,902 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,902 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,907 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82921d4a2/44d030a661f94bd1ac8ce5ec7013fa76/FLAGfb75bfbde [2025-04-29 11:08:47,697 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82921d4a2/44d030a661f94bd1ac8ce5ec7013fa76 [2025-04-29 11:08:47,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:08:47,699 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:08:47,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:47,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:08:47,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:08:47,703 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,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e00b44d 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,705 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,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:08:47,861 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:47,871 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:08:47,893 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:47,905 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:08:47,905 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,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:47,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:47,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:08:47,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:08:47,910 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,921 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,948 INFO L138 Inliner]: procedures = 15, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 191 [2025-04-29 11:08:47,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:47,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:08:47,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:08:47,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:08:47,958 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,958 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,962 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,962 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,978 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,979 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,979 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,980 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,981 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,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:08:47,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:08:47,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:08:47,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:08:47,993 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:48,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:48,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:48,020 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:48,023 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:48,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-29 11:08:48,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:08:48,038 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:08:48,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:08:48,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-29 11:08:48,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:08:48,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:08:48,038 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:08:48,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:08:48,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:08:48,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:08:48,038 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:08:48,038 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:08:48,039 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:48,105 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:08:48,106 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:08:48,478 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:08:48,478 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:08:48,505 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:08:48,505 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:08:48,506 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,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:08:48,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:08:48,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:08:48,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:08:48,511 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,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75dbb840 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,511 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,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75dbb840 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,511 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,512 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.c [2025-04-29 11:08:48,524 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:08:48,525 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_04-list2_nr.c that has 2 procedures, 296 locations, 294 edges, 1 initial locations, 0 loop locations, and 30 error locations. [2025-04-29 11:08:48,525 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:08:48,598 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:08:48,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 295 transitions, 594 flow [2025-04-29 11:08:48,743 INFO L116 PetriNetUnfolderBase]: 0/294 cut-off events. [2025-04-29 11:08:48,745 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:48,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 294 events. 0/294 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 163 event pairs, 0 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-29 11:08:48,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 299 places, 295 transitions, 594 flow [2025-04-29 11:08:48,754 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 298 places, 294 transitions, 591 flow [2025-04-29 11:08:48,760 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:08:48,769 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;@3138c5ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:08:48,769 INFO L341 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-04-29 11:08:48,774 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:08:48,774 INFO L116 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-04-29 11:08:48,774 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:48,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:48,775 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,775 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:08:48,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:48,780 INFO L85 PathProgramCache]: Analyzing trace with hash 612392565, now seen corresponding path program 1 times [2025-04-29 11:08:48,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:48,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600421898] [2025-04-29 11:08:48,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:48,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:48,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:08:48,870 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,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:48,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:49,355 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,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:49,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600421898] [2025-04-29 11:08:49,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600421898] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:49,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:49,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:49,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154858536] [2025-04-29 11:08:49,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:49,364 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:49,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:49,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:49,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:49,932 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 295 [2025-04-29 11:08:49,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 294 transitions, 591 flow. Second operand has 6 states, 6 states have (on average 195.33333333333334) internal successors, (1172), 6 states have internal predecessors, (1172), 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,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:49,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 295 [2025-04-29 11:08:49,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:50,431 INFO L116 PetriNetUnfolderBase]: 560/2346 cut-off events. [2025-04-29 11:08:50,431 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:50,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3568 conditions, 2346 events. 560/2346 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14848 event pairs, 560 based on Foata normal form. 0/2136 useless extension candidates. Maximal degree in co-relation 3353. Up to 1198 conditions per place. [2025-04-29 11:08:50,451 INFO L140 encePairwiseOnDemand]: 271/295 looper letters, 77 selfloop transitions, 20 changer transitions 0/290 dead transitions. [2025-04-29 11:08:50,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 290 transitions, 777 flow [2025-04-29 11:08:50,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1265 transitions. [2025-04-29 11:08:50,466 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7146892655367232 [2025-04-29 11:08:50,467 INFO L175 Difference]: Start difference. First operand has 298 places, 294 transitions, 591 flow. Second operand 6 states and 1265 transitions. [2025-04-29 11:08:50,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 290 transitions, 777 flow [2025-04-29 11:08:50,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 290 transitions, 776 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:50,477 INFO L231 Difference]: Finished difference. Result has 298 places, 290 transitions, 622 flow [2025-04-29 11:08:50,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=622, PETRI_PLACES=298, PETRI_TRANSITIONS=290} [2025-04-29 11:08:50,481 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 0 predicate places. [2025-04-29 11:08:50,482 INFO L485 AbstractCegarLoop]: Abstraction has has 298 places, 290 transitions, 622 flow [2025-04-29 11:08:50,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.33333333333334) internal successors, (1172), 6 states have internal predecessors, (1172), 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,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:50,483 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,483 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:08:50,483 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:08:50,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:50,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1337185444, now seen corresponding path program 1 times [2025-04-29 11:08:50,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:50,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233215715] [2025-04-29 11:08:50,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:50,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:50,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:08:50,500 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,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:50,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:50,800 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,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:50,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233215715] [2025-04-29 11:08:50,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233215715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:50,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:50,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:50,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441187642] [2025-04-29 11:08:50,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:50,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:50,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:50,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:50,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:51,305 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 295 [2025-04-29 11:08:51,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 290 transitions, 622 flow. Second operand has 6 states, 6 states have (on average 195.33333333333334) internal successors, (1172), 6 states have internal predecessors, (1172), 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,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:51,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 295 [2025-04-29 11:08:51,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:51,561 INFO L116 PetriNetUnfolderBase]: 560/2342 cut-off events. [2025-04-29 11:08:51,563 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:51,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3584 conditions, 2342 events. 560/2342 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14894 event pairs, 560 based on Foata normal form. 0/2136 useless extension candidates. Maximal degree in co-relation 3394. Up to 1198 conditions per place. [2025-04-29 11:08:51,574 INFO L140 encePairwiseOnDemand]: 271/295 looper letters, 77 selfloop transitions, 20 changer transitions 0/286 dead transitions. [2025-04-29 11:08:51,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 286 transitions, 808 flow [2025-04-29 11:08:51,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1265 transitions. [2025-04-29 11:08:51,579 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7146892655367232 [2025-04-29 11:08:51,579 INFO L175 Difference]: Start difference. First operand has 298 places, 290 transitions, 622 flow. Second operand 6 states and 1265 transitions. [2025-04-29 11:08:51,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 286 transitions, 808 flow [2025-04-29 11:08:51,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 286 transitions, 768 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:51,585 INFO L231 Difference]: Finished difference. Result has 294 places, 286 transitions, 614 flow [2025-04-29 11:08:51,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=614, PETRI_PLACES=294, PETRI_TRANSITIONS=286} [2025-04-29 11:08:51,588 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, -4 predicate places. [2025-04-29 11:08:51,588 INFO L485 AbstractCegarLoop]: Abstraction has has 294 places, 286 transitions, 614 flow [2025-04-29 11:08:51,588 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.33333333333334) internal successors, (1172), 6 states have internal predecessors, (1172), 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,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:51,588 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,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:08:51,589 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:08:51,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:51,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1998640424, now seen corresponding path program 1 times [2025-04-29 11:08:51,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:51,590 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509035024] [2025-04-29 11:08:51,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:51,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:51,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:08:51,610 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,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:51,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:51,630 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,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:51,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509035024] [2025-04-29 11:08:51,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509035024] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:51,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:51,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:08:51,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773912151] [2025-04-29 11:08:51,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:51,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:51,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:51,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:51,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:51,653 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 295 [2025-04-29 11:08:51,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 286 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:51,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 295 [2025-04-29 11:08:51,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:51,726 INFO L116 PetriNetUnfolderBase]: 30/735 cut-off events. [2025-04-29 11:08:51,726 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:51,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 735 events. 30/735 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2633 event pairs, 30 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 671. Up to 78 conditions per place. [2025-04-29 11:08:51,729 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 17 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-04-29 11:08:51,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 285 transitions, 650 flow [2025-04-29 11:08:51,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:51,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 845 transitions. [2025-04-29 11:08:51,732 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9548022598870056 [2025-04-29 11:08:51,732 INFO L175 Difference]: Start difference. First operand has 294 places, 286 transitions, 614 flow. Second operand 3 states and 845 transitions. [2025-04-29 11:08:51,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 285 transitions, 650 flow [2025-04-29 11:08:51,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 285 transitions, 610 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:51,736 INFO L231 Difference]: Finished difference. Result has 290 places, 285 transitions, 576 flow [2025-04-29 11:08:51,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=290, PETRI_TRANSITIONS=285} [2025-04-29 11:08:51,737 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, -8 predicate places. [2025-04-29 11:08:51,737 INFO L485 AbstractCegarLoop]: Abstraction has has 290 places, 285 transitions, 576 flow [2025-04-29 11:08:51,737 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:51,737 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,737 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:08:51,737 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:08:51,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:51,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1575843169, now seen corresponding path program 1 times [2025-04-29 11:08:51,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:51,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782525963] [2025-04-29 11:08:51,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:51,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:51,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-29 11:08:51,755 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,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:51,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:51,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:51,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782525963] [2025-04-29 11:08:51,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782525963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:51,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:51,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:08:51,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859246145] [2025-04-29 11:08:51,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:51,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:51,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:51,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:51,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:51,786 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 295 [2025-04-29 11:08:51,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 285 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:51,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 295 [2025-04-29 11:08:51,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:51,851 INFO L116 PetriNetUnfolderBase]: 36/767 cut-off events. [2025-04-29 11:08:51,851 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:51,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 767 events. 36/767 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2985 event pairs, 36 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 813. Up to 89 conditions per place. [2025-04-29 11:08:51,854 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 17 selfloop transitions, 1 changer transitions 0/281 dead transitions. [2025-04-29 11:08:51,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 281 transitions, 604 flow [2025-04-29 11:08:51,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 841 transitions. [2025-04-29 11:08:51,856 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9502824858757062 [2025-04-29 11:08:51,856 INFO L175 Difference]: Start difference. First operand has 290 places, 285 transitions, 576 flow. Second operand 3 states and 841 transitions. [2025-04-29 11:08:51,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 281 transitions, 604 flow [2025-04-29 11:08:51,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 281 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:51,860 INFO L231 Difference]: Finished difference. Result has 286 places, 281 transitions, 566 flow [2025-04-29 11:08:51,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=286, PETRI_TRANSITIONS=281} [2025-04-29 11:08:51,861 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, -12 predicate places. [2025-04-29 11:08:51,862 INFO L485 AbstractCegarLoop]: Abstraction has has 286 places, 281 transitions, 566 flow [2025-04-29 11:08:51,862 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:51,862 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,862 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:08:51,863 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:08:51,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:51,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1037786260, now seen corresponding path program 1 times [2025-04-29 11:08:51,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:51,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341498927] [2025-04-29 11:08:51,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:51,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:51,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-04-29 11:08:51,895 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,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:51,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:52,232 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,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:52,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341498927] [2025-04-29 11:08:52,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341498927] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:52,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:52,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:52,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108038859] [2025-04-29 11:08:52,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:52,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:52,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:52,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:52,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:52,469 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 295 [2025-04-29 11:08:52,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 281 transitions, 566 flow. Second operand has 6 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 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,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:52,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 295 [2025-04-29 11:08:52,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:52,720 INFO L116 PetriNetUnfolderBase]: 638/2536 cut-off events. [2025-04-29 11:08:52,721 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:52,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3916 conditions, 2536 events. 638/2536 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 16244 event pairs, 638 based on Foata normal form. 0/2335 useless extension candidates. Maximal degree in co-relation 3855. Up to 1370 conditions per place. [2025-04-29 11:08:52,729 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 93 selfloop transitions, 5 changer transitions 0/280 dead transitions. [2025-04-29 11:08:52,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 280 transitions, 760 flow [2025-04-29 11:08:52,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1275 transitions. [2025-04-29 11:08:52,734 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7203389830508474 [2025-04-29 11:08:52,734 INFO L175 Difference]: Start difference. First operand has 286 places, 281 transitions, 566 flow. Second operand 6 states and 1275 transitions. [2025-04-29 11:08:52,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 280 transitions, 760 flow [2025-04-29 11:08:52,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 280 transitions, 759 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:52,739 INFO L231 Difference]: Finished difference. Result has 289 places, 280 transitions, 573 flow [2025-04-29 11:08:52,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=573, PETRI_PLACES=289, PETRI_TRANSITIONS=280} [2025-04-29 11:08:52,741 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, -9 predicate places. [2025-04-29 11:08:52,741 INFO L485 AbstractCegarLoop]: Abstraction has has 289 places, 280 transitions, 573 flow [2025-04-29 11:08:52,742 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.16666666666666) internal successors, (1201), 6 states have internal predecessors, (1201), 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,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:52,743 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,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:08:52,744 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:08:52,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:52,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1608051613, now seen corresponding path program 1 times [2025-04-29 11:08:52,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:52,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514986768] [2025-04-29 11:08:52,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:52,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:52,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-29 11:08:52,771 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,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:52,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:52,812 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,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:52,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514986768] [2025-04-29 11:08:52,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514986768] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:52,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:52,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:08:52,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425906799] [2025-04-29 11:08:52,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:52,812 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:52,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:52,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:52,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:52,833 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 295 [2025-04-29 11:08:52,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 280 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:52,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 295 [2025-04-29 11:08:52,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:52,897 INFO L116 PetriNetUnfolderBase]: 30/723 cut-off events. [2025-04-29 11:08:52,898 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:52,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 723 events. 30/723 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2654 event pairs, 30 based on Foata normal form. 0/663 useless extension candidates. Maximal degree in co-relation 762. Up to 78 conditions per place. [2025-04-29 11:08:52,900 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 17 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2025-04-29 11:08:52,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 279 transitions, 609 flow [2025-04-29 11:08:52,901 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 845 transitions. [2025-04-29 11:08:52,902 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9548022598870056 [2025-04-29 11:08:52,902 INFO L175 Difference]: Start difference. First operand has 289 places, 280 transitions, 573 flow. Second operand 3 states and 845 transitions. [2025-04-29 11:08:52,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 279 transitions, 609 flow [2025-04-29 11:08:52,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 279 transitions, 599 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:52,905 INFO L231 Difference]: Finished difference. Result has 285 places, 279 transitions, 565 flow [2025-04-29 11:08:52,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=565, PETRI_PLACES=285, PETRI_TRANSITIONS=279} [2025-04-29 11:08:52,906 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, -13 predicate places. [2025-04-29 11:08:52,907 INFO L485 AbstractCegarLoop]: Abstraction has has 285 places, 279 transitions, 565 flow [2025-04-29 11:08:52,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:52,908 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,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:08:52,908 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:08:52,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:52,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1389593142, now seen corresponding path program 1 times [2025-04-29 11:08:52,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:52,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379732253] [2025-04-29 11:08:52,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:52,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:52,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-29 11:08:52,933 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,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:52,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:52,959 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,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:52,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379732253] [2025-04-29 11:08:52,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379732253] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:52,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:52,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:08:52,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438270597] [2025-04-29 11:08:52,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:52,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:52,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:52,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:52,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:52,975 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 295 [2025-04-29 11:08:52,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 279 transitions, 565 flow. Second operand has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:52,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 295 [2025-04-29 11:08:52,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:53,039 INFO L116 PetriNetUnfolderBase]: 36/751 cut-off events. [2025-04-29 11:08:53,040 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:53,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 751 events. 36/751 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2897 event pairs, 36 based on Foata normal form. 0/696 useless extension candidates. Maximal degree in co-relation 799. Up to 89 conditions per place. [2025-04-29 11:08:53,043 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 17 selfloop transitions, 1 changer transitions 0/275 dead transitions. [2025-04-29 11:08:53,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 275 transitions, 593 flow [2025-04-29 11:08:53,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:53,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 841 transitions. [2025-04-29 11:08:53,045 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9502824858757062 [2025-04-29 11:08:53,045 INFO L175 Difference]: Start difference. First operand has 285 places, 279 transitions, 565 flow. Second operand 3 states and 841 transitions. [2025-04-29 11:08:53,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 275 transitions, 593 flow [2025-04-29 11:08:53,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 275 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:53,049 INFO L231 Difference]: Finished difference. Result has 281 places, 275 transitions, 555 flow [2025-04-29 11:08:53,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=555, PETRI_PLACES=281, PETRI_TRANSITIONS=275} [2025-04-29 11:08:53,049 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, -17 predicate places. [2025-04-29 11:08:53,050 INFO L485 AbstractCegarLoop]: Abstraction has has 281 places, 275 transitions, 555 flow [2025-04-29 11:08:53,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:53,051 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] [2025-04-29 11:08:53,051 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:08:53,051 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:08:53,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:53,052 INFO L85 PathProgramCache]: Analyzing trace with hash -769133589, now seen corresponding path program 1 times [2025-04-29 11:08:53,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:53,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824475019] [2025-04-29 11:08:53,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:53,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:53,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-04-29 11:08:53,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-04-29 11:08:53,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:53,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:53,499 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:53,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:53,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824475019] [2025-04-29 11:08:53,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824475019] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:53,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:53,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:53,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778016101] [2025-04-29 11:08:53,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:53,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:53,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:53,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:53,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:53,799 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 295 [2025-04-29 11:08:53,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 275 transitions, 555 flow. Second operand has 6 states, 6 states have (on average 203.5) internal successors, (1221), 6 states have internal predecessors, (1221), 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,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:53,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 295 [2025-04-29 11:08:53,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:54,199 INFO L116 PetriNetUnfolderBase]: 638/2449 cut-off events. [2025-04-29 11:08:54,199 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:54,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3830 conditions, 2449 events. 638/2449 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 15421 event pairs, 638 based on Foata normal form. 0/2304 useless extension candidates. Maximal degree in co-relation 3770. Up to 1370 conditions per place. [2025-04-29 11:08:54,208 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 93 selfloop transitions, 5 changer transitions 0/274 dead transitions. [2025-04-29 11:08:54,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 274 transitions, 749 flow [2025-04-29 11:08:54,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:54,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1275 transitions. [2025-04-29 11:08:54,211 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7203389830508474 [2025-04-29 11:08:54,212 INFO L175 Difference]: Start difference. First operand has 281 places, 275 transitions, 555 flow. Second operand 6 states and 1275 transitions. [2025-04-29 11:08:54,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 274 transitions, 749 flow [2025-04-29 11:08:54,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 274 transitions, 748 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:54,216 INFO L231 Difference]: Finished difference. Result has 284 places, 274 transitions, 562 flow [2025-04-29 11:08:54,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=562, PETRI_PLACES=284, PETRI_TRANSITIONS=274} [2025-04-29 11:08:54,217 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, -14 predicate places. [2025-04-29 11:08:54,218 INFO L485 AbstractCegarLoop]: Abstraction has has 284 places, 274 transitions, 562 flow [2025-04-29 11:08:54,218 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.5) internal successors, (1221), 6 states have internal predecessors, (1221), 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,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:54,218 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] [2025-04-29 11:08:54,219 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:08:54,219 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:08:54,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:54,219 INFO L85 PathProgramCache]: Analyzing trace with hash 127317215, now seen corresponding path program 1 times [2025-04-29 11:08:54,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:54,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642012167] [2025-04-29 11:08:54,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:54,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:54,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-04-29 11:08:54,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-04-29 11:08:54,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:54,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:54,706 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:54,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:54,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642012167] [2025-04-29 11:08:54,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642012167] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:54,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:54,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:54,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834463871] [2025-04-29 11:08:54,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:54,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:54,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:54,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:54,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:55,163 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 295 [2025-04-29 11:08:55,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 274 transitions, 562 flow. Second operand has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 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,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:55,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 295 [2025-04-29 11:08:55,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:55,428 INFO L116 PetriNetUnfolderBase]: 232/1804 cut-off events. [2025-04-29 11:08:55,429 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:55,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2370 conditions, 1804 events. 232/1804 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11401 event pairs, 20 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 2310. Up to 313 conditions per place. [2025-04-29 11:08:55,433 INFO L140 encePairwiseOnDemand]: 276/295 looper letters, 108 selfloop transitions, 38 changer transitions 0/348 dead transitions. [2025-04-29 11:08:55,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 348 transitions, 1002 flow [2025-04-29 11:08:55,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1486 transitions. [2025-04-29 11:08:55,436 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8395480225988701 [2025-04-29 11:08:55,436 INFO L175 Difference]: Start difference. First operand has 284 places, 274 transitions, 562 flow. Second operand 6 states and 1486 transitions. [2025-04-29 11:08:55,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 348 transitions, 1002 flow [2025-04-29 11:08:55,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 348 transitions, 992 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:55,443 INFO L231 Difference]: Finished difference. Result has 288 places, 310 transitions, 810 flow [2025-04-29 11:08:55,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=810, PETRI_PLACES=288, PETRI_TRANSITIONS=310} [2025-04-29 11:08:55,444 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, -10 predicate places. [2025-04-29 11:08:55,444 INFO L485 AbstractCegarLoop]: Abstraction has has 288 places, 310 transitions, 810 flow [2025-04-29 11:08:55,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 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,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:55,445 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] [2025-04-29 11:08:55,445 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:08:55,445 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:08:55,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:55,445 INFO L85 PathProgramCache]: Analyzing trace with hash 285483139, now seen corresponding path program 1 times [2025-04-29 11:08:55,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:55,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422115421] [2025-04-29 11:08:55,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:55,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:55,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-04-29 11:08:55,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-04-29 11:08:55,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:55,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:55,827 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:55,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:55,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422115421] [2025-04-29 11:08:55,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422115421] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:55,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:55,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:55,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132175059] [2025-04-29 11:08:55,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:55,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:55,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:55,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:55,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:56,321 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 295 [2025-04-29 11:08:56,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 310 transitions, 810 flow. Second operand has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 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,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:56,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 295 [2025-04-29 11:08:56,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:56,522 INFO L116 PetriNetUnfolderBase]: 185/1608 cut-off events. [2025-04-29 11:08:56,523 INFO L117 PetriNetUnfolderBase]: For 201/206 co-relation queries the response was YES. [2025-04-29 11:08:56,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2388 conditions, 1608 events. 185/1608 cut-off events. For 201/206 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 9983 event pairs, 75 based on Foata normal form. 0/1490 useless extension candidates. Maximal degree in co-relation 2326. Up to 362 conditions per place. [2025-04-29 11:08:56,530 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 104 selfloop transitions, 5 changer transitions 0/325 dead transitions. [2025-04-29 11:08:56,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 325 transitions, 1058 flow [2025-04-29 11:08:56,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2025-04-29 11:08:56,533 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8225988700564971 [2025-04-29 11:08:56,533 INFO L175 Difference]: Start difference. First operand has 288 places, 310 transitions, 810 flow. Second operand 6 states and 1456 transitions. [2025-04-29 11:08:56,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 325 transitions, 1058 flow [2025-04-29 11:08:56,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 325 transitions, 1058 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:56,541 INFO L231 Difference]: Finished difference. Result has 292 places, 309 transitions, 818 flow [2025-04-29 11:08:56,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=818, PETRI_PLACES=292, PETRI_TRANSITIONS=309} [2025-04-29 11:08:56,543 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, -6 predicate places. [2025-04-29 11:08:56,543 INFO L485 AbstractCegarLoop]: Abstraction has has 292 places, 309 transitions, 818 flow [2025-04-29 11:08:56,544 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 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,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:56,544 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] [2025-04-29 11:08:56,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:08:56,545 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:08:56,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:56,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1260414729, now seen corresponding path program 1 times [2025-04-29 11:08:56,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:56,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8941549] [2025-04-29 11:08:56,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:56,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:56,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-04-29 11:08:56,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-04-29 11:08:56,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:56,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:56,946 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:56,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:56,947 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8941549] [2025-04-29 11:08:56,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8941549] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:56,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:56,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:56,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021970416] [2025-04-29 11:08:56,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:56,947 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:56,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:56,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:56,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:57,323 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 295 [2025-04-29 11:08:57,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 309 transitions, 818 flow. Second operand has 6 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 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,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:57,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 295 [2025-04-29 11:08:57,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:57,700 INFO L116 PetriNetUnfolderBase]: 583/2965 cut-off events. [2025-04-29 11:08:57,700 INFO L117 PetriNetUnfolderBase]: For 703/710 co-relation queries the response was YES. [2025-04-29 11:08:57,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5052 conditions, 2965 events. 583/2965 cut-off events. For 703/710 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 21815 event pairs, 69 based on Foata normal form. 0/2779 useless extension candidates. Maximal degree in co-relation 4987. Up to 804 conditions per place. [2025-04-29 11:08:57,713 INFO L140 encePairwiseOnDemand]: 273/295 looper letters, 120 selfloop transitions, 72 changer transitions 0/398 dead transitions. [2025-04-29 11:08:57,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 398 transitions, 1572 flow [2025-04-29 11:08:57,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:57,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1458 transitions. [2025-04-29 11:08:57,716 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.823728813559322 [2025-04-29 11:08:57,716 INFO L175 Difference]: Start difference. First operand has 292 places, 309 transitions, 818 flow. Second operand 6 states and 1458 transitions. [2025-04-29 11:08:57,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 398 transitions, 1572 flow [2025-04-29 11:08:57,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 398 transitions, 1554 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:57,723 INFO L231 Difference]: Finished difference. Result has 297 places, 379 transitions, 1474 flow [2025-04-29 11:08:57,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1474, PETRI_PLACES=297, PETRI_TRANSITIONS=379} [2025-04-29 11:08:57,724 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, -1 predicate places. [2025-04-29 11:08:57,724 INFO L485 AbstractCegarLoop]: Abstraction has has 297 places, 379 transitions, 1474 flow [2025-04-29 11:08:57,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 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,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:57,724 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] [2025-04-29 11:08:57,724 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:08:57,725 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:08:57,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:57,725 INFO L85 PathProgramCache]: Analyzing trace with hash 418617224, now seen corresponding path program 1 times [2025-04-29 11:08:57,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:57,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677841362] [2025-04-29 11:08:57,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:57,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:57,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-04-29 11:08:57,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-04-29 11:08:57,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:57,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:58,085 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:58,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:58,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677841362] [2025-04-29 11:08:58,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677841362] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:58,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:58,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:58,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490617183] [2025-04-29 11:08:58,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:58,087 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:58,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:58,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:58,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:58,311 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 295 [2025-04-29 11:08:58,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 379 transitions, 1474 flow. Second operand has 6 states, 6 states have (on average 208.66666666666666) internal successors, (1252), 6 states have internal predecessors, (1252), 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,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:58,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 295 [2025-04-29 11:08:58,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:58,980 INFO L116 PetriNetUnfolderBase]: 1657/5712 cut-off events. [2025-04-29 11:08:58,980 INFO L117 PetriNetUnfolderBase]: For 3338/3398 co-relation queries the response was YES. [2025-04-29 11:08:58,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12809 conditions, 5712 events. 1657/5712 cut-off events. For 3338/3398 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 45902 event pairs, 861 based on Foata normal form. 0/5384 useless extension candidates. Maximal degree in co-relation 12742. Up to 3155 conditions per place. [2025-04-29 11:08:59,003 INFO L140 encePairwiseOnDemand]: 272/295 looper letters, 209 selfloop transitions, 89 changer transitions 0/479 dead transitions. [2025-04-29 11:08:59,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 479 transitions, 2474 flow [2025-04-29 11:08:59,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1376 transitions. [2025-04-29 11:08:59,006 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7774011299435029 [2025-04-29 11:08:59,006 INFO L175 Difference]: Start difference. First operand has 297 places, 379 transitions, 1474 flow. Second operand 6 states and 1376 transitions. [2025-04-29 11:08:59,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 479 transitions, 2474 flow [2025-04-29 11:08:59,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 479 transitions, 2474 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:59,019 INFO L231 Difference]: Finished difference. Result has 307 places, 463 transitions, 2276 flow [2025-04-29 11:08:59,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2276, PETRI_PLACES=307, PETRI_TRANSITIONS=463} [2025-04-29 11:08:59,021 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 9 predicate places. [2025-04-29 11:08:59,022 INFO L485 AbstractCegarLoop]: Abstraction has has 307 places, 463 transitions, 2276 flow [2025-04-29 11:08:59,022 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.66666666666666) internal successors, (1252), 6 states have internal predecessors, (1252), 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,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:59,022 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, 1, 1] [2025-04-29 11:08:59,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:08:59,023 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:08:59,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:59,023 INFO L85 PathProgramCache]: Analyzing trace with hash -227558963, now seen corresponding path program 1 times [2025-04-29 11:08:59,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:59,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051880689] [2025-04-29 11:08:59,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:59,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:59,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-04-29 11:08:59,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-04-29 11:08:59,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:59,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:08:59,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:59,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051880689] [2025-04-29 11:08:59,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051880689] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:59,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:59,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:08:59,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466096905] [2025-04-29 11:08:59,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:59,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:59,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:59,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:59,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:59,155 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 295 [2025-04-29 11:08:59,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 463 transitions, 2276 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 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,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:59,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 295 [2025-04-29 11:08:59,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:59,344 INFO L116 PetriNetUnfolderBase]: 306/1978 cut-off events. [2025-04-29 11:08:59,344 INFO L117 PetriNetUnfolderBase]: For 1104/1160 co-relation queries the response was YES. [2025-04-29 11:08:59,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4110 conditions, 1978 events. 306/1978 cut-off events. For 1104/1160 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13457 event pairs, 31 based on Foata normal form. 4/1902 useless extension candidates. Maximal degree in co-relation 4045. Up to 312 conditions per place. [2025-04-29 11:08:59,353 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 10 selfloop transitions, 6 changer transitions 0/403 dead transitions. [2025-04-29 11:08:59,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 403 transitions, 1744 flow [2025-04-29 11:08:59,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 873 transitions. [2025-04-29 11:08:59,355 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9864406779661017 [2025-04-29 11:08:59,355 INFO L175 Difference]: Start difference. First operand has 307 places, 463 transitions, 2276 flow. Second operand 3 states and 873 transitions. [2025-04-29 11:08:59,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 403 transitions, 1744 flow [2025-04-29 11:08:59,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 403 transitions, 1656 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:59,368 INFO L231 Difference]: Finished difference. Result has 310 places, 401 transitions, 1646 flow [2025-04-29 11:08:59,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=1612, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1646, PETRI_PLACES=310, PETRI_TRANSITIONS=401} [2025-04-29 11:08:59,369 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 12 predicate places. [2025-04-29 11:08:59,369 INFO L485 AbstractCegarLoop]: Abstraction has has 310 places, 401 transitions, 1646 flow [2025-04-29 11:08:59,370 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 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,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:59,370 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, 1, 1, 1, 1] [2025-04-29 11:08:59,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:08:59,370 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:08:59,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:59,373 INFO L85 PathProgramCache]: Analyzing trace with hash -252171981, now seen corresponding path program 1 times [2025-04-29 11:08:59,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:59,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793951649] [2025-04-29 11:08:59,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:59,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:59,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-04-29 11:08:59,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-04-29 11:08:59,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:59,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:59,707 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:59,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:59,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793951649] [2025-04-29 11:08:59,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793951649] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:59,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:59,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:59,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769339816] [2025-04-29 11:08:59,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:59,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:59,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:59,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:59,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:00,152 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 295 [2025-04-29 11:09:00,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 401 transitions, 1646 flow. Second operand has 6 states, 6 states have (on average 231.66666666666666) internal successors, (1390), 6 states have internal predecessors, (1390), 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,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:00,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 295 [2025-04-29 11:09:00,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:00,548 INFO L116 PetriNetUnfolderBase]: 695/3141 cut-off events. [2025-04-29 11:09:00,548 INFO L117 PetriNetUnfolderBase]: For 2932/3091 co-relation queries the response was YES. [2025-04-29 11:09:00,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7506 conditions, 3141 events. 695/3141 cut-off events. For 2932/3091 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 23959 event pairs, 52 based on Foata normal form. 20/3050 useless extension candidates. Maximal degree in co-relation 7431. Up to 749 conditions per place. [2025-04-29 11:09:00,557 INFO L140 encePairwiseOnDemand]: 276/295 looper letters, 192 selfloop transitions, 124 changer transitions 4/559 dead transitions. [2025-04-29 11:09:00,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 559 transitions, 3253 flow [2025-04-29 11:09:00,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1504 transitions. [2025-04-29 11:09:00,561 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8497175141242937 [2025-04-29 11:09:00,561 INFO L175 Difference]: Start difference. First operand has 310 places, 401 transitions, 1646 flow. Second operand 6 states and 1504 transitions. [2025-04-29 11:09:00,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 559 transitions, 3253 flow [2025-04-29 11:09:00,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 559 transitions, 3230 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:00,573 INFO L231 Difference]: Finished difference. Result has 318 places, 503 transitions, 3022 flow [2025-04-29 11:09:00,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=1638, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3022, PETRI_PLACES=318, PETRI_TRANSITIONS=503} [2025-04-29 11:09:00,574 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 20 predicate places. [2025-04-29 11:09:00,574 INFO L485 AbstractCegarLoop]: Abstraction has has 318 places, 503 transitions, 3022 flow [2025-04-29 11:09:00,575 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.66666666666666) internal successors, (1390), 6 states have internal predecessors, (1390), 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,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:00,575 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:00,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:09:00,575 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:09:00,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:00,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1707399594, now seen corresponding path program 1 times [2025-04-29 11:09:00,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:00,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200504921] [2025-04-29 11:09:00,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:00,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:00,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-04-29 11:09:00,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-04-29 11:09:00,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:00,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 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 [200504921] [2025-04-29 11:09:00,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200504921] 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 [1553753158] [2025-04-29 11:09:00,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:00,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:00,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:00,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:00,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:01,264 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 295 [2025-04-29 11:09:01,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 503 transitions, 3022 flow. Second operand has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:01,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 295 [2025-04-29 11:09:01,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:01,639 INFO L116 PetriNetUnfolderBase]: 608/2933 cut-off events. [2025-04-29 11:09:01,639 INFO L117 PetriNetUnfolderBase]: For 5475/5666 co-relation queries the response was YES. [2025-04-29 11:09:01,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7917 conditions, 2933 events. 608/2933 cut-off events. For 5475/5666 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 22116 event pairs, 92 based on Foata normal form. 18/2895 useless extension candidates. Maximal degree in co-relation 7839. Up to 818 conditions per place. [2025-04-29 11:09:01,650 INFO L140 encePairwiseOnDemand]: 289/295 looper letters, 226 selfloop transitions, 17 changer transitions 0/518 dead transitions. [2025-04-29 11:09:01,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 518 transitions, 3562 flow [2025-04-29 11:09:01,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2025-04-29 11:09:01,652 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8225988700564971 [2025-04-29 11:09:01,652 INFO L175 Difference]: Start difference. First operand has 318 places, 503 transitions, 3022 flow. Second operand 6 states and 1456 transitions. [2025-04-29 11:09:01,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 518 transitions, 3562 flow [2025-04-29 11:09:01,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 518 transitions, 3544 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:01,670 INFO L231 Difference]: Finished difference. Result has 322 places, 502 transitions, 3036 flow [2025-04-29 11:09:01,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=3002, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3036, PETRI_PLACES=322, PETRI_TRANSITIONS=502} [2025-04-29 11:09:01,671 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 24 predicate places. [2025-04-29 11:09:01,671 INFO L485 AbstractCegarLoop]: Abstraction has has 322 places, 502 transitions, 3036 flow [2025-04-29 11:09:01,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:01,672 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, 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,672 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:09:01,672 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:09:01,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:01,673 INFO L85 PathProgramCache]: Analyzing trace with hash 338479963, now seen corresponding path program 1 times [2025-04-29 11:09:01,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:01,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147203122] [2025-04-29 11:09:01,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:01,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:01,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-04-29 11:09:01,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-04-29 11:09:01,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:01,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:02,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:02,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:02,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147203122] [2025-04-29 11:09:02,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147203122] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:02,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:02,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:02,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094881976] [2025-04-29 11:09:02,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:02,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:02,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:02,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:02,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:02,260 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 295 [2025-04-29 11:09:02,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 502 transitions, 3036 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:09:02,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:02,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 295 [2025-04-29 11:09:02,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:02,901 INFO L116 PetriNetUnfolderBase]: 1547/5172 cut-off events. [2025-04-29 11:09:02,901 INFO L117 PetriNetUnfolderBase]: For 7515/7596 co-relation queries the response was YES. [2025-04-29 11:09:02,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15155 conditions, 5172 events. 1547/5172 cut-off events. For 7515/7596 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 41261 event pairs, 582 based on Foata normal form. 1/5019 useless extension candidates. Maximal degree in co-relation 15076. Up to 2889 conditions per place. [2025-04-29 11:09:02,922 INFO L140 encePairwiseOnDemand]: 272/295 looper letters, 312 selfloop transitions, 103 changer transitions 8/608 dead transitions. [2025-04-29 11:09:02,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 608 transitions, 4492 flow [2025-04-29 11:09:02,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:02,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1376 transitions. [2025-04-29 11:09:02,924 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7774011299435029 [2025-04-29 11:09:02,924 INFO L175 Difference]: Start difference. First operand has 322 places, 502 transitions, 3036 flow. Second operand 6 states and 1376 transitions. [2025-04-29 11:09:02,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 608 transitions, 4492 flow [2025-04-29 11:09:02,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 608 transitions, 4458 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:02,948 INFO L231 Difference]: Finished difference. Result has 327 places, 588 transitions, 4020 flow [2025-04-29 11:09:02,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=3002, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=502, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4020, PETRI_PLACES=327, PETRI_TRANSITIONS=588} [2025-04-29 11:09:02,949 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 29 predicate places. [2025-04-29 11:09:02,949 INFO L485 AbstractCegarLoop]: Abstraction has has 327 places, 588 transitions, 4020 flow [2025-04-29 11:09:02,950 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:09:02,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:02,950 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, 1, 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:02,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:09:02,950 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:09:02,954 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:02,955 INFO L85 PathProgramCache]: Analyzing trace with hash 614932814, now seen corresponding path program 1 times [2025-04-29 11:09:02,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:02,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534896175] [2025-04-29 11:09:02,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:02,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:02,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-04-29 11:09:03,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-04-29 11:09:03,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:03,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:04,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:04,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534896175] [2025-04-29 11:09:04,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534896175] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:04,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:04,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-04-29 11:09:04,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606088904] [2025-04-29 11:09:04,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:04,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:09:04,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:04,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:09:04,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:09:06,661 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 295 [2025-04-29 11:09:06,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 588 transitions, 4020 flow. Second operand has 24 states, 24 states have (on average 152.04166666666666) internal successors, (3649), 24 states have internal predecessors, (3649), 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:06,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:06,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 295 [2025-04-29 11:09:06,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:08,268 INFO L116 PetriNetUnfolderBase]: 1733/5591 cut-off events. [2025-04-29 11:09:08,268 INFO L117 PetriNetUnfolderBase]: For 11173/11253 co-relation queries the response was YES. [2025-04-29 11:09:08,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18560 conditions, 5591 events. 1733/5591 cut-off events. For 11173/11253 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 45053 event pairs, 507 based on Foata normal form. 14/5537 useless extension candidates. Maximal degree in co-relation 18461. Up to 2210 conditions per place. [2025-04-29 11:09:08,295 INFO L140 encePairwiseOnDemand]: 257/295 looper letters, 531 selfloop transitions, 110 changer transitions 30/802 dead transitions. [2025-04-29 11:09:08,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 802 transitions, 6952 flow [2025-04-29 11:09:08,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-29 11:09:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-04-29 11:09:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 5451 transitions. [2025-04-29 11:09:08,301 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5279418886198547 [2025-04-29 11:09:08,301 INFO L175 Difference]: Start difference. First operand has 327 places, 588 transitions, 4020 flow. Second operand 35 states and 5451 transitions. [2025-04-29 11:09:08,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 802 transitions, 6952 flow [2025-04-29 11:09:08,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 802 transitions, 6748 flow, removed 102 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:08,352 INFO L231 Difference]: Finished difference. Result has 371 places, 620 transitions, 4458 flow [2025-04-29 11:09:08,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=3872, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=4458, PETRI_PLACES=371, PETRI_TRANSITIONS=620} [2025-04-29 11:09:08,353 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 73 predicate places. [2025-04-29 11:09:08,353 INFO L485 AbstractCegarLoop]: Abstraction has has 371 places, 620 transitions, 4458 flow [2025-04-29 11:09:08,354 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 152.04166666666666) internal successors, (3649), 24 states have internal predecessors, (3649), 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:08,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:08,355 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, 1, 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:08,355 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:09:08,355 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:09:08,356 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:08,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1421143484, now seen corresponding path program 1 times [2025-04-29 11:09:08,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:08,356 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022844189] [2025-04-29 11:09:08,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:08,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:08,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-04-29 11:09:08,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-04-29 11:09:08,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:08,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:09,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:09,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022844189] [2025-04-29 11:09:09,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022844189] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:09,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:09,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-04-29 11:09:09,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655719959] [2025-04-29 11:09:09,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:09,562 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:09:09,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:09,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:09:09,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:09:13,617 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 295 [2025-04-29 11:09:13,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 620 transitions, 4458 flow. Second operand has 23 states, 23 states have (on average 177.47826086956522) internal successors, (4082), 23 states have internal predecessors, (4082), 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,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:13,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 295 [2025-04-29 11:09:13,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:15,005 INFO L116 PetriNetUnfolderBase]: 1401/5236 cut-off events. [2025-04-29 11:09:15,006 INFO L117 PetriNetUnfolderBase]: For 12988/13136 co-relation queries the response was YES. [2025-04-29 11:09:15,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17705 conditions, 5236 events. 1401/5236 cut-off events. For 12988/13136 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 44297 event pairs, 197 based on Foata normal form. 27/5195 useless extension candidates. Maximal degree in co-relation 17589. Up to 1530 conditions per place. [2025-04-29 11:09:15,036 INFO L140 encePairwiseOnDemand]: 255/295 looper letters, 389 selfloop transitions, 125 changer transitions 7/763 dead transitions. [2025-04-29 11:09:15,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 763 transitions, 6723 flow [2025-04-29 11:09:15,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-29 11:09:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-29 11:09:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4863 transitions. [2025-04-29 11:09:15,039 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6105461393596987 [2025-04-29 11:09:15,039 INFO L175 Difference]: Start difference. First operand has 371 places, 620 transitions, 4458 flow. Second operand 27 states and 4863 transitions. [2025-04-29 11:09:15,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 763 transitions, 6723 flow [2025-04-29 11:09:15,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 763 transitions, 6595 flow, removed 48 selfloop flow, removed 14 redundant places. [2025-04-29 11:09:15,088 INFO L231 Difference]: Finished difference. Result has 391 places, 679 transitions, 5576 flow [2025-04-29 11:09:15,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=4366, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=5576, PETRI_PLACES=391, PETRI_TRANSITIONS=679} [2025-04-29 11:09:15,089 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 93 predicate places. [2025-04-29 11:09:15,089 INFO L485 AbstractCegarLoop]: Abstraction has has 391 places, 679 transitions, 5576 flow [2025-04-29 11:09:15,090 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 177.47826086956522) internal successors, (4082), 23 states have internal predecessors, (4082), 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:15,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:15,090 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, 1, 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:15,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:09:15,090 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:09:15,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:15,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1987592998, now seen corresponding path program 2 times [2025-04-29 11:09:15,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:15,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667683191] [2025-04-29 11:09:15,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:15,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:15,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 205 statements into 2 equivalence classes. [2025-04-29 11:09:15,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 205 of 205 statements. [2025-04-29 11:09:15,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:09:15,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:16,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:16,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:16,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667683191] [2025-04-29 11:09:16,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667683191] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:16,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:16,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-04-29 11:09:16,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719370595] [2025-04-29 11:09:16,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:16,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 11:09:16,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:16,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 11:09:16,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:09:20,825 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 295 [2025-04-29 11:09:20,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 679 transitions, 5576 flow. Second operand has 24 states, 24 states have (on average 177.29166666666666) internal successors, (4255), 24 states have internal predecessors, (4255), 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,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:20,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 295 [2025-04-29 11:09:20,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:22,396 INFO L116 PetriNetUnfolderBase]: 1459/5376 cut-off events. [2025-04-29 11:09:22,397 INFO L117 PetriNetUnfolderBase]: For 17260/17430 co-relation queries the response was YES. [2025-04-29 11:09:22,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19348 conditions, 5376 events. 1459/5376 cut-off events. For 17260/17430 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 45316 event pairs, 191 based on Foata normal form. 58/5367 useless extension candidates. Maximal degree in co-relation 19222. Up to 1137 conditions per place. [2025-04-29 11:09:22,426 INFO L140 encePairwiseOnDemand]: 259/295 looper letters, 412 selfloop transitions, 153 changer transitions 8/815 dead transitions. [2025-04-29 11:09:22,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 815 transitions, 7864 flow [2025-04-29 11:09:22,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-29 11:09:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-29 11:09:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 5923 transitions. [2025-04-29 11:09:22,429 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6084232152028762 [2025-04-29 11:09:22,429 INFO L175 Difference]: Start difference. First operand has 391 places, 679 transitions, 5576 flow. Second operand 33 states and 5923 transitions. [2025-04-29 11:09:22,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 815 transitions, 7864 flow [2025-04-29 11:09:22,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 815 transitions, 7781 flow, removed 20 selfloop flow, removed 17 redundant places. [2025-04-29 11:09:22,488 INFO L231 Difference]: Finished difference. Result has 417 places, 734 transitions, 6599 flow [2025-04-29 11:09:22,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=5519, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=6599, PETRI_PLACES=417, PETRI_TRANSITIONS=734} [2025-04-29 11:09:22,489 INFO L279 CegarLoopForPetriNet]: 298 programPoint places, 119 predicate places. [2025-04-29 11:09:22,489 INFO L485 AbstractCegarLoop]: Abstraction has has 417 places, 734 transitions, 6599 flow [2025-04-29 11:09:22,490 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 177.29166666666666) internal successors, (4255), 24 states have internal predecessors, (4255), 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:22,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:22,490 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, 1, 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:22,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:09:22,490 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-04-29 11:09:22,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:22,491 INFO L85 PathProgramCache]: Analyzing trace with hash -419709632, now seen corresponding path program 3 times [2025-04-29 11:09:22,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:22,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656711310] [2025-04-29 11:09:22,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:09:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:22,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 205 statements into 2 equivalence classes. [2025-04-29 11:09:22,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 205 of 205 statements. [2025-04-29 11:09:22,560 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:09:22,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:23,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:23,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656711310] [2025-04-29 11:09:23,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656711310] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:23,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475962988] [2025-04-29 11:09:23,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:09:23,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:23,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:23,690 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:23,691 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:23,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 205 statements into 2 equivalence classes. [2025-04-29 11:09:24,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 205 of 205 statements. [2025-04-29 11:09:24,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:09:24,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:24,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-04-29 11:09:24,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:24,210 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:24,375 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:24,433 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:09:24,433 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:24,606 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:24,659 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:24,863 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:09:24,863 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-04-29 11:09:25,011 INFO L325 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-04-29 11:09:25,012 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 1 case distinctions, treesize of input 23 treesize of output 26 [2025-04-29 11:09:25,138 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:25,480 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:25,532 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:25,577 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:25,648 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:25,694 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-04-29 11:09:25,738 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 37 treesize of output 26 [2025-04-29 11:09:25,760 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 37 treesize of output 26 [2025-04-29 11:09:25,772 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 37 treesize of output 26 [2025-04-29 11:09:25,785 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 37 treesize of output 26 [2025-04-29 11:09:25,840 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:25,840 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 44 treesize of output 41 [2025-04-29 11:09:25,851 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:25,851 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 44 treesize of output 41 [2025-04-29 11:09:25,863 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:25,864 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:25,915 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:25,915 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:26,004 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:26,004 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 58 treesize of output 61 [2025-04-29 11:09:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:09:26,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:26,904 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_#t~mem3.offset| 1)) (.cse2 (+ 2 |c_t_funThread1of1ForFork0_#t~mem3.offset|)) (.cse3 (+ |c_t_funThread1of1ForFork0_#t~mem3.offset| 3))) (and (forall ((v_ArrVal_2968 (Array Int Int)) (|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_2971 Int) (|t_funThread1of1ForFork0_#t~nondet6| Int)) (= (select (select (let ((.cse0 (store |c_#race| c_~A~0.base v_ArrVal_2968))) (store .cse0 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (store (store (select .cse0 |t_funThread1of1ForFork0_#t~mem3.base|) .cse1 v_ArrVal_2971) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_#t~mem3.offset| |t_funThread1of1ForFork0_#t~nondet6|))) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2968 (Array Int Int)) (|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_2971 Int) (|t_funThread1of1ForFork0_#t~nondet6| Int)) (= (select (select (let ((.cse4 (store |c_#race| c_~A~0.base v_ArrVal_2968))) (store .cse4 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (store (store (select .cse4 |t_funThread1of1ForFork0_#t~mem3.base|) .cse1 v_ArrVal_2971) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_#t~mem3.offset| |t_funThread1of1ForFork0_#t~nondet6|))) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2968 (Array Int Int)) (|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_2971 Int) (|t_funThread1of1ForFork0_#t~nondet6| Int)) (= (select (select (let ((.cse5 (store |c_#race| c_~A~0.base v_ArrVal_2968))) (store .cse5 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (store (store (select .cse5 |t_funThread1of1ForFork0_#t~mem3.base|) .cse1 v_ArrVal_2971) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_#t~mem3.offset| |t_funThread1of1ForFork0_#t~nondet6|))) c_~B~0.base) (+ 7 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2968 (Array Int Int)) (|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_2971 Int) (|t_funThread1of1ForFork0_#t~nondet6| Int)) (= (select (select (let ((.cse6 (store |c_#race| c_~A~0.base v_ArrVal_2968))) (store .cse6 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (store (store (select .cse6 |t_funThread1of1ForFork0_#t~mem3.base|) .cse1 v_ArrVal_2971) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_#t~mem3.offset| |t_funThread1of1ForFork0_#t~nondet6|))) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)))) is different from false [2025-04-29 11:09:26,967 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 7 c_~B~0.offset))) (let ((.cse1 (+ |c_t_funThread1of1ForFork0_#t~mem3.offset| 1)) (.cse2 (+ 2 |c_t_funThread1of1ForFork0_#t~mem3.offset|)) (.cse3 (+ |c_t_funThread1of1ForFork0_#t~mem3.offset| 3)) (.cse4 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse8 0)))) (and (forall ((v_ArrVal_2968 (Array Int Int)) (|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_2971 Int) (|t_funThread1of1ForFork0_#t~nondet6| Int)) (= (select (select (let ((.cse0 (store .cse4 c_~A~0.base v_ArrVal_2968))) (store .cse0 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (store (store (select .cse0 |t_funThread1of1ForFork0_#t~mem3.base|) .cse1 v_ArrVal_2971) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_#t~mem3.offset| |t_funThread1of1ForFork0_#t~nondet6|))) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2968 (Array Int Int)) (|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_2971 Int) (|t_funThread1of1ForFork0_#t~nondet6| Int)) (= (select (select (let ((.cse5 (store .cse4 c_~A~0.base v_ArrVal_2968))) (store .cse5 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (store (store (select .cse5 |t_funThread1of1ForFork0_#t~mem3.base|) .cse1 v_ArrVal_2971) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_#t~mem3.offset| |t_funThread1of1ForFork0_#t~nondet6|))) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2968 (Array Int Int)) (|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_2971 Int) (|t_funThread1of1ForFork0_#t~nondet6| Int)) (= (select (select (let ((.cse6 (store .cse4 c_~A~0.base v_ArrVal_2968))) (store .cse6 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (store (store (select .cse6 |t_funThread1of1ForFork0_#t~mem3.base|) .cse1 v_ArrVal_2971) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_#t~mem3.offset| |t_funThread1of1ForFork0_#t~nondet6|))) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2968 (Array Int Int)) (|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_2971 Int) (|t_funThread1of1ForFork0_#t~nondet6| Int)) (= (select (select (let ((.cse7 (store .cse4 c_~A~0.base v_ArrVal_2968))) (store .cse7 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (store (store (select .cse7 |t_funThread1of1ForFork0_#t~mem3.base|) .cse1 v_ArrVal_2971) .cse2 0) .cse3 0) |c_t_funThread1of1ForFork0_#t~mem3.offset| |t_funThread1of1ForFork0_#t~nondet6|))) c_~B~0.base) .cse8) 0))))) is different from false [2025-04-29 11:09:28,166 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 6 c_~B~0.offset)) (.cse8 (+ 7 c_~B~0.offset)) (.cse4 (select (select |c_#memory_$Pointer$.offset| c_~A~0.base) (+ c_~A~0.offset 4)))) (let ((.cse1 (+ .cse4 1)) (.cse2 (+ 2 .cse4)) (.cse3 (+ 3 .cse4)) (.cse5 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse6 0) .cse8 0)))) (and (forall ((v_ArrVal_2968 (Array Int Int)) (|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_2971 Int) (|t_funThread1of1ForFork0_#t~nondet6| Int)) (= (select (select (let ((.cse0 (store .cse5 c_~A~0.base v_ArrVal_2968))) (store .cse0 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (store (store (select .cse0 |t_funThread1of1ForFork0_#t~mem3.base|) .cse1 v_ArrVal_2971) .cse2 0) .cse3 0) .cse4 |t_funThread1of1ForFork0_#t~nondet6|))) c_~B~0.base) .cse6) 0)) (forall ((v_ArrVal_2968 (Array Int Int)) (|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_2971 Int) (|t_funThread1of1ForFork0_#t~nondet6| Int)) (= (select (select (let ((.cse7 (store .cse5 c_~A~0.base v_ArrVal_2968))) (store .cse7 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (store (store (select .cse7 |t_funThread1of1ForFork0_#t~mem3.base|) .cse1 v_ArrVal_2971) .cse2 0) .cse3 0) .cse4 |t_funThread1of1ForFork0_#t~nondet6|))) c_~B~0.base) .cse8) 0)) (forall ((v_ArrVal_2968 (Array Int Int)) (|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_2971 Int) (|t_funThread1of1ForFork0_#t~nondet6| Int)) (= (select (select (let ((.cse9 (store .cse5 c_~A~0.base v_ArrVal_2968))) (store .cse9 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (store (store (select .cse9 |t_funThread1of1ForFork0_#t~mem3.base|) .cse1 v_ArrVal_2971) .cse2 0) .cse3 0) .cse4 |t_funThread1of1ForFork0_#t~nondet6|))) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2968 (Array Int Int)) (|t_funThread1of1ForFork0_#t~mem3.base| Int) (v_ArrVal_2971 Int) (|t_funThread1of1ForFork0_#t~nondet6| Int)) (= (select (select (let ((.cse10 (store .cse5 c_~A~0.base v_ArrVal_2968))) (store .cse10 |t_funThread1of1ForFork0_#t~mem3.base| (store (store (store (store (select .cse10 |t_funThread1of1ForFork0_#t~mem3.base|) .cse1 v_ArrVal_2971) .cse2 0) .cse3 0) .cse4 |t_funThread1of1ForFork0_#t~nondet6|))) c_~B~0.base) (+ 5 c_~B~0.offset)) 0))))) is different from false [2025-04-29 11:09:37,197 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:37,198 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 112 treesize of output 103 [2025-04-29 11:09:37,208 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:37,208 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 654 treesize of output 638 [2025-04-29 11:09:37,219 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 1896 treesize of output 1872 [2025-04-29 11:09:37,244 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-04-29 11:09:37,271 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 1695 treesize of output 1663 [2025-04-29 11:09:37,374 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:37,374 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 103 [2025-04-29 11:09:37,378 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:37,385 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:09:37,386 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 188 treesize of output 178 [2025-04-29 11:09:37,392 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:37,392 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:37,396 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 222 treesize of output 214 [2025-04-29 11:09:37,402 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:37,402 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:37,406 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 232 [2025-04-29 11:09:37,453 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:37,454 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 103 [2025-04-29 11:09:37,456 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:37,462 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:09:37,462 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 188 treesize of output 178 [2025-04-29 11:09:37,467 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:37,467 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:37,468 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:37,471 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 44 treesize of output 40 [2025-04-29 11:09:37,475 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:37,475 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:37,476 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 11:09:37,479 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 58 [2025-04-29 11:09:37,500 INFO L325 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-04-29 11:09:37,500 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 1 [2025-04-29 11:09:38,404 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:38,404 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-04-29 11:09:38,412 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:38,412 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-04-29 11:09:38,418 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:38,419 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-04-29 11:09:38,425 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:38,425 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-04-29 11:09:38,432 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:38,432 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-04-29 11:09:38,439 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 4)) (.cse0 (+ 4 |c_ULTIMATE.start_init_~p#1.offset|))) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (+ 5 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_6) c_~A~0.base) .cse1))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (select v_arrayElimArr_5 .cse0) 0)) (not (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_5) c_~A~0.base) .cse1) (+ 6 c_~B~0.offset))))) (forall ((v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (select v_arrayElimArr_7 .cse0) 0)) (not (= (+ 7 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_7) c_~A~0.base) .cse1))))) (forall ((v_arrayElimArr_8 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (+ 3 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_8) c_~A~0.base) .cse1))) (not (= (select v_arrayElimArr_8 .cse0) 0)))) (not (= c_~B~0.base c_~A~0.base)) (forall ((|ULTIMATE.start_init_~p#1.base| Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (+ 4 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_9) c_~A~0.base) .cse1))) (not (= (select v_arrayElimArr_9 .cse0) 0)))))) is different from false [2025-04-29 11:09:38,494 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset 4)) (.cse1 (+ |c_ULTIMATE.start_init_#in~p#1.offset| 4))) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (+ 5 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_6) c_~A~0.base) .cse0))) (not (= (select v_arrayElimArr_6 .cse1) 0)))) (forall ((|ULTIMATE.start_init_~p#1.base| Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (+ 4 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_9) c_~A~0.base) .cse0))) (not (= (select v_arrayElimArr_9 .cse1) 0)))) (forall ((v_arrayElimArr_8 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (+ 3 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_8) c_~A~0.base) .cse0))) (not (= (select v_arrayElimArr_8 .cse1) 0)))) (forall ((v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (select v_arrayElimArr_7 .cse1) 0)) (not (= (+ 7 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_7) c_~A~0.base) .cse0))))) (not (= c_~B~0.base c_~A~0.base)) (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_5) c_~A~0.base) .cse0) (+ 6 c_~B~0.offset))) (not (= (select v_arrayElimArr_5 .cse1) 0)))))) is different from false [2025-04-29 11:09:38,557 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 4)) (.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (select v_arrayElimArr_6 .cse0) 0)) (not (= (+ 5 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_6) c_~A~0.base) .cse1))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_5) c_~A~0.base) .cse1) (+ 6 c_~B~0.offset))) (not (= (select v_arrayElimArr_5 .cse0) 0)))) (forall ((v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (+ 7 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_7) c_~A~0.base) .cse1))) (not (= (select v_arrayElimArr_7 .cse0) 0)))) (not (= c_~B~0.base c_~A~0.base)) (forall ((v_arrayElimArr_8 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (+ 3 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_8) c_~A~0.base) .cse1))) (not (= (select v_arrayElimArr_8 .cse0) 0)))) (forall ((|ULTIMATE.start_init_~p#1.base| Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (+ 4 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_9) c_~A~0.base) .cse1))) (not (= (select v_arrayElimArr_9 .cse0) 0)))))) is different from false [2025-04-29 11:09:38,621 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset 4)) (.cse1 (+ |c_ULTIMATE.start_main_#t~malloc20#1.offset| 4))) (and (forall ((|ULTIMATE.start_init_~p#1.base| Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (+ 4 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_9) c_~A~0.base) .cse0))) (not (= (select v_arrayElimArr_9 .cse1) 0)))) (forall ((v_arrayElimArr_6 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (select v_arrayElimArr_6 .cse1) 0)) (not (= (+ 5 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_6) c_~A~0.base) .cse0))))) (forall ((v_arrayElimArr_8 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (+ 3 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_8) c_~A~0.base) .cse0))) (not (= (select v_arrayElimArr_8 .cse1) 0)))) (not (= c_~B~0.base c_~A~0.base)) (forall ((v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (select v_arrayElimArr_7 .cse1) 0)) (not (= (+ 7 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_7) c_~A~0.base) .cse0))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_5) c_~A~0.base) .cse0) (+ 6 c_~B~0.offset))) (not (= 0 (select v_arrayElimArr_5 .cse1))))))) is different from false [2025-04-29 11:09:38,650 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset 4))) (and (forall ((v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= 0 (select v_arrayElimArr_7 4))) (not (= (+ 7 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_7) c_~A~0.base) .cse0))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (select v_arrayElimArr_5 4) 0)) (not (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_5) c_~A~0.base) .cse0) (+ 6 c_~B~0.offset))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (select v_arrayElimArr_6 4) 0)) (not (= (+ 5 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_6) c_~A~0.base) .cse0))))) (forall ((v_arrayElimArr_8 (Array Int Int)) (|ULTIMATE.start_init_~p#1.base| Int)) (or (not (= (select v_arrayElimArr_8 4) 0)) (not (= (+ 3 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_8) c_~A~0.base) .cse0))))) (not (= c_~B~0.base c_~A~0.base)) (forall ((|ULTIMATE.start_init_~p#1.base| Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (+ 4 c_~B~0.offset) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_init_~p#1.base| v_arrayElimArr_9) c_~A~0.base) .cse0))) (not (= (select v_arrayElimArr_9 4) 0)))))) is different from false [2025-04-29 11:09:39,036 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset 4))) (and (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2954 (Array Int Int)) (v_subst_2 Int)) (or (not (= (select v_arrayElimArr_8 4) 0)) (not (= (+ 3 c_~B~0.offset) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2954) v_subst_2 v_arrayElimArr_8) c_~A~0.base) .cse0))))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2954 (Array Int Int)) (v_subst_5 Int)) (or (not (= (select v_arrayElimArr_5 4) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2954) v_subst_5 v_arrayElimArr_5) c_~A~0.base) .cse0) (+ 6 c_~B~0.offset))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2954 (Array Int Int)) (v_subst_1 Int)) (or (not (= (select v_arrayElimArr_6 4) 0)) (not (= (+ 5 c_~B~0.offset) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2954) v_subst_1 v_arrayElimArr_6) c_~A~0.base) .cse0))))) (forall ((v_ArrVal_2954 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_subst_4 Int)) (or (not (= 0 (select v_arrayElimArr_7 4))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2954) v_subst_4 v_arrayElimArr_7) c_~A~0.base) .cse0) (+ 7 c_~B~0.offset))))) (not (= c_~B~0.base c_~A~0.base)) (forall ((v_ArrVal_2954 (Array Int Int)) (v_subst_3 Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_~p#1.base| v_ArrVal_2954) v_subst_3 v_arrayElimArr_9) c_~A~0.base) .cse0) (+ 4 c_~B~0.offset))) (not (= (select v_arrayElimArr_9 4) 0)))))) is different from false [2025-04-29 11:09:39,508 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~A~0.offset 4))) (and (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_2954 (Array Int Int)) (v_subst_1 Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2954) v_subst_1 v_arrayElimArr_6) c_~A~0.base) .cse0) (+ 5 c_~B~0.offset))) (not (= (select v_arrayElimArr_6 4) 0)))) (forall ((v_ArrVal_2954 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_subst_4 Int)) (or (not (= 0 (select v_arrayElimArr_7 4))) (not (= (+ 7 c_~B~0.offset) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2954) v_subst_4 v_arrayElimArr_7) c_~A~0.base) .cse0))))) (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_2954 (Array Int Int)) (v_subst_2 Int)) (or (not (= (select v_arrayElimArr_8 4) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2954) v_subst_2 v_arrayElimArr_8) c_~A~0.base) .cse0) (+ 3 c_~B~0.offset))))) (not (= c_~B~0.base c_~A~0.base)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_2954 (Array Int Int)) (v_subst_5 Int)) (or (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2954) v_subst_5 v_arrayElimArr_5) c_~A~0.base) .cse0) (+ 6 c_~B~0.offset))) (not (= (select v_arrayElimArr_5 4) 0)))) (forall ((v_ArrVal_2954 (Array Int Int)) (v_subst_3 Int) (v_arrayElimArr_9 (Array Int Int))) (or (not (= (select v_arrayElimArr_9 4) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_init_#in~p#1.base| v_ArrVal_2954) v_subst_3 v_arrayElimArr_9) c_~A~0.base) .cse0) (+ 4 c_~B~0.offset))))))) is different from false Killed by 15