./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7d369c8-09de-4cb5-82b0-42e0656ac645/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7d369c8-09de-4cb5-82b0-42e0656ac645/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7d369c8-09de-4cb5-82b0-42e0656ac645/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7d369c8-09de-4cb5-82b0-42e0656ac645/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7d369c8-09de-4cb5-82b0-42e0656ac645/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7d369c8-09de-4cb5-82b0-42e0656ac645/bin/uautomizer-verify-LYvppIcaGC --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 289adcaae4c50abff0035518c5703ebebf5bd048dfea932ca710de251a5a744e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 00:47:23,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 00:47:23,532 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7d369c8-09de-4cb5-82b0-42e0656ac645/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-24 00:47:23,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 00:47:23,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 00:47:23,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 00:47:23,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 00:47:23,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 00:47:23,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 00:47:23,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 00:47:23,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 00:47:23,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 00:47:23,568 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 00:47:23,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 00:47:23,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 00:47:23,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 00:47:23,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 00:47:23,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 00:47:23,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 00:47:23,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 00:47:23,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 00:47:23,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 00:47:23,569 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-24 00:47:23,569 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 00:47:23,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 00:47:23,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 00:47:23,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 00:47:23,570 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 00:47:23,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 00:47:23,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:47:23,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:47:23,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:47:23,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 00:47:23,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 00:47:23,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 00:47:23,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:47:23,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 00:47:23,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 00:47:23,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 00:47:23,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 00:47:23,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 00:47:23,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 00:47:23,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 00:47:23,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 00:47:23,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 00:47:23,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 00:47:23,572 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7d369c8-09de-4cb5-82b0-42e0656ac645/bin/uautomizer-verify-LYvppIcaGC 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 -> 289adcaae4c50abff0035518c5703ebebf5bd048dfea932ca710de251a5a744e [2024-11-24 00:47:23,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 00:47:23,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 00:47:23,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 00:47:23,943 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 00:47:23,943 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 00:47:23,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7d369c8-09de-4cb5-82b0-42e0656ac645/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race.i [2024-11-24 00:47:26,969 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7d369c8-09de-4cb5-82b0-42e0656ac645/bin/uautomizer-verify-LYvppIcaGC/data/bef1d74a1/c086e8e9ae6c4a379dd08e1e9a1e17ba/FLAG0614d73c4 [2024-11-24 00:47:27,367 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 00:47:27,368 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7d369c8-09de-4cb5-82b0-42e0656ac645/sv-benchmarks/c/pthread-race-challenges/per-thread-array-index-race.i [2024-11-24 00:47:27,387 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7d369c8-09de-4cb5-82b0-42e0656ac645/bin/uautomizer-verify-LYvppIcaGC/data/bef1d74a1/c086e8e9ae6c4a379dd08e1e9a1e17ba/FLAG0614d73c4 [2024-11-24 00:47:27,555 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7d369c8-09de-4cb5-82b0-42e0656ac645/bin/uautomizer-verify-LYvppIcaGC/data/bef1d74a1/c086e8e9ae6c4a379dd08e1e9a1e17ba [2024-11-24 00:47:27,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 00:47:27,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 00:47:27,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 00:47:27,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 00:47:27,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 00:47:27,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:47:27" (1/1) ... [2024-11-24 00:47:27,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@252a5516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:47:27, skipping insertion in model container [2024-11-24 00:47:27,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:47:27" (1/1) ... [2024-11-24 00:47:27,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 00:47:28,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:47:28,157 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 00:47:28,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 00:47:28,264 INFO L204 MainTranslator]: Completed translation [2024-11-24 00:47:28,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:47:28 WrapperNode [2024-11-24 00:47:28,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 00:47:28,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 00:47:28,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 00:47:28,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 00:47:28,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:47:28" (1/1) ... [2024-11-24 00:47:28,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:47:28" (1/1) ... [2024-11-24 00:47:28,309 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2024-11-24 00:47:28,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 00:47:28,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 00:47:28,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 00:47:28,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 00:47:28,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:47:28" (1/1) ... [2024-11-24 00:47:28,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:47:28" (1/1) ... [2024-11-24 00:47:28,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:47:28" (1/1) ... [2024-11-24 00:47:28,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:47:28" (1/1) ... [2024-11-24 00:47:28,332 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:47:28" (1/1) ... [2024-11-24 00:47:28,333 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:47:28" (1/1) ... [2024-11-24 00:47:28,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:47:28" (1/1) ... [2024-11-24 00:47:28,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:47:28" (1/1) ... [2024-11-24 00:47:28,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:47:28" (1/1) ... [2024-11-24 00:47:28,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 00:47:28,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 00:47:28,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 00:47:28,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 00:47:28,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:47:28" (1/1) ... [2024-11-24 00:47:28,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 00:47:28,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7d369c8-09de-4cb5-82b0-42e0656ac645/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 00:47:28,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7d369c8-09de-4cb5-82b0-42e0656ac645/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 00:47:28,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7d369c8-09de-4cb5-82b0-42e0656ac645/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 00:47:28,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-24 00:47:28,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-24 00:47:28,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-24 00:47:28,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-24 00:47:28,442 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-24 00:47:28,442 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-24 00:47:28,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 00:47:28,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 00:47:28,444 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-24 00:47:28,619 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 00:47:28,620 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 00:47:28,870 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-24 00:47:28,870 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 00:47:28,882 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 00:47:28,883 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 00:47:28,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:47:28 BoogieIcfgContainer [2024-11-24 00:47:28,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 00:47:28,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 00:47:28,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 00:47:28,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 00:47:28,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:47:27" (1/3) ... [2024-11-24 00:47:28,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171be217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:47:28, skipping insertion in model container [2024-11-24 00:47:28,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:47:28" (2/3) ... [2024-11-24 00:47:28,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171be217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:47:28, skipping insertion in model container [2024-11-24 00:47:28,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:47:28" (3/3) ... [2024-11-24 00:47:28,900 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-index-race.i [2024-11-24 00:47:28,921 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 00:47:28,923 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-index-race.i that has 2 procedures, 93 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2024-11-24 00:47:28,924 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-24 00:47:29,023 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-24 00:47:29,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 97 transitions, 201 flow [2024-11-24 00:47:29,183 INFO L124 PetriNetUnfolderBase]: 6/132 cut-off events. [2024-11-24 00:47:29,186 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-24 00:47:29,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 132 events. 6/132 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 233 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. [2024-11-24 00:47:29,192 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 97 transitions, 201 flow [2024-11-24 00:47:29,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 97 transitions, 201 flow [2024-11-24 00:47:29,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:47:29,220 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@685dbe23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:47:29,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-24 00:47:29,230 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 00:47:29,230 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-11-24 00:47:29,230 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:47:29,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:29,231 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] [2024-11-24 00:47:29,232 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-24 00:47:29,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:29,238 INFO L85 PathProgramCache]: Analyzing trace with hash -130984124, now seen corresponding path program 1 times [2024-11-24 00:47:29,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:29,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688583882] [2024-11-24 00:47:29,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:29,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:47:29,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:47:29,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:47:29,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688583882] [2024-11-24 00:47:29,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688583882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:47:29,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:47:29,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 00:47:29,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809186433] [2024-11-24 00:47:29,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:47:29,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:47:29,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:47:29,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:47:29,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:47:29,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 97 [2024-11-24 00:47:29,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:29,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:47:29,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 97 [2024-11-24 00:47:29,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:47:29,791 INFO L124 PetriNetUnfolderBase]: 3/162 cut-off events. [2024-11-24 00:47:29,795 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-24 00:47:29,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 162 events. 3/162 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 328 event pairs, 2 based on Foata normal form. 5/149 useless extension candidates. Maximal degree in co-relation 102. Up to 15 conditions per place. [2024-11-24 00:47:29,800 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 8 selfloop transitions, 2 changer transitions 1/93 dead transitions. [2024-11-24 00:47:29,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 93 transitions, 213 flow [2024-11-24 00:47:29,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:47:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:47:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2024-11-24 00:47:29,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9037800687285223 [2024-11-24 00:47:29,818 INFO L175 Difference]: Start difference. First operand has 96 places, 97 transitions, 201 flow. Second operand 3 states and 263 transitions. [2024-11-24 00:47:29,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 93 transitions, 213 flow [2024-11-24 00:47:29,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 93 transitions, 213 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 00:47:29,827 INFO L231 Difference]: Finished difference. Result has 97 places, 92 transitions, 195 flow [2024-11-24 00:47:29,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=97, PETRI_TRANSITIONS=92} [2024-11-24 00:47:29,834 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 1 predicate places. [2024-11-24 00:47:29,834 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 92 transitions, 195 flow [2024-11-24 00:47:29,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:29,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:29,835 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] [2024-11-24 00:47:29,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 00:47:29,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-24 00:47:29,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:29,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1804585055, now seen corresponding path program 1 times [2024-11-24 00:47:29,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:29,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227031759] [2024-11-24 00:47:29,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:29,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:47:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:47:29,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:47:29,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227031759] [2024-11-24 00:47:29,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227031759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:47:29,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:47:29,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 00:47:29,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040396356] [2024-11-24 00:47:29,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:47:29,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:47:29,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:47:29,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:47:29,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:47:29,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 97 [2024-11-24 00:47:29,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 92 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:29,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:47:29,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 97 [2024-11-24 00:47:29,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:47:30,026 INFO L124 PetriNetUnfolderBase]: 5/170 cut-off events. [2024-11-24 00:47:30,026 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-24 00:47:30,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 170 events. 5/170 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 338 event pairs, 2 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 165. Up to 16 conditions per place. [2024-11-24 00:47:30,027 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 7 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2024-11-24 00:47:30,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 213 flow [2024-11-24 00:47:30,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:47:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:47:30,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2024-11-24 00:47:30,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9140893470790378 [2024-11-24 00:47:30,032 INFO L175 Difference]: Start difference. First operand has 97 places, 92 transitions, 195 flow. Second operand 3 states and 266 transitions. [2024-11-24 00:47:30,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 213 flow [2024-11-24 00:47:30,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 00:47:30,040 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 201 flow [2024-11-24 00:47:30,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2024-11-24 00:47:30,041 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2024-11-24 00:47:30,041 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 201 flow [2024-11-24 00:47:30,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:30,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:30,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:47:30,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 00:47:30,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-24 00:47:30,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:30,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1010716256, now seen corresponding path program 1 times [2024-11-24 00:47:30,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:30,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390822763] [2024-11-24 00:47:30,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:30,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:47:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:47:30,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:47:30,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390822763] [2024-11-24 00:47:30,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390822763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:47:30,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:47:30,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:47:30,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544703010] [2024-11-24 00:47:30,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:47:30,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:47:30,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:47:30,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:47:30,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:47:30,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 97 [2024-11-24 00:47:30,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:30,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:47:30,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 97 [2024-11-24 00:47:30,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:47:30,712 INFO L124 PetriNetUnfolderBase]: 2/148 cut-off events. [2024-11-24 00:47:30,713 INFO L125 PetriNetUnfolderBase]: For 10/16 co-relation queries the response was YES. [2024-11-24 00:47:30,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 148 events. 2/148 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 232 event pairs, 0 based on Foata normal form. 2/144 useless extension candidates. Maximal degree in co-relation 87. Up to 16 conditions per place. [2024-11-24 00:47:30,714 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 11 selfloop transitions, 2 changer transitions 5/97 dead transitions. [2024-11-24 00:47:30,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 247 flow [2024-11-24 00:47:30,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:47:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:47:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 505 transitions. [2024-11-24 00:47:30,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8676975945017182 [2024-11-24 00:47:30,719 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 201 flow. Second operand 6 states and 505 transitions. [2024-11-24 00:47:30,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 247 flow [2024-11-24 00:47:30,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 97 transitions, 247 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 00:47:30,727 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 219 flow [2024-11-24 00:47:30,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=104, PETRI_TRANSITIONS=92} [2024-11-24 00:47:30,728 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 8 predicate places. [2024-11-24 00:47:30,728 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 219 flow [2024-11-24 00:47:30,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:30,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:30,729 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] [2024-11-24 00:47:30,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 00:47:30,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-24 00:47:30,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:30,733 INFO L85 PathProgramCache]: Analyzing trace with hash 909397062, now seen corresponding path program 1 times [2024-11-24 00:47:30,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:30,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339079794] [2024-11-24 00:47:30,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:30,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:47:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:47:31,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:47:31,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339079794] [2024-11-24 00:47:31,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339079794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:47:31,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:47:31,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:47:31,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024536895] [2024-11-24 00:47:31,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:47:31,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:47:31,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:47:31,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:47:31,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:47:31,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 97 [2024-11-24 00:47:31,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:31,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:47:31,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 97 [2024-11-24 00:47:31,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:47:31,965 INFO L124 PetriNetUnfolderBase]: 71/371 cut-off events. [2024-11-24 00:47:31,966 INFO L125 PetriNetUnfolderBase]: For 26/29 co-relation queries the response was YES. [2024-11-24 00:47:31,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 371 events. 71/371 cut-off events. For 26/29 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1763 event pairs, 35 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 531. Up to 151 conditions per place. [2024-11-24 00:47:31,970 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 23 selfloop transitions, 22 changer transitions 0/113 dead transitions. [2024-11-24 00:47:31,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 113 transitions, 351 flow [2024-11-24 00:47:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:47:31,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:47:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 466 transitions. [2024-11-24 00:47:31,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8006872852233677 [2024-11-24 00:47:31,974 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 219 flow. Second operand 6 states and 466 transitions. [2024-11-24 00:47:31,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 113 transitions, 351 flow [2024-11-24 00:47:31,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 113 transitions, 337 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-24 00:47:31,984 INFO L231 Difference]: Finished difference. Result has 106 places, 113 transitions, 355 flow [2024-11-24 00:47:31,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=106, PETRI_TRANSITIONS=113} [2024-11-24 00:47:31,985 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 10 predicate places. [2024-11-24 00:47:31,986 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 113 transitions, 355 flow [2024-11-24 00:47:31,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:31,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:31,987 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] [2024-11-24 00:47:31,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 00:47:31,988 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-24 00:47:31,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:31,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1610277715, now seen corresponding path program 1 times [2024-11-24 00:47:31,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:31,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200643731] [2024-11-24 00:47:31,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:31,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:47:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:47:32,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:47:32,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200643731] [2024-11-24 00:47:32,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200643731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:47:32,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:47:32,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:47:32,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712511330] [2024-11-24 00:47:32,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:47:32,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:47:32,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:47:32,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:47:32,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:47:32,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 97 [2024-11-24 00:47:32,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 113 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:32,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:47:32,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 97 [2024-11-24 00:47:32,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:47:33,099 INFO L124 PetriNetUnfolderBase]: 139/525 cut-off events. [2024-11-24 00:47:33,099 INFO L125 PetriNetUnfolderBase]: For 146/148 co-relation queries the response was YES. [2024-11-24 00:47:33,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 525 events. 139/525 cut-off events. For 146/148 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2736 event pairs, 31 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 1058. Up to 257 conditions per place. [2024-11-24 00:47:33,109 INFO L140 encePairwiseOnDemand]: 82/97 looper letters, 36 selfloop transitions, 48 changer transitions 12/156 dead transitions. [2024-11-24 00:47:33,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 156 transitions, 679 flow [2024-11-24 00:47:33,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:47:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:47:33,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 492 transitions. [2024-11-24 00:47:33,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.845360824742268 [2024-11-24 00:47:33,112 INFO L175 Difference]: Start difference. First operand has 106 places, 113 transitions, 355 flow. Second operand 6 states and 492 transitions. [2024-11-24 00:47:33,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 156 transitions, 679 flow [2024-11-24 00:47:33,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 156 transitions, 679 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 00:47:33,120 INFO L231 Difference]: Finished difference. Result has 116 places, 144 transitions, 712 flow [2024-11-24 00:47:33,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=712, PETRI_PLACES=116, PETRI_TRANSITIONS=144} [2024-11-24 00:47:33,121 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 20 predicate places. [2024-11-24 00:47:33,122 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 144 transitions, 712 flow [2024-11-24 00:47:33,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:33,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:33,123 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] [2024-11-24 00:47:33,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 00:47:33,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-24 00:47:33,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash -288673426, now seen corresponding path program 1 times [2024-11-24 00:47:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:33,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225499292] [2024-11-24 00:47:33,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:33,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:47:33,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:47:33,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:47:33,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225499292] [2024-11-24 00:47:33,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225499292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:47:33,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:47:33,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:47:33,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847109933] [2024-11-24 00:47:33,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:47:33,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:47:33,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:47:33,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:47:33,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:47:33,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 97 [2024-11-24 00:47:33,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 144 transitions, 712 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:33,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:47:33,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 97 [2024-11-24 00:47:33,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:47:34,060 INFO L124 PetriNetUnfolderBase]: 142/515 cut-off events. [2024-11-24 00:47:34,061 INFO L125 PetriNetUnfolderBase]: For 445/451 co-relation queries the response was YES. [2024-11-24 00:47:34,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1587 conditions, 515 events. 142/515 cut-off events. For 445/451 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2850 event pairs, 10 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 1507. Up to 241 conditions per place. [2024-11-24 00:47:34,067 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 73 selfloop transitions, 25 changer transitions 13/172 dead transitions. [2024-11-24 00:47:34,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 172 transitions, 1095 flow [2024-11-24 00:47:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:47:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:47:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 475 transitions. [2024-11-24 00:47:34,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8161512027491409 [2024-11-24 00:47:34,070 INFO L175 Difference]: Start difference. First operand has 116 places, 144 transitions, 712 flow. Second operand 6 states and 475 transitions. [2024-11-24 00:47:34,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 172 transitions, 1095 flow [2024-11-24 00:47:34,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 172 transitions, 1076 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-11-24 00:47:34,088 INFO L231 Difference]: Finished difference. Result has 115 places, 159 transitions, 928 flow [2024-11-24 00:47:34,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=928, PETRI_PLACES=115, PETRI_TRANSITIONS=159} [2024-11-24 00:47:34,090 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 19 predicate places. [2024-11-24 00:47:34,090 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 159 transitions, 928 flow [2024-11-24 00:47:34,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:34,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:34,091 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:47:34,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 00:47:34,091 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-24 00:47:34,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash 795130935, now seen corresponding path program 1 times [2024-11-24 00:47:34,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:34,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194525281] [2024-11-24 00:47:34,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:34,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:47:34,126 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:47:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:47:34,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 00:47:34,168 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 00:47:34,169 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-24 00:47:34,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-24 00:47:34,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-24 00:47:34,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-24 00:47:34,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-24 00:47:34,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-24 00:47:34,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-24 00:47:34,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-24 00:47:34,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-24 00:47:34,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 00:47:34,173 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:47:34,178 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-24 00:47:34,178 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-24 00:47:34,217 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-24 00:47:34,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 119 transitions, 254 flow [2024-11-24 00:47:34,306 INFO L124 PetriNetUnfolderBase]: 11/225 cut-off events. [2024-11-24 00:47:34,306 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-11-24 00:47:34,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 225 events. 11/225 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 500 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 134. Up to 8 conditions per place. [2024-11-24 00:47:34,307 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 119 transitions, 254 flow [2024-11-24 00:47:34,309 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 119 transitions, 254 flow [2024-11-24 00:47:34,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:47:34,313 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@685dbe23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:47:34,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-24 00:47:34,318 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 00:47:34,318 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-11-24 00:47:34,318 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:47:34,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:34,318 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] [2024-11-24 00:47:34,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-24 00:47:34,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:34,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1893871643, now seen corresponding path program 1 times [2024-11-24 00:47:34,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:34,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496947678] [2024-11-24 00:47:34,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:34,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:47:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:47:34,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:47:34,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496947678] [2024-11-24 00:47:34,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496947678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:47:34,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:47:34,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 00:47:34,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928237349] [2024-11-24 00:47:34,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:47:34,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:47:34,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:47:34,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:47:34,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:47:34,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 119 [2024-11-24 00:47:34,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:34,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:47:34,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 119 [2024-11-24 00:47:34,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:47:34,482 INFO L124 PetriNetUnfolderBase]: 19/443 cut-off events. [2024-11-24 00:47:34,483 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-24 00:47:34,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 443 events. 19/443 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1884 event pairs, 16 based on Foata normal form. 10/399 useless extension candidates. Maximal degree in co-relation 289. Up to 50 conditions per place. [2024-11-24 00:47:34,486 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 11 selfloop transitions, 2 changer transitions 1/115 dead transitions. [2024-11-24 00:47:34,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 115 transitions, 272 flow [2024-11-24 00:47:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:47:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:47:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2024-11-24 00:47:34,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-24 00:47:34,489 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 254 flow. Second operand 3 states and 323 transitions. [2024-11-24 00:47:34,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 115 transitions, 272 flow [2024-11-24 00:47:34,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 115 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 00:47:34,492 INFO L231 Difference]: Finished difference. Result has 120 places, 114 transitions, 248 flow [2024-11-24 00:47:34,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=120, PETRI_TRANSITIONS=114} [2024-11-24 00:47:34,494 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 1 predicate places. [2024-11-24 00:47:34,494 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 114 transitions, 248 flow [2024-11-24 00:47:34,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:34,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:34,495 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] [2024-11-24 00:47:34,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 00:47:34,495 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-24 00:47:34,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:34,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1633879359, now seen corresponding path program 1 times [2024-11-24 00:47:34,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:34,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917638804] [2024-11-24 00:47:34,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:34,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:47:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:47:34,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:47:34,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917638804] [2024-11-24 00:47:34,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917638804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:47:34,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:47:34,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 00:47:34,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768936720] [2024-11-24 00:47:34,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:47:34,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:47:34,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:47:34,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:47:34,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:47:34,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 119 [2024-11-24 00:47:34,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 114 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:34,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:47:34,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 119 [2024-11-24 00:47:34,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:47:34,686 INFO L124 PetriNetUnfolderBase]: 48/635 cut-off events. [2024-11-24 00:47:34,686 INFO L125 PetriNetUnfolderBase]: For 45/50 co-relation queries the response was YES. [2024-11-24 00:47:34,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 635 events. 48/635 cut-off events. For 45/50 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3266 event pairs, 28 based on Foata normal form. 0/577 useless extension candidates. Maximal degree in co-relation 729. Up to 97 conditions per place. [2024-11-24 00:47:34,690 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 12 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2024-11-24 00:47:34,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 115 transitions, 285 flow [2024-11-24 00:47:34,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:47:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:47:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2024-11-24 00:47:34,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.907563025210084 [2024-11-24 00:47:34,693 INFO L175 Difference]: Start difference. First operand has 120 places, 114 transitions, 248 flow. Second operand 3 states and 324 transitions. [2024-11-24 00:47:34,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 115 transitions, 285 flow [2024-11-24 00:47:34,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 00:47:34,696 INFO L231 Difference]: Finished difference. Result has 117 places, 114 transitions, 259 flow [2024-11-24 00:47:34,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=117, PETRI_TRANSITIONS=114} [2024-11-24 00:47:34,697 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -2 predicate places. [2024-11-24 00:47:34,697 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 114 transitions, 259 flow [2024-11-24 00:47:34,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:34,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:34,698 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] [2024-11-24 00:47:34,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 00:47:34,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-24 00:47:34,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:34,701 INFO L85 PathProgramCache]: Analyzing trace with hash 171303456, now seen corresponding path program 1 times [2024-11-24 00:47:34,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:34,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134307391] [2024-11-24 00:47:34,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:34,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:47:34,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:47:34,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:47:34,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134307391] [2024-11-24 00:47:34,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134307391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:47:34,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:47:34,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:47:34,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766625673] [2024-11-24 00:47:34,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:47:34,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:47:34,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:47:34,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:47:34,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:47:34,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 119 [2024-11-24 00:47:34,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 114 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:34,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:47:34,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 119 [2024-11-24 00:47:34,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:47:35,097 INFO L124 PetriNetUnfolderBase]: 12/351 cut-off events. [2024-11-24 00:47:35,097 INFO L125 PetriNetUnfolderBase]: For 30/57 co-relation queries the response was YES. [2024-11-24 00:47:35,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 351 events. 12/351 cut-off events. For 30/57 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1194 event pairs, 2 based on Foata normal form. 2/333 useless extension candidates. Maximal degree in co-relation 228. Up to 39 conditions per place. [2024-11-24 00:47:35,100 INFO L140 encePairwiseOnDemand]: 111/119 looper letters, 14 selfloop transitions, 2 changer transitions 5/120 dead transitions. [2024-11-24 00:47:35,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 120 transitions, 313 flow [2024-11-24 00:47:35,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:47:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:47:35,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 628 transitions. [2024-11-24 00:47:35,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8795518207282913 [2024-11-24 00:47:35,105 INFO L175 Difference]: Start difference. First operand has 117 places, 114 transitions, 259 flow. Second operand 6 states and 628 transitions. [2024-11-24 00:47:35,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 120 transitions, 313 flow [2024-11-24 00:47:35,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 120 transitions, 313 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 00:47:35,109 INFO L231 Difference]: Finished difference. Result has 126 places, 115 transitions, 281 flow [2024-11-24 00:47:35,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=281, PETRI_PLACES=126, PETRI_TRANSITIONS=115} [2024-11-24 00:47:35,111 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 7 predicate places. [2024-11-24 00:47:35,111 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 115 transitions, 281 flow [2024-11-24 00:47:35,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:35,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:35,112 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] [2024-11-24 00:47:35,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 00:47:35,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-24 00:47:35,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:35,113 INFO L85 PathProgramCache]: Analyzing trace with hash 69984262, now seen corresponding path program 1 times [2024-11-24 00:47:35,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:35,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615934464] [2024-11-24 00:47:35,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:35,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:47:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:47:35,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:47:35,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615934464] [2024-11-24 00:47:35,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615934464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:47:35,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:47:35,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:47:35,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454675476] [2024-11-24 00:47:35,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:47:35,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:47:35,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:47:35,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:47:35,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:47:35,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 119 [2024-11-24 00:47:35,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 115 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:35,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:47:35,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 119 [2024-11-24 00:47:35,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:47:36,373 INFO L124 PetriNetUnfolderBase]: 1008/3080 cut-off events. [2024-11-24 00:47:36,373 INFO L125 PetriNetUnfolderBase]: For 206/210 co-relation queries the response was YES. [2024-11-24 00:47:36,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5134 conditions, 3080 events. 1008/3080 cut-off events. For 206/210 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 25003 event pairs, 569 based on Foata normal form. 0/2792 useless extension candidates. Maximal degree in co-relation 4551. Up to 1570 conditions per place. [2024-11-24 00:47:36,401 INFO L140 encePairwiseOnDemand]: 104/119 looper letters, 31 selfloop transitions, 38 changer transitions 0/153 dead transitions. [2024-11-24 00:47:36,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 153 transitions, 500 flow [2024-11-24 00:47:36,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:47:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:47:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 585 transitions. [2024-11-24 00:47:36,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.819327731092437 [2024-11-24 00:47:36,404 INFO L175 Difference]: Start difference. First operand has 126 places, 115 transitions, 281 flow. Second operand 6 states and 585 transitions. [2024-11-24 00:47:36,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 153 transitions, 500 flow [2024-11-24 00:47:36,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 153 transitions, 488 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-24 00:47:36,409 INFO L231 Difference]: Finished difference. Result has 129 places, 152 transitions, 523 flow [2024-11-24 00:47:36,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=523, PETRI_PLACES=129, PETRI_TRANSITIONS=152} [2024-11-24 00:47:36,410 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places. [2024-11-24 00:47:36,411 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 152 transitions, 523 flow [2024-11-24 00:47:36,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.5) internal successors, (525), 6 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:36,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:36,412 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] [2024-11-24 00:47:36,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 00:47:36,412 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-24 00:47:36,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:36,413 INFO L85 PathProgramCache]: Analyzing trace with hash -763620776, now seen corresponding path program 1 times [2024-11-24 00:47:36,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:36,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046427064] [2024-11-24 00:47:36,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:36,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:47:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:47:36,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:47:36,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046427064] [2024-11-24 00:47:36,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046427064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:47:36,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:47:36,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:47:36,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898331910] [2024-11-24 00:47:36,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:47:36,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:47:36,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:47:36,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:47:36,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:47:37,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 119 [2024-11-24 00:47:37,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 152 transitions, 523 flow. Second operand has 6 states, 6 states have (on average 90.5) internal successors, (543), 6 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:37,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:47:37,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 119 [2024-11-24 00:47:37,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:47:38,629 INFO L124 PetriNetUnfolderBase]: 2550/7162 cut-off events. [2024-11-24 00:47:38,629 INFO L125 PetriNetUnfolderBase]: For 1962/2596 co-relation queries the response was YES. [2024-11-24 00:47:38,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15511 conditions, 7162 events. 2550/7162 cut-off events. For 1962/2596 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 65775 event pairs, 638 based on Foata normal form. 22/6588 useless extension candidates. Maximal degree in co-relation 13018. Up to 3080 conditions per place. [2024-11-24 00:47:38,708 INFO L140 encePairwiseOnDemand]: 100/119 looper letters, 87 selfloop transitions, 86 changer transitions 0/262 dead transitions. [2024-11-24 00:47:38,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 262 transitions, 1353 flow [2024-11-24 00:47:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:47:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:47:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 630 transitions. [2024-11-24 00:47:38,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2024-11-24 00:47:38,711 INFO L175 Difference]: Start difference. First operand has 129 places, 152 transitions, 523 flow. Second operand 6 states and 630 transitions. [2024-11-24 00:47:38,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 262 transitions, 1353 flow [2024-11-24 00:47:38,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 262 transitions, 1353 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 00:47:38,736 INFO L231 Difference]: Finished difference. Result has 138 places, 235 transitions, 1249 flow [2024-11-24 00:47:38,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1249, PETRI_PLACES=138, PETRI_TRANSITIONS=235} [2024-11-24 00:47:38,738 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2024-11-24 00:47:38,738 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 235 transitions, 1249 flow [2024-11-24 00:47:38,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.5) internal successors, (543), 6 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:38,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:38,739 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] [2024-11-24 00:47:38,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 00:47:38,740 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-24 00:47:38,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1599829817, now seen corresponding path program 1 times [2024-11-24 00:47:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:38,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126314473] [2024-11-24 00:47:38,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:38,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:47:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:47:39,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:47:39,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126314473] [2024-11-24 00:47:39,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126314473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:47:39,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:47:39,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:47:39,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412039049] [2024-11-24 00:47:39,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:47:39,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:47:39,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:47:39,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:47:39,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:47:39,513 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 119 [2024-11-24 00:47:39,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 235 transitions, 1249 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:39,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:47:39,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 119 [2024-11-24 00:47:39,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:47:41,372 INFO L124 PetriNetUnfolderBase]: 3067/8904 cut-off events. [2024-11-24 00:47:41,373 INFO L125 PetriNetUnfolderBase]: For 7034/7435 co-relation queries the response was YES. [2024-11-24 00:47:41,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24652 conditions, 8904 events. 3067/8904 cut-off events. For 7034/7435 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 88754 event pairs, 526 based on Foata normal form. 30/8345 useless extension candidates. Maximal degree in co-relation 23673. Up to 4183 conditions per place. [2024-11-24 00:47:41,468 INFO L140 encePairwiseOnDemand]: 104/119 looper letters, 135 selfloop transitions, 71 changer transitions 0/303 dead transitions. [2024-11-24 00:47:41,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 303 transitions, 2105 flow [2024-11-24 00:47:41,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:47:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:47:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 596 transitions. [2024-11-24 00:47:41,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.834733893557423 [2024-11-24 00:47:41,471 INFO L175 Difference]: Start difference. First operand has 138 places, 235 transitions, 1249 flow. Second operand 6 states and 596 transitions. [2024-11-24 00:47:41,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 303 transitions, 2105 flow [2024-11-24 00:47:41,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 303 transitions, 2087 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-24 00:47:41,525 INFO L231 Difference]: Finished difference. Result has 148 places, 301 transitions, 2011 flow [2024-11-24 00:47:41,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2011, PETRI_PLACES=148, PETRI_TRANSITIONS=301} [2024-11-24 00:47:41,528 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 29 predicate places. [2024-11-24 00:47:41,528 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 301 transitions, 2011 flow [2024-11-24 00:47:41,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:41,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:41,529 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:47:41,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 00:47:41,529 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-24 00:47:41,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:41,530 INFO L85 PathProgramCache]: Analyzing trace with hash -926515654, now seen corresponding path program 1 times [2024-11-24 00:47:41,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:41,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615107907] [2024-11-24 00:47:41,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:41,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:47:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:47:42,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:47:42,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615107907] [2024-11-24 00:47:42,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615107907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:47:42,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:47:42,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:47:42,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289001503] [2024-11-24 00:47:42,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:47:42,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 00:47:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:47:42,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 00:47:42,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:47:43,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 119 [2024-11-24 00:47:43,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 301 transitions, 2011 flow. Second operand has 11 states, 11 states have (on average 80.18181818181819) internal successors, (882), 11 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:43,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:47:43,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 119 [2024-11-24 00:47:43,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:47:45,455 INFO L124 PetriNetUnfolderBase]: 3384/9654 cut-off events. [2024-11-24 00:47:45,455 INFO L125 PetriNetUnfolderBase]: For 13385/14074 co-relation queries the response was YES. [2024-11-24 00:47:45,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30640 conditions, 9654 events. 3384/9654 cut-off events. For 13385/14074 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 96701 event pairs, 480 based on Foata normal form. 148/9227 useless extension candidates. Maximal degree in co-relation 29367. Up to 3017 conditions per place. [2024-11-24 00:47:45,536 INFO L140 encePairwiseOnDemand]: 105/119 looper letters, 310 selfloop transitions, 36 changer transitions 0/432 dead transitions. [2024-11-24 00:47:45,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 432 transitions, 3905 flow [2024-11-24 00:47:45,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 00:47:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-24 00:47:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1100 transitions. [2024-11-24 00:47:45,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7110536522301228 [2024-11-24 00:47:45,542 INFO L175 Difference]: Start difference. First operand has 148 places, 301 transitions, 2011 flow. Second operand 13 states and 1100 transitions. [2024-11-24 00:47:45,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 432 transitions, 3905 flow [2024-11-24 00:47:45,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 432 transitions, 3765 flow, removed 70 selfloop flow, removed 0 redundant places. [2024-11-24 00:47:45,614 INFO L231 Difference]: Finished difference. Result has 159 places, 300 transitions, 1939 flow [2024-11-24 00:47:45,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1939, PETRI_PLACES=159, PETRI_TRANSITIONS=300} [2024-11-24 00:47:45,615 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 40 predicate places. [2024-11-24 00:47:45,616 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 300 transitions, 1939 flow [2024-11-24 00:47:45,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 80.18181818181819) internal successors, (882), 11 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:45,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:45,617 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:47:45,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 00:47:45,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-24 00:47:45,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:45,618 INFO L85 PathProgramCache]: Analyzing trace with hash -438510282, now seen corresponding path program 1 times [2024-11-24 00:47:45,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:45,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989114885] [2024-11-24 00:47:45,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:45,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:47:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:47:46,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:47:46,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989114885] [2024-11-24 00:47:46,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989114885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:47:46,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:47:46,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:47:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642271424] [2024-11-24 00:47:46,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:47:46,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 00:47:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:47:46,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 00:47:46,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:47:47,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 119 [2024-11-24 00:47:47,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 300 transitions, 1939 flow. Second operand has 11 states, 11 states have (on average 81.0) internal successors, (891), 11 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:47,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:47:47,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 119 [2024-11-24 00:47:47,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:47:50,148 INFO L124 PetriNetUnfolderBase]: 5302/13431 cut-off events. [2024-11-24 00:47:50,148 INFO L125 PetriNetUnfolderBase]: For 18976/22277 co-relation queries the response was YES. [2024-11-24 00:47:50,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45104 conditions, 13431 events. 5302/13431 cut-off events. For 18976/22277 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 132464 event pairs, 730 based on Foata normal form. 397/13257 useless extension candidates. Maximal degree in co-relation 41094. Up to 3237 conditions per place. [2024-11-24 00:47:50,267 INFO L140 encePairwiseOnDemand]: 100/119 looper letters, 342 selfloop transitions, 262 changer transitions 6/691 dead transitions. [2024-11-24 00:47:50,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 691 transitions, 6043 flow [2024-11-24 00:47:50,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-24 00:47:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-24 00:47:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1614 transitions. [2024-11-24 00:47:50,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7535014005602241 [2024-11-24 00:47:50,275 INFO L175 Difference]: Start difference. First operand has 159 places, 300 transitions, 1939 flow. Second operand 18 states and 1614 transitions. [2024-11-24 00:47:50,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 691 transitions, 6043 flow [2024-11-24 00:47:50,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 691 transitions, 5899 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-24 00:47:50,393 INFO L231 Difference]: Finished difference. Result has 174 places, 506 transitions, 4575 flow [2024-11-24 00:47:50,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1867, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4575, PETRI_PLACES=174, PETRI_TRANSITIONS=506} [2024-11-24 00:47:50,395 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 55 predicate places. [2024-11-24 00:47:50,395 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 506 transitions, 4575 flow [2024-11-24 00:47:50,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.0) internal successors, (891), 11 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:50,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:50,396 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] [2024-11-24 00:47:50,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 00:47:50,396 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-24 00:47:50,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:50,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1017524750, now seen corresponding path program 1 times [2024-11-24 00:47:50,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:50,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608773693] [2024-11-24 00:47:50,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:50,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:47:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:47:51,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:47:51,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608773693] [2024-11-24 00:47:51,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608773693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:47:51,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:47:51,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:47:51,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771483013] [2024-11-24 00:47:51,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:47:51,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 00:47:51,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:47:51,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 00:47:51,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:47:52,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 119 [2024-11-24 00:47:52,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 506 transitions, 4575 flow. Second operand has 11 states, 11 states have (on average 81.81818181818181) internal successors, (900), 11 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:52,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:47:52,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 119 [2024-11-24 00:47:52,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:47:54,569 INFO L124 PetriNetUnfolderBase]: 4490/12052 cut-off events. [2024-11-24 00:47:54,569 INFO L125 PetriNetUnfolderBase]: For 34787/35799 co-relation queries the response was YES. [2024-11-24 00:47:54,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48081 conditions, 12052 events. 4490/12052 cut-off events. For 34787/35799 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 121190 event pairs, 435 based on Foata normal form. 264/11741 useless extension candidates. Maximal degree in co-relation 46702. Up to 3249 conditions per place. [2024-11-24 00:47:54,659 INFO L140 encePairwiseOnDemand]: 105/119 looper letters, 495 selfloop transitions, 44 changer transitions 0/658 dead transitions. [2024-11-24 00:47:54,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 658 transitions, 7538 flow [2024-11-24 00:47:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-24 00:47:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-24 00:47:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1124 transitions. [2024-11-24 00:47:54,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7265675500969618 [2024-11-24 00:47:54,664 INFO L175 Difference]: Start difference. First operand has 174 places, 506 transitions, 4575 flow. Second operand 13 states and 1124 transitions. [2024-11-24 00:47:54,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 658 transitions, 7538 flow [2024-11-24 00:47:55,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 658 transitions, 7460 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-11-24 00:47:55,065 INFO L231 Difference]: Finished difference. Result has 180 places, 505 transitions, 4589 flow [2024-11-24 00:47:55,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=4501, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4589, PETRI_PLACES=180, PETRI_TRANSITIONS=505} [2024-11-24 00:47:55,067 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 61 predicate places. [2024-11-24 00:47:55,067 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 505 transitions, 4589 flow [2024-11-24 00:47:55,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.81818181818181) internal successors, (900), 11 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:55,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:47:55,068 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:47:55,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-24 00:47:55,069 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-24 00:47:55,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:47:55,069 INFO L85 PathProgramCache]: Analyzing trace with hash -953097248, now seen corresponding path program 1 times [2024-11-24 00:47:55,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:47:55,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114343481] [2024-11-24 00:47:55,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:47:55,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:47:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:47:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-24 00:47:55,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:47:55,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114343481] [2024-11-24 00:47:55,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114343481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:47:55,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:47:55,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:47:55,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796313125] [2024-11-24 00:47:55,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:47:55,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:47:55,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:47:55,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:47:55,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:47:55,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 119 [2024-11-24 00:47:55,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 505 transitions, 4589 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:47:55,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:47:55,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 119 [2024-11-24 00:47:55,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:47:57,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([365] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread2of2ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread2of2ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_5, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_9} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_5, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_9} AuxVars[] AssignedVars[#race][333], [Black: 125#true, 161#true, Black: 131#(= |ULTIMATE.start_main_~i~1#1| 0), 118#true, 265#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), Black: 143#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 144#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 142#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 96#L1037-1true, Black: 154#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 204#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), Black: 156#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 153#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), 120#true, Black: 155#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 225#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 208#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 205#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 199#true, Black: 221#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 206#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 207#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 219#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 223#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (not (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 0)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 163#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 209#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), 151#true, 38#L1023-7true, 140#true, 241#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), 31#L1023-11true, 127#(= |#race~datas~0| 0)]) [2024-11-24 00:47:57,280 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2024-11-24 00:47:57,280 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-24 00:47:57,280 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-24 00:47:57,280 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-24 00:48:00,372 INFO L124 PetriNetUnfolderBase]: 9977/22482 cut-off events. [2024-11-24 00:48:00,372 INFO L125 PetriNetUnfolderBase]: For 76235/77354 co-relation queries the response was YES. [2024-11-24 00:48:00,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91924 conditions, 22482 events. 9977/22482 cut-off events. For 76235/77354 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 228610 event pairs, 1239 based on Foata normal form. 11/21301 useless extension candidates. Maximal degree in co-relation 89860. Up to 11546 conditions per place. [2024-11-24 00:48:00,528 INFO L140 encePairwiseOnDemand]: 100/119 looper letters, 363 selfloop transitions, 352 changer transitions 15/862 dead transitions. [2024-11-24 00:48:00,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 862 transitions, 9423 flow [2024-11-24 00:48:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:48:00,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:48:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2024-11-24 00:48:00,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.876750700280112 [2024-11-24 00:48:00,531 INFO L175 Difference]: Start difference. First operand has 180 places, 505 transitions, 4589 flow. Second operand 6 states and 626 transitions. [2024-11-24 00:48:00,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 862 transitions, 9423 flow [2024-11-24 00:48:00,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 862 transitions, 9187 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-24 00:48:00,925 INFO L231 Difference]: Finished difference. Result has 177 places, 777 transitions, 8304 flow [2024-11-24 00:48:00,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=4501, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8304, PETRI_PLACES=177, PETRI_TRANSITIONS=777} [2024-11-24 00:48:00,926 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 58 predicate places. [2024-11-24 00:48:00,926 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 777 transitions, 8304 flow [2024-11-24 00:48:00,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:00,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:00,927 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:48:00,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-24 00:48:00,927 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-24 00:48:00,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:00,928 INFO L85 PathProgramCache]: Analyzing trace with hash 199029583, now seen corresponding path program 1 times [2024-11-24 00:48:00,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:00,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132295751] [2024-11-24 00:48:00,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:00,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:48:00,965 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 00:48:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 00:48:00,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 00:48:00,994 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 00:48:00,994 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-24 00:48:00,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-24 00:48:00,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-24 00:48:00,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-24 00:48:00,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-24 00:48:00,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-24 00:48:00,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-24 00:48:00,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-24 00:48:00,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-24 00:48:00,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-24 00:48:00,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-24 00:48:00,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-24 00:48:00,996 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:48:00,997 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-24 00:48:00,997 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-24 00:48:01,042 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-24 00:48:01,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 141 transitions, 309 flow [2024-11-24 00:48:01,106 INFO L124 PetriNetUnfolderBase]: 21/371 cut-off events. [2024-11-24 00:48:01,106 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2024-11-24 00:48:01,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 371 events. 21/371 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1032 event pairs, 1 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 233. Up to 16 conditions per place. [2024-11-24 00:48:01,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 141 transitions, 309 flow [2024-11-24 00:48:01,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 141 transitions, 309 flow [2024-11-24 00:48:01,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 00:48:01,116 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@685dbe23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 00:48:01,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-24 00:48:01,119 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 00:48:01,120 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-11-24 00:48:01,120 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 00:48:01,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:01,120 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] [2024-11-24 00:48:01,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-24 00:48:01,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:01,121 INFO L85 PathProgramCache]: Analyzing trace with hash 719946440, now seen corresponding path program 1 times [2024-11-24 00:48:01,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:01,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069394603] [2024-11-24 00:48:01,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:01,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:48:01,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:01,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069394603] [2024-11-24 00:48:01,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069394603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:01,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:01,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 00:48:01,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404637214] [2024-11-24 00:48:01,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:01,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:48:01,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:01,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:48:01,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:48:01,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 141 [2024-11-24 00:48:01,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 141 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:01,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:01,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 141 [2024-11-24 00:48:01,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:01,380 INFO L124 PetriNetUnfolderBase]: 90/1263 cut-off events. [2024-11-24 00:48:01,380 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2024-11-24 00:48:01,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 1263 events. 90/1263 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 8327 event pairs, 81 based on Foata normal form. 25/1128 useless extension candidates. Maximal degree in co-relation 880. Up to 178 conditions per place. [2024-11-24 00:48:01,388 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 14 selfloop transitions, 2 changer transitions 1/137 dead transitions. [2024-11-24 00:48:01,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 333 flow [2024-11-24 00:48:01,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:48:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:48:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2024-11-24 00:48:01,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9054373522458629 [2024-11-24 00:48:01,392 INFO L175 Difference]: Start difference. First operand has 142 places, 141 transitions, 309 flow. Second operand 3 states and 383 transitions. [2024-11-24 00:48:01,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 333 flow [2024-11-24 00:48:01,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 137 transitions, 333 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 00:48:01,395 INFO L231 Difference]: Finished difference. Result has 143 places, 136 transitions, 303 flow [2024-11-24 00:48:01,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=303, PETRI_PLACES=143, PETRI_TRANSITIONS=136} [2024-11-24 00:48:01,396 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 1 predicate places. [2024-11-24 00:48:01,397 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 136 transitions, 303 flow [2024-11-24 00:48:01,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:01,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:01,397 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] [2024-11-24 00:48:01,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-24 00:48:01,398 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-24 00:48:01,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:01,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1852772129, now seen corresponding path program 1 times [2024-11-24 00:48:01,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:01,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833101352] [2024-11-24 00:48:01,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:01,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:48:01,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:01,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833101352] [2024-11-24 00:48:01,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833101352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:01,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:01,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 00:48:01,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812596311] [2024-11-24 00:48:01,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:01,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 00:48:01,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:01,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 00:48:01,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 00:48:01,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 141 [2024-11-24 00:48:01,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 136 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:01,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:01,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 141 [2024-11-24 00:48:01,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:01,800 INFO L124 PetriNetUnfolderBase]: 307/2366 cut-off events. [2024-11-24 00:48:01,800 INFO L125 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2024-11-24 00:48:01,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2988 conditions, 2366 events. 307/2366 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 19090 event pairs, 207 based on Foata normal form. 0/2153 useless extension candidates. Maximal degree in co-relation 2954. Up to 508 conditions per place. [2024-11-24 00:48:01,815 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 17 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2024-11-24 00:48:01,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 138 transitions, 361 flow [2024-11-24 00:48:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 00:48:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 00:48:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2024-11-24 00:48:01,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9030732860520094 [2024-11-24 00:48:01,817 INFO L175 Difference]: Start difference. First operand has 143 places, 136 transitions, 303 flow. Second operand 3 states and 382 transitions. [2024-11-24 00:48:01,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 138 transitions, 361 flow [2024-11-24 00:48:01,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 138 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 00:48:01,821 INFO L231 Difference]: Finished difference. Result has 139 places, 136 transitions, 319 flow [2024-11-24 00:48:01,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=139, PETRI_TRANSITIONS=136} [2024-11-24 00:48:01,822 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, -3 predicate places. [2024-11-24 00:48:01,822 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 136 transitions, 319 flow [2024-11-24 00:48:01,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:01,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:01,823 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] [2024-11-24 00:48:01,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-24 00:48:01,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-24 00:48:01,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash -426281120, now seen corresponding path program 1 times [2024-11-24 00:48:01,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:01,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534897519] [2024-11-24 00:48:01,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:01,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:48:01,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:01,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534897519] [2024-11-24 00:48:01,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534897519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:01,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:01,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:48:01,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741958617] [2024-11-24 00:48:01,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:01,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 00:48:01,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:01,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 00:48:01,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-24 00:48:02,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 141 [2024-11-24 00:48:02,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 136 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:02,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:02,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 141 [2024-11-24 00:48:02,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:02,287 INFO L124 PetriNetUnfolderBase]: 50/857 cut-off events. [2024-11-24 00:48:02,287 INFO L125 PetriNetUnfolderBase]: For 85/134 co-relation queries the response was YES. [2024-11-24 00:48:02,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 857 events. 50/857 cut-off events. For 85/134 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4718 event pairs, 17 based on Foata normal form. 2/799 useless extension candidates. Maximal degree in co-relation 603. Up to 98 conditions per place. [2024-11-24 00:48:02,293 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 16 selfloop transitions, 2 changer transitions 5/142 dead transitions. [2024-11-24 00:48:02,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 142 transitions, 377 flow [2024-11-24 00:48:02,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:48:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:48:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2024-11-24 00:48:02,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8865248226950354 [2024-11-24 00:48:02,296 INFO L175 Difference]: Start difference. First operand has 139 places, 136 transitions, 319 flow. Second operand 6 states and 750 transitions. [2024-11-24 00:48:02,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 142 transitions, 377 flow [2024-11-24 00:48:02,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 142 transitions, 377 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 00:48:02,300 INFO L231 Difference]: Finished difference. Result has 148 places, 137 transitions, 341 flow [2024-11-24 00:48:02,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=341, PETRI_PLACES=148, PETRI_TRANSITIONS=137} [2024-11-24 00:48:02,301 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 6 predicate places. [2024-11-24 00:48:02,301 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 137 transitions, 341 flow [2024-11-24 00:48:02,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:02,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:02,302 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] [2024-11-24 00:48:02,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-24 00:48:02,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-24 00:48:02,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:02,303 INFO L85 PathProgramCache]: Analyzing trace with hash -527600314, now seen corresponding path program 1 times [2024-11-24 00:48:02,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:02,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480020944] [2024-11-24 00:48:02,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:02,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:48:02,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:02,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480020944] [2024-11-24 00:48:02,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480020944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:02,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:02,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:48:02,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296036040] [2024-11-24 00:48:02,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:02,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:48:02,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:02,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:48:02,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:48:02,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 141 [2024-11-24 00:48:02,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 341 flow. Second operand has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:02,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:02,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 141 [2024-11-24 00:48:02,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:06,721 INFO L124 PetriNetUnfolderBase]: 10319/23676 cut-off events. [2024-11-24 00:48:06,721 INFO L125 PetriNetUnfolderBase]: For 2022/2078 co-relation queries the response was YES. [2024-11-24 00:48:06,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40691 conditions, 23676 events. 10319/23676 cut-off events. For 2022/2078 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 240381 event pairs, 6820 based on Foata normal form. 0/21705 useless extension candidates. Maximal degree in co-relation 35539. Up to 14041 conditions per place. [2024-11-24 00:48:06,835 INFO L140 encePairwiseOnDemand]: 122/141 looper letters, 38 selfloop transitions, 54 changer transitions 0/192 dead transitions. [2024-11-24 00:48:06,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 192 transitions, 647 flow [2024-11-24 00:48:06,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:48:06,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:48:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 704 transitions. [2024-11-24 00:48:06,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8321513002364066 [2024-11-24 00:48:06,838 INFO L175 Difference]: Start difference. First operand has 148 places, 137 transitions, 341 flow. Second operand 6 states and 704 transitions. [2024-11-24 00:48:06,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 192 transitions, 647 flow [2024-11-24 00:48:06,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 192 transitions, 635 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-24 00:48:06,849 INFO L231 Difference]: Finished difference. Result has 151 places, 190 transitions, 687 flow [2024-11-24 00:48:06,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=687, PETRI_PLACES=151, PETRI_TRANSITIONS=190} [2024-11-24 00:48:06,849 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 9 predicate places. [2024-11-24 00:48:06,850 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 190 transitions, 687 flow [2024-11-24 00:48:06,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:06,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:06,850 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] [2024-11-24 00:48:06,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-24 00:48:06,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-24 00:48:06,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:06,851 INFO L85 PathProgramCache]: Analyzing trace with hash 80182873, now seen corresponding path program 1 times [2024-11-24 00:48:06,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:06,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598889551] [2024-11-24 00:48:06,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:06,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:48:07,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598889551] [2024-11-24 00:48:07,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598889551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:07,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:07,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:48:07,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998948775] [2024-11-24 00:48:07,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:07,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:48:07,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:07,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:48:07,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:48:07,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 141 [2024-11-24 00:48:07,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 190 transitions, 687 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:07,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:07,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 141 [2024-11-24 00:48:07,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:12,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([486] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][291], [139#true, 110#L1032-8true, 137#L1023-11true, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 174#true, 119#L1023-7true, 150#(= |#race~datas~0| 0), 38#L1023-7true, 143#true, 141#true, Black: 148#true, 163#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-24 00:48:12,560 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2024-11-24 00:48:12,560 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-24 00:48:12,561 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-24 00:48:12,561 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-24 00:48:12,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([486] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][291], [139#true, 110#L1032-8true, 137#L1023-11true, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 174#true, 10#L1023-8true, 150#(= |#race~datas~0| 0), 38#L1023-7true, 143#true, 141#true, Black: 148#true, 163#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-24 00:48:12,849 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2024-11-24 00:48:12,849 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-11-24 00:48:12,849 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-11-24 00:48:12,849 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-11-24 00:48:13,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([486] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][291], [139#true, 110#L1032-8true, 137#L1023-11true, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 174#true, 150#(= |#race~datas~0| 0), 65#L1023-9true, 38#L1023-7true, 143#true, 141#true, Black: 148#true, 163#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-24 00:48:13,118 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2024-11-24 00:48:13,118 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-24 00:48:13,118 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-24 00:48:13,118 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-24 00:48:13,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([486] L1023-6-->L1023-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_9 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_9, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][291], [139#true, 110#L1032-8true, 137#L1023-11true, Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), 174#true, 150#(= |#race~datas~0| 0), 38#L1023-7true, 143#true, 141#true, Black: 148#true, 68#L1023-10true, 163#true, Black: 154#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-24 00:48:13,372 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is cut-off event [2024-11-24 00:48:13,372 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-24 00:48:13,372 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-24 00:48:13,372 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-24 00:48:16,946 INFO L124 PetriNetUnfolderBase]: 30375/69952 cut-off events. [2024-11-24 00:48:16,946 INFO L125 PetriNetUnfolderBase]: For 20516/26301 co-relation queries the response was YES. [2024-11-24 00:48:17,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156788 conditions, 69952 events. 30375/69952 cut-off events. For 20516/26301 co-relation queries the response was YES. Maximal size of possible extension queue 2146. Compared 807185 event pairs, 7860 based on Foata normal form. 109/64395 useless extension candidates. Maximal degree in co-relation 128417. Up to 30576 conditions per place. [2024-11-24 00:48:17,435 INFO L140 encePairwiseOnDemand]: 118/141 looper letters, 129 selfloop transitions, 118 changer transitions 0/352 dead transitions. [2024-11-24 00:48:17,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 352 transitions, 1953 flow [2024-11-24 00:48:17,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:48:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:48:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 756 transitions. [2024-11-24 00:48:17,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8936170212765957 [2024-11-24 00:48:17,437 INFO L175 Difference]: Start difference. First operand has 151 places, 190 transitions, 687 flow. Second operand 6 states and 756 transitions. [2024-11-24 00:48:17,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 352 transitions, 1953 flow [2024-11-24 00:48:17,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 352 transitions, 1953 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 00:48:17,562 INFO L231 Difference]: Finished difference. Result has 160 places, 307 transitions, 1760 flow [2024-11-24 00:48:17,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1760, PETRI_PLACES=160, PETRI_TRANSITIONS=307} [2024-11-24 00:48:17,563 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 18 predicate places. [2024-11-24 00:48:17,563 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 307 transitions, 1760 flow [2024-11-24 00:48:17,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:17,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:17,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:48:17,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-24 00:48:17,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-24 00:48:17,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:17,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1058089574, now seen corresponding path program 1 times [2024-11-24 00:48:17,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:17,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072062736] [2024-11-24 00:48:17,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:17,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:48:17,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:17,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072062736] [2024-11-24 00:48:17,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072062736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:17,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:17,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 00:48:17,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516758583] [2024-11-24 00:48:17,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:17,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 00:48:17,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:17,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 00:48:17,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-24 00:48:18,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 141 [2024-11-24 00:48:18,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 307 transitions, 1760 flow. Second operand has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:18,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:18,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 141 [2024-11-24 00:48:18,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 00:48:30,711 INFO L124 PetriNetUnfolderBase]: 35350/83214 cut-off events. [2024-11-24 00:48:30,711 INFO L125 PetriNetUnfolderBase]: For 74679/80004 co-relation queries the response was YES. [2024-11-24 00:48:30,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242630 conditions, 83214 events. 35350/83214 cut-off events. For 74679/80004 co-relation queries the response was YES. Maximal size of possible extension queue 2597. Compared 1009433 event pairs, 8911 based on Foata normal form. 242/77680 useless extension candidates. Maximal degree in co-relation 232718. Up to 43547 conditions per place. [2024-11-24 00:48:31,270 INFO L140 encePairwiseOnDemand]: 122/141 looper letters, 192 selfloop transitions, 110 changer transitions 0/415 dead transitions. [2024-11-24 00:48:31,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 415 transitions, 3092 flow [2024-11-24 00:48:31,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 00:48:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 00:48:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2024-11-24 00:48:31,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8451536643026005 [2024-11-24 00:48:31,272 INFO L175 Difference]: Start difference. First operand has 160 places, 307 transitions, 1760 flow. Second operand 6 states and 715 transitions. [2024-11-24 00:48:31,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 415 transitions, 3092 flow [2024-11-24 00:48:31,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 415 transitions, 3074 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-24 00:48:31,807 INFO L231 Difference]: Finished difference. Result has 170 places, 412 transitions, 2987 flow [2024-11-24 00:48:31,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1742, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2987, PETRI_PLACES=170, PETRI_TRANSITIONS=412} [2024-11-24 00:48:31,808 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 28 predicate places. [2024-11-24 00:48:31,808 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 412 transitions, 2987 flow [2024-11-24 00:48:31,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:31,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 00:48:31,809 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 00:48:31,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-24 00:48:31,809 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-24 00:48:31,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 00:48:31,809 INFO L85 PathProgramCache]: Analyzing trace with hash -619387269, now seen corresponding path program 1 times [2024-11-24 00:48:31,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 00:48:31,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819755707] [2024-11-24 00:48:31,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 00:48:31,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 00:48:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 00:48:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 00:48:32,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 00:48:32,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819755707] [2024-11-24 00:48:32,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819755707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 00:48:32,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 00:48:32,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 00:48:32,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681660531] [2024-11-24 00:48:32,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 00:48:32,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-24 00:48:32,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 00:48:32,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-24 00:48:32,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-24 00:48:33,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 141 [2024-11-24 00:48:33,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 412 transitions, 2987 flow. Second operand has 11 states, 11 states have (on average 96.18181818181819) internal successors, (1058), 11 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 00:48:33,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 00:48:33,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 141 [2024-11-24 00:48:33,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand