./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_224aa2b8-6c14-426b-ba12-9d8a7675e49c/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_224aa2b8-6c14-426b-ba12-9d8a7675e49c/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_224aa2b8-6c14-426b-ba12-9d8a7675e49c/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_224aa2b8-6c14-426b-ba12-9d8a7675e49c/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_224aa2b8-6c14-426b-ba12-9d8a7675e49c/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_224aa2b8-6c14-426b-ba12-9d8a7675e49c/bin/uautomizer-verify-aQ6SnzHsRB --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 a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:19:48,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:19:48,983 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_224aa2b8-6c14-426b-ba12-9d8a7675e49c/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-27 20:19:48,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:19:48,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:19:49,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:19:49,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:19:49,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:19:49,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:19:49,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:19:49,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:19:49,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:19:49,022 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:19:49,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:19:49,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:19:49,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:19:49,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:19:49,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:19:49,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:19:49,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:19:49,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:19:49,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:19:49,024 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-27 20:19:49,024 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:19:49,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:19:49,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:19:49,025 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:19:49,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:19:49,026 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:19:49,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:19:49,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:19:49,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:19:49,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:19:49,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:19:49,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:19:49,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:19:49,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:19:49,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:19:49,027 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:19:49,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:19:49,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:19:49,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:19:49,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:19:49,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:19:49,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:19:49,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:19:49,027 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_224aa2b8-6c14-426b-ba12-9d8a7675e49c/bin/uautomizer-verify-aQ6SnzHsRB 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 -> a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 [2024-11-27 20:19:49,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:19:49,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:19:49,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:19:49,379 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:19:49,380 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:19:49,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_224aa2b8-6c14-426b-ba12-9d8a7675e49c/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2024-11-27 20:19:52,578 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_224aa2b8-6c14-426b-ba12-9d8a7675e49c/bin/uautomizer-verify-aQ6SnzHsRB/data/4cdfe4ca0/f75461e6f0bd40d4b8af3cae5ed8063b/FLAG45720fec5 [2024-11-27 20:19:53,043 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:19:53,044 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_224aa2b8-6c14-426b-ba12-9d8a7675e49c/sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2024-11-27 20:19:53,070 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_224aa2b8-6c14-426b-ba12-9d8a7675e49c/bin/uautomizer-verify-aQ6SnzHsRB/data/4cdfe4ca0/f75461e6f0bd40d4b8af3cae5ed8063b/FLAG45720fec5 [2024-11-27 20:19:53,096 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_224aa2b8-6c14-426b-ba12-9d8a7675e49c/bin/uautomizer-verify-aQ6SnzHsRB/data/4cdfe4ca0/f75461e6f0bd40d4b8af3cae5ed8063b [2024-11-27 20:19:53,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:19:53,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:19:53,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:19:53,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:19:53,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:19:53,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:19:53" (1/1) ... [2024-11-27 20:19:53,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48864999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:53, skipping insertion in model container [2024-11-27 20:19:53,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:19:53" (1/1) ... [2024-11-27 20:19:53,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:19:53,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:19:53,662 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:19:53,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:19:53,819 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:19:53,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:53 WrapperNode [2024-11-27 20:19:53,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:19:53,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:19:53,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:19:53,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:19:53,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:53" (1/1) ... [2024-11-27 20:19:53,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:53" (1/1) ... [2024-11-27 20:19:53,903 INFO L138 Inliner]: procedures = 174, calls = 45, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 167 [2024-11-27 20:19:53,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:19:53,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:19:53,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:19:53,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:19:53,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:53" (1/1) ... [2024-11-27 20:19:53,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:53" (1/1) ... [2024-11-27 20:19:53,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:53" (1/1) ... [2024-11-27 20:19:53,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:53" (1/1) ... [2024-11-27 20:19:53,947 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:53" (1/1) ... [2024-11-27 20:19:53,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:53" (1/1) ... [2024-11-27 20:19:53,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:53" (1/1) ... [2024-11-27 20:19:53,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:53" (1/1) ... [2024-11-27 20:19:53,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:53" (1/1) ... [2024-11-27 20:19:53,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:19:53,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:19:53,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:19:53,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:19:53,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:53" (1/1) ... [2024-11-27 20:19:53,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:19:54,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_224aa2b8-6c14-426b-ba12-9d8a7675e49c/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:19:54,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_224aa2b8-6c14-426b-ba12-9d8a7675e49c/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:19:54,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_224aa2b8-6c14-426b-ba12-9d8a7675e49c/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:19:54,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-27 20:19:54,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-27 20:19:54,064 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-27 20:19:54,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:19:54,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 20:19:54,064 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-27 20:19:54,064 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-27 20:19:54,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:19:54,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-27 20:19:54,065 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-27 20:19:54,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:19:54,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:19:54,067 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 20:19:54,261 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:19:54,263 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:19:54,738 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 20:19:54,738 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:19:54,792 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:19:54,793 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-27 20:19:54,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:19:54 BoogieIcfgContainer [2024-11-27 20:19:54,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:19:54,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:19:54,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:19:54,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:19:54,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:19:53" (1/3) ... [2024-11-27 20:19:54,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57eceabe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:19:54, skipping insertion in model container [2024-11-27 20:19:54,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:53" (2/3) ... [2024-11-27 20:19:54,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57eceabe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:19:54, skipping insertion in model container [2024-11-27 20:19:54,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:19:54" (3/3) ... [2024-11-27 20:19:54,806 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_19-callback_racing.i [2024-11-27 20:19:54,825 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:19:54,827 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_19-callback_racing.i that has 2 procedures, 165 locations, 1 initial locations, 7 loop locations, and 7 error locations. [2024-11-27 20:19:54,827 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 20:19:54,931 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-27 20:19:55,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 181 transitions, 369 flow [2024-11-27 20:19:55,169 INFO L124 PetriNetUnfolderBase]: 27/291 cut-off events. [2024-11-27 20:19:55,172 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-27 20:19:55,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 291 events. 27/291 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 968 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 143. Up to 6 conditions per place. [2024-11-27 20:19:55,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 181 transitions, 369 flow [2024-11-27 20:19:55,195 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 181 transitions, 369 flow [2024-11-27 20:19:55,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:19:55,231 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;@6c96a2a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:19:55,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-27 20:19:55,264 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 20:19:55,265 INFO L124 PetriNetUnfolderBase]: 2/58 cut-off events. [2024-11-27 20:19:55,265 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:19:55,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:19:55,266 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] [2024-11-27 20:19:55,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-27 20:19:55,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:55,278 INFO L85 PathProgramCache]: Analyzing trace with hash 591632333, now seen corresponding path program 1 times [2024-11-27 20:19:55,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:19:55,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660348071] [2024-11-27 20:19:55,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:55,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:19:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:56,490 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-27 20:19:56,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:19:56,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660348071] [2024-11-27 20:19:56,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660348071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:19:56,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:19:56,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:19:56,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627723337] [2024-11-27 20:19:56,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:19:56,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:19:56,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:19:56,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:19:56,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:19:56,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 181 [2024-11-27 20:19:56,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 181 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 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-27 20:19:56,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:19:56,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 181 [2024-11-27 20:19:56,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:19:57,097 INFO L124 PetriNetUnfolderBase]: 93/781 cut-off events. [2024-11-27 20:19:57,098 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-27 20:19:57,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 781 events. 93/781 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4389 event pairs, 33 based on Foata normal form. 101/822 useless extension candidates. Maximal degree in co-relation 826. Up to 154 conditions per place. [2024-11-27 20:19:57,108 INFO L140 encePairwiseOnDemand]: 162/181 looper letters, 40 selfloop transitions, 5 changer transitions 0/181 dead transitions. [2024-11-27 20:19:57,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 181 transitions, 459 flow [2024-11-27 20:19:57,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:19:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:19:57,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 897 transitions. [2024-11-27 20:19:57,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8259668508287292 [2024-11-27 20:19:57,136 INFO L175 Difference]: Start difference. First operand has 168 places, 181 transitions, 369 flow. Second operand 6 states and 897 transitions. [2024-11-27 20:19:57,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 181 transitions, 459 flow [2024-11-27 20:19:57,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 181 transitions, 459 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 20:19:57,151 INFO L231 Difference]: Finished difference. Result has 170 places, 165 transitions, 347 flow [2024-11-27 20:19:57,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=170, PETRI_TRANSITIONS=165} [2024-11-27 20:19:57,162 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, 2 predicate places. [2024-11-27 20:19:57,162 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 165 transitions, 347 flow [2024-11-27 20:19:57,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 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-27 20:19:57,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:19:57,163 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] [2024-11-27 20:19:57,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:19:57,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-27 20:19:57,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:57,166 INFO L85 PathProgramCache]: Analyzing trace with hash -131842239, now seen corresponding path program 1 times [2024-11-27 20:19:57,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:19:57,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88923382] [2024-11-27 20:19:57,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:57,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:19:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:57,274 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-27 20:19:57,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:19:57,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88923382] [2024-11-27 20:19:57,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88923382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:19:57,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:19:57,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:19:57,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190241490] [2024-11-27 20:19:57,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:19:57,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:19:57,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:19:57,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:19:57,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:19:57,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 181 [2024-11-27 20:19:57,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 165 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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-27 20:19:57,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:19:57,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 181 [2024-11-27 20:19:57,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:19:57,500 INFO L124 PetriNetUnfolderBase]: 50/624 cut-off events. [2024-11-27 20:19:57,500 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-27 20:19:57,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 624 events. 50/624 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3061 event pairs, 18 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 669. Up to 94 conditions per place. [2024-11-27 20:19:57,507 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 20 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2024-11-27 20:19:57,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 169 transitions, 399 flow [2024-11-27 20:19:57,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:19:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:19:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2024-11-27 20:19:57,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8655616942909761 [2024-11-27 20:19:57,509 INFO L175 Difference]: Start difference. First operand has 170 places, 165 transitions, 347 flow. Second operand 3 states and 470 transitions. [2024-11-27 20:19:57,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 169 transitions, 399 flow [2024-11-27 20:19:57,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 169 transitions, 389 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-27 20:19:57,519 INFO L231 Difference]: Finished difference. Result has 168 places, 165 transitions, 345 flow [2024-11-27 20:19:57,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=345, PETRI_PLACES=168, PETRI_TRANSITIONS=165} [2024-11-27 20:19:57,521 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, 0 predicate places. [2024-11-27 20:19:57,522 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 165 transitions, 345 flow [2024-11-27 20:19:57,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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-27 20:19:57,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:19:57,522 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] [2024-11-27 20:19:57,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:19:57,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-27 20:19:57,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:57,524 INFO L85 PathProgramCache]: Analyzing trace with hash 413231348, now seen corresponding path program 1 times [2024-11-27 20:19:57,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:19:57,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563942084] [2024-11-27 20:19:57,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:57,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:19:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:57,621 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-27 20:19:57,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:19:57,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563942084] [2024-11-27 20:19:57,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563942084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:19:57,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:19:57,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:19:57,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330754074] [2024-11-27 20:19:57,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:19:57,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:19:57,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:19:57,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:19:57,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:19:57,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 181 [2024-11-27 20:19:57,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 165 transitions, 345 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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-27 20:19:57,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:19:57,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 181 [2024-11-27 20:19:57,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:19:57,894 INFO L124 PetriNetUnfolderBase]: 110/871 cut-off events. [2024-11-27 20:19:57,895 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2024-11-27 20:19:57,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 871 events. 110/871 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4445 event pairs, 41 based on Foata normal form. 1/799 useless extension candidates. Maximal degree in co-relation 1069. Up to 133 conditions per place. [2024-11-27 20:19:57,901 INFO L140 encePairwiseOnDemand]: 172/181 looper letters, 30 selfloop transitions, 6 changer transitions 0/178 dead transitions. [2024-11-27 20:19:57,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 178 transitions, 446 flow [2024-11-27 20:19:57,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:19:57,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:19:57,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2024-11-27 20:19:57,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8674033149171271 [2024-11-27 20:19:57,905 INFO L175 Difference]: Start difference. First operand has 168 places, 165 transitions, 345 flow. Second operand 3 states and 471 transitions. [2024-11-27 20:19:57,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 178 transitions, 446 flow [2024-11-27 20:19:57,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 178 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:19:57,914 INFO L231 Difference]: Finished difference. Result has 168 places, 167 transitions, 379 flow [2024-11-27 20:19:57,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=379, PETRI_PLACES=168, PETRI_TRANSITIONS=167} [2024-11-27 20:19:57,917 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, 0 predicate places. [2024-11-27 20:19:57,918 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 167 transitions, 379 flow [2024-11-27 20:19:57,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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-27 20:19:57,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:19:57,919 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] [2024-11-27 20:19:57,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:19:57,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-27 20:19:57,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1866034924, now seen corresponding path program 1 times [2024-11-27 20:19:57,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:19:57,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63828100] [2024-11-27 20:19:57,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:57,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:19:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:19:57,969 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:19:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:19:58,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:19:58,037 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:19:58,039 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-27 20:19:58,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-27 20:19:58,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-27 20:19:58,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-27 20:19:58,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-27 20:19:58,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-27 20:19:58,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-27 20:19:58,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-27 20:19:58,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-27 20:19:58,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:19:58,050 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-27 20:19:58,053 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 20:19:58,053 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-27 20:19:58,100 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-27 20:19:58,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 213 transitions, 442 flow [2024-11-27 20:19:58,197 INFO L124 PetriNetUnfolderBase]: 45/461 cut-off events. [2024-11-27 20:19:58,198 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-27 20:19:58,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 461 events. 45/461 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1820 event pairs, 0 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 293. Up to 9 conditions per place. [2024-11-27 20:19:58,201 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 213 transitions, 442 flow [2024-11-27 20:19:58,207 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 213 transitions, 442 flow [2024-11-27 20:19:58,208 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:19:58,212 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;@6c96a2a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:19:58,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-27 20:19:58,225 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 20:19:58,225 INFO L124 PetriNetUnfolderBase]: 2/58 cut-off events. [2024-11-27 20:19:58,226 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:19:58,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:19:58,226 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] [2024-11-27 20:19:58,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-27 20:19:58,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:58,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1700853485, now seen corresponding path program 1 times [2024-11-27 20:19:58,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:19:58,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944004815] [2024-11-27 20:19:58,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:58,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:19:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:58,789 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-27 20:19:58,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:19:58,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944004815] [2024-11-27 20:19:58,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944004815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:19:58,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:19:58,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:19:58,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810570566] [2024-11-27 20:19:58,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:19:58,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:19:58,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:19:58,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:19:58,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:19:58,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 213 [2024-11-27 20:19:58,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 213 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 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-27 20:19:58,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:19:58,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 213 [2024-11-27 20:19:58,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:20:00,007 INFO L124 PetriNetUnfolderBase]: 1001/4638 cut-off events. [2024-11-27 20:20:00,008 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-11-27 20:20:00,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6297 conditions, 4638 events. 1001/4638 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 43330 event pairs, 108 based on Foata normal form. 899/5191 useless extension candidates. Maximal degree in co-relation 1068. Up to 1202 conditions per place. [2024-11-27 20:20:00,044 INFO L140 encePairwiseOnDemand]: 190/213 looper letters, 62 selfloop transitions, 5 changer transitions 0/223 dead transitions. [2024-11-27 20:20:00,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 223 transitions, 596 flow [2024-11-27 20:20:00,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:20:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:20:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1065 transitions. [2024-11-27 20:20:00,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-11-27 20:20:00,054 INFO L175 Difference]: Start difference. First operand has 197 places, 213 transitions, 442 flow. Second operand 6 states and 1065 transitions. [2024-11-27 20:20:00,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 223 transitions, 596 flow [2024-11-27 20:20:00,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 223 transitions, 596 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 20:20:00,061 INFO L231 Difference]: Finished difference. Result has 197 places, 191 transitions, 408 flow [2024-11-27 20:20:00,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=197, PETRI_TRANSITIONS=191} [2024-11-27 20:20:00,063 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, 0 predicate places. [2024-11-27 20:20:00,064 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 191 transitions, 408 flow [2024-11-27 20:20:00,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 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-27 20:20:00,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:20:00,066 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] [2024-11-27 20:20:00,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:20:00,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-27 20:20:00,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:00,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1535117087, now seen corresponding path program 1 times [2024-11-27 20:20:00,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:20:00,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084375743] [2024-11-27 20:20:00,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:00,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:20:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:00,150 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-27 20:20:00,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:20:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084375743] [2024-11-27 20:20:00,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084375743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:20:00,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:20:00,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:20:00,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428403575] [2024-11-27 20:20:00,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:20:00,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:20:00,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:20:00,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:20:00,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:20:00,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 213 [2024-11-27 20:20:00,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 191 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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-27 20:20:00,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:20:00,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 213 [2024-11-27 20:20:00,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:20:00,833 INFO L124 PetriNetUnfolderBase]: 498/2952 cut-off events. [2024-11-27 20:20:00,833 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2024-11-27 20:20:00,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3882 conditions, 2952 events. 498/2952 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 25788 event pairs, 208 based on Foata normal form. 1/2686 useless extension candidates. Maximal degree in co-relation 769. Up to 817 conditions per place. [2024-11-27 20:20:00,858 INFO L140 encePairwiseOnDemand]: 210/213 looper letters, 27 selfloop transitions, 2 changer transitions 0/196 dead transitions. [2024-11-27 20:20:00,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 196 transitions, 478 flow [2024-11-27 20:20:00,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:20:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:20:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2024-11-27 20:20:00,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8450704225352113 [2024-11-27 20:20:00,862 INFO L175 Difference]: Start difference. First operand has 197 places, 191 transitions, 408 flow. Second operand 3 states and 540 transitions. [2024-11-27 20:20:00,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 196 transitions, 478 flow [2024-11-27 20:20:00,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 196 transitions, 466 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-27 20:20:00,870 INFO L231 Difference]: Finished difference. Result has 195 places, 192 transitions, 410 flow [2024-11-27 20:20:00,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=195, PETRI_TRANSITIONS=192} [2024-11-27 20:20:00,872 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -2 predicate places. [2024-11-27 20:20:00,873 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 192 transitions, 410 flow [2024-11-27 20:20:00,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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-27 20:20:00,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:20:00,874 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] [2024-11-27 20:20:00,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:20:00,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-27 20:20:00,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:00,875 INFO L85 PathProgramCache]: Analyzing trace with hash -245341002, now seen corresponding path program 1 times [2024-11-27 20:20:00,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:20:00,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389847705] [2024-11-27 20:20:00,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:00,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:20:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:00,938 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-27 20:20:00,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:20:00,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389847705] [2024-11-27 20:20:00,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389847705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:20:00,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:20:00,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:20:00,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778548317] [2024-11-27 20:20:00,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:20:00,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:20:00,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:20:00,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:20:00,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:20:00,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 213 [2024-11-27 20:20:00,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 192 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-27 20:20:00,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:20:00,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 213 [2024-11-27 20:20:00,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:20:02,577 INFO L124 PetriNetUnfolderBase]: 2100/8566 cut-off events. [2024-11-27 20:20:02,577 INFO L125 PetriNetUnfolderBase]: For 272/399 co-relation queries the response was YES. [2024-11-27 20:20:02,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12071 conditions, 8566 events. 2100/8566 cut-off events. For 272/399 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 85095 event pairs, 755 based on Foata normal form. 8/7778 useless extension candidates. Maximal degree in co-relation 12014. Up to 2123 conditions per place. [2024-11-27 20:20:02,701 INFO L140 encePairwiseOnDemand]: 201/213 looper letters, 45 selfloop transitions, 8 changer transitions 0/213 dead transitions. [2024-11-27 20:20:02,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 213 transitions, 569 flow [2024-11-27 20:20:02,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:20:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:20:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2024-11-27 20:20:02,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8497652582159625 [2024-11-27 20:20:02,704 INFO L175 Difference]: Start difference. First operand has 195 places, 192 transitions, 410 flow. Second operand 3 states and 543 transitions. [2024-11-27 20:20:02,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 213 transitions, 569 flow [2024-11-27 20:20:02,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 213 transitions, 567 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:20:02,710 INFO L231 Difference]: Finished difference. Result has 196 places, 196 transitions, 464 flow [2024-11-27 20:20:02,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=196, PETRI_TRANSITIONS=196} [2024-11-27 20:20:02,713 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -1 predicate places. [2024-11-27 20:20:02,713 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 196 transitions, 464 flow [2024-11-27 20:20:02,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-27 20:20:02,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:20:02,714 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:20:02,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:20:02,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-27 20:20:02,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:02,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2080219422, now seen corresponding path program 1 times [2024-11-27 20:20:02,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:20:02,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350021432] [2024-11-27 20:20:02,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:02,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:20:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 20:20:02,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:20:02,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350021432] [2024-11-27 20:20:02,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350021432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:20:02,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:20:02,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:20:02,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224626875] [2024-11-27 20:20:02,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:20:02,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:20:02,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:20:02,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:20:02,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:20:02,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 213 [2024-11-27 20:20:02,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 196 transitions, 464 flow. Second operand has 5 states, 5 states have (on average 169.6) internal successors, (848), 5 states have internal predecessors, (848), 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-27 20:20:02,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:20:02,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 213 [2024-11-27 20:20:02,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:20:04,648 INFO L124 PetriNetUnfolderBase]: 1393/8582 cut-off events. [2024-11-27 20:20:04,649 INFO L125 PetriNetUnfolderBase]: For 382/394 co-relation queries the response was YES. [2024-11-27 20:20:04,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11402 conditions, 8582 events. 1393/8582 cut-off events. For 382/394 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 89532 event pairs, 415 based on Foata normal form. 5/7880 useless extension candidates. Maximal degree in co-relation 5199. Up to 1757 conditions per place. [2024-11-27 20:20:04,710 INFO L140 encePairwiseOnDemand]: 208/213 looper letters, 44 selfloop transitions, 5 changer transitions 0/218 dead transitions. [2024-11-27 20:20:04,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 218 transitions, 606 flow [2024-11-27 20:20:04,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:20:04,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:20:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1058 transitions. [2024-11-27 20:20:04,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8278560250391236 [2024-11-27 20:20:04,715 INFO L175 Difference]: Start difference. First operand has 196 places, 196 transitions, 464 flow. Second operand 6 states and 1058 transitions. [2024-11-27 20:20:04,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 218 transitions, 606 flow [2024-11-27 20:20:04,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 218 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:20:04,723 INFO L231 Difference]: Finished difference. Result has 202 places, 198 transitions, 474 flow [2024-11-27 20:20:04,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=202, PETRI_TRANSITIONS=198} [2024-11-27 20:20:04,724 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, 5 predicate places. [2024-11-27 20:20:04,724 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 198 transitions, 474 flow [2024-11-27 20:20:04,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 169.6) internal successors, (848), 5 states have internal predecessors, (848), 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-27 20:20:04,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:20:04,726 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-27 20:20:04,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:20:04,726 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-27 20:20:04,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:04,727 INFO L85 PathProgramCache]: Analyzing trace with hash 317247369, now seen corresponding path program 1 times [2024-11-27 20:20:04,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:20:04,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947629279] [2024-11-27 20:20:04,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:04,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:20:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:20:04,769 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:20:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:20:04,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:20:04,812 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:20:04,812 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-27 20:20:04,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-27 20:20:04,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-27 20:20:04,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-27 20:20:04,813 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-27 20:20:04,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-27 20:20:04,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-27 20:20:04,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-27 20:20:04,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-27 20:20:04,814 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-11-27 20:20:04,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:20:04,815 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-27 20:20:04,816 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 20:20:04,816 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-27 20:20:04,862 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-27 20:20:04,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 245 transitions, 517 flow [2024-11-27 20:20:04,963 INFO L124 PetriNetUnfolderBase]: 68/676 cut-off events. [2024-11-27 20:20:04,963 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-27 20:20:04,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 676 events. 68/676 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2923 event pairs, 1 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 469. Up to 16 conditions per place. [2024-11-27 20:20:04,968 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 245 transitions, 517 flow [2024-11-27 20:20:04,976 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 245 transitions, 517 flow [2024-11-27 20:20:04,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:20:04,980 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;@6c96a2a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:20:04,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-27 20:20:04,985 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 20:20:04,985 INFO L124 PetriNetUnfolderBase]: 2/58 cut-off events. [2024-11-27 20:20:04,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:20:04,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:20:04,985 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] [2024-11-27 20:20:04,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-27 20:20:04,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:04,987 INFO L85 PathProgramCache]: Analyzing trace with hash -531846643, now seen corresponding path program 1 times [2024-11-27 20:20:04,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:20:04,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482461509] [2024-11-27 20:20:04,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:04,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:20:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:05,491 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-27 20:20:05,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:20:05,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482461509] [2024-11-27 20:20:05,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482461509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:20:05,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:20:05,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:20:05,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657236774] [2024-11-27 20:20:05,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:20:05,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:20:05,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:20:05,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:20:05,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:20:05,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 245 [2024-11-27 20:20:05,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 245 transitions, 517 flow. Second operand has 6 states, 6 states have (on average 180.5) internal successors, (1083), 6 states have internal predecessors, (1083), 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-27 20:20:05,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:20:05,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 245 [2024-11-27 20:20:05,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:20:09,774 INFO L124 PetriNetUnfolderBase]: 8120/26912 cut-off events. [2024-11-27 20:20:09,775 INFO L125 PetriNetUnfolderBase]: For 557/557 co-relation queries the response was YES. [2024-11-27 20:20:09,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38647 conditions, 26912 events. 8120/26912 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 323712 event pairs, 1746 based on Foata normal form. 6819/31993 useless extension candidates. Maximal degree in co-relation 6247. Up to 8631 conditions per place. [2024-11-27 20:20:09,964 INFO L140 encePairwiseOnDemand]: 218/245 looper letters, 84 selfloop transitions, 5 changer transitions 0/265 dead transitions. [2024-11-27 20:20:09,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 265 transitions, 735 flow [2024-11-27 20:20:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:20:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:20:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1233 transitions. [2024-11-27 20:20:09,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8387755102040816 [2024-11-27 20:20:09,969 INFO L175 Difference]: Start difference. First operand has 226 places, 245 transitions, 517 flow. Second operand 6 states and 1233 transitions. [2024-11-27 20:20:09,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 265 transitions, 735 flow [2024-11-27 20:20:09,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 265 transitions, 735 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 20:20:09,975 INFO L231 Difference]: Finished difference. Result has 224 places, 217 transitions, 471 flow [2024-11-27 20:20:09,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=471, PETRI_PLACES=224, PETRI_TRANSITIONS=217} [2024-11-27 20:20:09,976 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -2 predicate places. [2024-11-27 20:20:09,976 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 217 transitions, 471 flow [2024-11-27 20:20:09,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 180.5) internal successors, (1083), 6 states have internal predecessors, (1083), 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-27 20:20:09,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:20:09,978 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] [2024-11-27 20:20:09,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:20:09,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-27 20:20:09,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:09,979 INFO L85 PathProgramCache]: Analyzing trace with hash 560993921, now seen corresponding path program 1 times [2024-11-27 20:20:09,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:20:09,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553451599] [2024-11-27 20:20:09,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:09,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:20:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:10,030 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-27 20:20:10,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:20:10,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553451599] [2024-11-27 20:20:10,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553451599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:20:10,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:20:10,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:20:10,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816238392] [2024-11-27 20:20:10,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:20:10,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:20:10,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:20:10,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:20:10,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:20:10,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 245 [2024-11-27 20:20:10,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 217 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 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-27 20:20:10,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:20:10,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 245 [2024-11-27 20:20:10,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:20:12,380 INFO L124 PetriNetUnfolderBase]: 3959/15302 cut-off events. [2024-11-27 20:20:12,380 INFO L125 PetriNetUnfolderBase]: For 684/710 co-relation queries the response was YES. [2024-11-27 20:20:12,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21526 conditions, 15302 events. 3959/15302 cut-off events. For 684/710 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 178746 event pairs, 3171 based on Foata normal form. 1/13921 useless extension candidates. Maximal degree in co-relation 10200. Up to 5783 conditions per place. [2024-11-27 20:20:12,501 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 33 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-11-27 20:20:12,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 222 transitions, 553 flow [2024-11-27 20:20:12,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:20:12,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:20:12,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2024-11-27 20:20:12,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2024-11-27 20:20:12,505 INFO L175 Difference]: Start difference. First operand has 224 places, 217 transitions, 471 flow. Second operand 3 states and 609 transitions. [2024-11-27 20:20:12,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 222 transitions, 553 flow [2024-11-27 20:20:12,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 222 transitions, 541 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-27 20:20:12,517 INFO L231 Difference]: Finished difference. Result has 222 places, 218 transitions, 473 flow [2024-11-27 20:20:12,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=222, PETRI_TRANSITIONS=218} [2024-11-27 20:20:12,518 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -4 predicate places. [2024-11-27 20:20:12,518 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 218 transitions, 473 flow [2024-11-27 20:20:12,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 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-27 20:20:12,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:20:12,524 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] [2024-11-27 20:20:12,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:20:12,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-27 20:20:12,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:12,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1786125876, now seen corresponding path program 1 times [2024-11-27 20:20:12,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:20:12,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477843015] [2024-11-27 20:20:12,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:12,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:20:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:12,611 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-27 20:20:12,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:20:12,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477843015] [2024-11-27 20:20:12,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477843015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:20:12,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:20:12,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:20:12,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628802084] [2024-11-27 20:20:12,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:20:12,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:20:12,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:20:12,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:20:12,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:20:12,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 245 [2024-11-27 20:20:12,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 218 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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-27 20:20:12,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:20:12,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 245 [2024-11-27 20:20:12,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:20:22,960 INFO L124 PetriNetUnfolderBase]: 27444/79542 cut-off events. [2024-11-27 20:20:22,960 INFO L125 PetriNetUnfolderBase]: For 3023/8680 co-relation queries the response was YES. [2024-11-27 20:20:23,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119469 conditions, 79542 events. 27444/79542 cut-off events. For 3023/8680 co-relation queries the response was YES. Maximal size of possible extension queue 1762. Compared 1032476 event pairs, 11693 based on Foata normal form. 47/71952 useless extension candidates. Maximal degree in co-relation 119411. Up to 25412 conditions per place. [2024-11-27 20:20:23,379 INFO L140 encePairwiseOnDemand]: 230/245 looper letters, 60 selfloop transitions, 10 changer transitions 0/247 dead transitions. [2024-11-27 20:20:23,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 247 transitions, 692 flow [2024-11-27 20:20:23,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:20:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:20:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 615 transitions. [2024-11-27 20:20:23,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8367346938775511 [2024-11-27 20:20:23,383 INFO L175 Difference]: Start difference. First operand has 222 places, 218 transitions, 473 flow. Second operand 3 states and 615 transitions. [2024-11-27 20:20:23,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 247 transitions, 692 flow [2024-11-27 20:20:23,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 247 transitions, 690 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:20:23,391 INFO L231 Difference]: Finished difference. Result has 223 places, 224 transitions, 545 flow [2024-11-27 20:20:23,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=545, PETRI_PLACES=223, PETRI_TRANSITIONS=224} [2024-11-27 20:20:23,392 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -3 predicate places. [2024-11-27 20:20:23,392 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 224 transitions, 545 flow [2024-11-27 20:20:23,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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-27 20:20:23,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:20:23,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:20:23,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 20:20:23,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-27 20:20:23,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:23,394 INFO L85 PathProgramCache]: Analyzing trace with hash 267375552, now seen corresponding path program 1 times [2024-11-27 20:20:23,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:20:23,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136409566] [2024-11-27 20:20:23,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:23,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:20:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:23,509 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-27 20:20:23,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:20:23,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136409566] [2024-11-27 20:20:23,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136409566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:20:23,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:20:23,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:20:23,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154339636] [2024-11-27 20:20:23,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:20:23,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:20:23,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:20:23,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:20:23,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:20:23,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 245 [2024-11-27 20:20:23,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 224 transitions, 545 flow. Second operand has 5 states, 5 states have (on average 190.6) internal successors, (953), 5 states have internal predecessors, (953), 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-27 20:20:23,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:20:23,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 245 [2024-11-27 20:20:23,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:20:32,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [225#true, 227#true, Black: 239#true, 83#L708-3true, 74#L715-12true, 241#(= |#race~glob~0| 0), 244#true, 129#L715-12true, 176#L715-6true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-27 20:20:32,549 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2024-11-27 20:20:32,549 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-27 20:20:32,549 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-27 20:20:32,550 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-27 20:20:32,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [225#true, 227#true, Black: 239#true, 83#L708-3true, 74#L715-12true, 241#(= |#race~glob~0| 0), 244#true, 129#L715-12true, 127#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-27 20:20:32,550 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2024-11-27 20:20:32,550 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-27 20:20:32,550 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2024-11-27 20:20:32,550 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-27 20:20:32,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([962] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][125], [225#true, 227#true, Black: 239#true, 83#L708-3true, 74#L715-12true, 241#(= |#race~glob~0| 0), 79#L715-5true, 244#true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 89#L715-12true]) [2024-11-27 20:20:32,551 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2024-11-27 20:20:32,551 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-27 20:20:32,551 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2024-11-27 20:20:32,551 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-27 20:20:32,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [225#true, 177#ULTIMATE.startFINALtrue, 227#true, Black: 239#true, 74#L715-12true, 241#(= |#race~glob~0| 0), 244#true, 129#L715-12true, 176#L715-6true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-27 20:20:32,630 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2024-11-27 20:20:32,631 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-27 20:20:32,631 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-11-27 20:20:32,631 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-27 20:20:32,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [225#true, 177#ULTIMATE.startFINALtrue, 227#true, Black: 239#true, 74#L715-12true, 241#(= |#race~glob~0| 0), 244#true, 129#L715-12true, 127#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-27 20:20:32,631 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2024-11-27 20:20:32,631 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-27 20:20:32,631 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-27 20:20:32,631 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-27 20:20:32,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([962] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][125], [225#true, 177#ULTIMATE.startFINALtrue, 227#true, Black: 239#true, 74#L715-12true, 241#(= |#race~glob~0| 0), 79#L715-5true, 244#true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 89#L715-12true]) [2024-11-27 20:20:32,631 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2024-11-27 20:20:32,631 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-27 20:20:32,631 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-27 20:20:32,631 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-27 20:20:32,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [225#true, 227#true, Black: 239#true, 83#L708-3true, 241#(= |#race~glob~0| 0), 244#true, 129#L715-12true, 176#L715-6true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 125#L716-2true]) [2024-11-27 20:20:32,765 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-11-27 20:20:32,765 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-11-27 20:20:32,766 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-27 20:20:32,766 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-27 20:20:32,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [225#true, 227#true, Black: 239#true, 83#L708-3true, 241#(= |#race~glob~0| 0), 244#true, 129#L715-12true, 127#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 125#L716-2true]) [2024-11-27 20:20:32,766 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2024-11-27 20:20:32,766 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-11-27 20:20:32,766 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-27 20:20:32,766 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-27 20:20:32,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([962] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][125], [225#true, 227#true, Black: 239#true, 83#L708-3true, 241#(= |#race~glob~0| 0), 79#L715-5true, 244#true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 89#L715-12true, 125#L716-2true]) [2024-11-27 20:20:32,766 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2024-11-27 20:20:32,766 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-11-27 20:20:32,766 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-27 20:20:32,766 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-27 20:20:32,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [225#true, 227#true, Black: 239#true, 74#L715-12true, 241#(= |#race~glob~0| 0), 244#true, 129#L715-12true, 176#L715-6true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 94#L709-3true]) [2024-11-27 20:20:32,770 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-11-27 20:20:32,770 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-27 20:20:32,770 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-27 20:20:32,770 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-11-27 20:20:32,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [225#true, 227#true, Black: 239#true, 74#L715-12true, 241#(= |#race~glob~0| 0), 244#true, 129#L715-12true, 127#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 94#L709-3true]) [2024-11-27 20:20:32,770 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2024-11-27 20:20:32,770 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-27 20:20:32,770 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-27 20:20:32,770 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-11-27 20:20:32,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([962] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][125], [225#true, 227#true, Black: 239#true, 74#L715-12true, 241#(= |#race~glob~0| 0), 79#L715-5true, 244#true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 89#L715-12true, 94#L709-3true]) [2024-11-27 20:20:32,770 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2024-11-27 20:20:32,770 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-27 20:20:32,770 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-27 20:20:32,770 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2024-11-27 20:20:32,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [225#true, 177#ULTIMATE.startFINALtrue, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 244#true, 129#L715-12true, 176#L715-6true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 125#L716-2true]) [2024-11-27 20:20:32,836 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2024-11-27 20:20:32,836 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-27 20:20:32,836 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-27 20:20:32,836 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-27 20:20:32,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [225#true, 177#ULTIMATE.startFINALtrue, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 244#true, 129#L715-12true, 127#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 125#L716-2true]) [2024-11-27 20:20:32,837 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-11-27 20:20:32,837 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-11-27 20:20:32,837 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-27 20:20:32,837 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-27 20:20:32,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([962] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][125], [225#true, 177#ULTIMATE.startFINALtrue, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 79#L715-5true, 244#true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 125#L716-2true, 89#L715-12true]) [2024-11-27 20:20:32,837 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-11-27 20:20:32,837 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-27 20:20:32,837 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-11-27 20:20:32,837 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-27 20:20:32,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([827] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][192], [225#true, 227#true, Black: 239#true, 156#L709-5true, 74#L715-12true, 241#(= |#race~glob~0| 0), 244#true, 48#L715-6true, 176#L715-6true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-27 20:20:32,841 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2024-11-27 20:20:32,841 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-27 20:20:32,841 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-11-27 20:20:32,842 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-27 20:20:32,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([827] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][192], [225#true, 227#true, Black: 239#true, 156#L709-5true, 74#L715-12true, 241#(= |#race~glob~0| 0), 79#L715-5true, 244#true, 176#L715-6true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-27 20:20:32,842 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-11-27 20:20:32,842 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-27 20:20:32,842 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-27 20:20:32,842 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-27 20:20:32,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([827] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][192], [225#true, 227#true, Black: 239#true, 74#L715-12true, 156#L709-5true, 241#(= |#race~glob~0| 0), 244#true, 48#L715-6true, 127#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-27 20:20:32,842 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-11-27 20:20:32,842 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-27 20:20:32,842 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-27 20:20:32,842 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-27 20:20:32,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([827] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][192], [225#true, 227#true, Black: 239#true, 156#L709-5true, 74#L715-12true, 241#(= |#race~glob~0| 0), 79#L715-5true, 244#true, 127#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-27 20:20:32,842 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-27 20:20:32,842 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-11-27 20:20:32,842 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-11-27 20:20:32,842 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-11-27 20:20:32,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 244#true, 129#L715-12true, 176#L715-6true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 125#L716-2true, 94#L709-3true]) [2024-11-27 20:20:32,950 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2024-11-27 20:20:32,950 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-11-27 20:20:32,950 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2024-11-27 20:20:32,950 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-11-27 20:20:32,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 244#true, 129#L715-12true, 127#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 125#L716-2true, 94#L709-3true]) [2024-11-27 20:20:32,950 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2024-11-27 20:20:32,950 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-27 20:20:32,950 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-11-27 20:20:32,950 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-27 20:20:32,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([962] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][125], [225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 79#L715-5true, 244#true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 89#L715-12true, 125#L716-2true, 94#L709-3true]) [2024-11-27 20:20:32,950 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2024-11-27 20:20:32,950 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-27 20:20:32,950 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-27 20:20:32,950 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-11-27 20:20:32,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([827] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][192], [225#true, Black: 239#true, 227#true, 156#L709-5true, 241#(= |#race~glob~0| 0), 244#true, 48#L715-6true, 176#L715-6true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 125#L716-2true]) [2024-11-27 20:20:32,996 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2024-11-27 20:20:32,996 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-11-27 20:20:32,996 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-27 20:20:32,996 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-27 20:20:32,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([827] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][192], [225#true, Black: 239#true, 227#true, 156#L709-5true, 241#(= |#race~glob~0| 0), 79#L715-5true, 244#true, 176#L715-6true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 125#L716-2true]) [2024-11-27 20:20:32,996 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2024-11-27 20:20:32,996 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-27 20:20:32,996 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-27 20:20:32,996 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-27 20:20:32,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([827] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][192], [225#true, Black: 239#true, 227#true, 156#L709-5true, 241#(= |#race~glob~0| 0), 244#true, 48#L715-6true, 127#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 125#L716-2true]) [2024-11-27 20:20:32,996 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2024-11-27 20:20:32,996 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-27 20:20:32,996 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-27 20:20:32,996 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-27 20:20:32,996 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([827] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][192], [225#true, Black: 239#true, 227#true, 156#L709-5true, 241#(= |#race~glob~0| 0), 79#L715-5true, 244#true, 127#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 125#L716-2true]) [2024-11-27 20:20:32,997 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2024-11-27 20:20:32,997 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2024-11-27 20:20:32,997 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-27 20:20:32,997 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-27 20:20:33,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 73#L722-10true, 244#true, 129#L715-12true, 176#L715-6true, 222#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-27 20:20:33,037 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2024-11-27 20:20:33,037 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2024-11-27 20:20:33,037 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-27 20:20:33,037 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-27 20:20:33,037 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 73#L722-10true, 244#true, 129#L715-12true, 127#L715-5true, 222#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-27 20:20:33,037 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2024-11-27 20:20:33,037 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-11-27 20:20:33,037 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2024-11-27 20:20:33,037 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-11-27 20:20:33,037 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([962] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][125], [225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 73#L722-10true, 79#L715-5true, 244#true, 222#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 89#L715-12true]) [2024-11-27 20:20:33,037 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2024-11-27 20:20:33,037 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-11-27 20:20:33,037 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2024-11-27 20:20:33,037 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-11-27 20:20:33,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [225#true, 177#ULTIMATE.startFINALtrue, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 244#true, 129#L715-12true, 176#L715-6true, 222#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-27 20:20:33,811 INFO L294 olderBase$Statistics]: this new event has 201 ancestors and is cut-off event [2024-11-27 20:20:33,811 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-27 20:20:33,811 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-27 20:20:33,811 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2024-11-27 20:20:33,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([992] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [225#true, 177#ULTIMATE.startFINALtrue, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 244#true, 129#L715-12true, 127#L715-5true, 222#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-11-27 20:20:33,811 INFO L294 olderBase$Statistics]: this new event has 200 ancestors and is cut-off event [2024-11-27 20:20:33,812 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-11-27 20:20:33,812 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2024-11-27 20:20:33,812 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-11-27 20:20:33,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([962] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][125], [225#true, 177#ULTIMATE.startFINALtrue, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 79#L715-5true, 244#true, 222#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 89#L715-12true]) [2024-11-27 20:20:33,812 INFO L294 olderBase$Statistics]: this new event has 200 ancestors and is cut-off event [2024-11-27 20:20:33,812 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-11-27 20:20:33,812 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-11-27 20:20:33,813 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2024-11-27 20:20:34,022 INFO L124 PetriNetUnfolderBase]: 17529/83394 cut-off events. [2024-11-27 20:20:34,022 INFO L125 PetriNetUnfolderBase]: For 4468/4542 co-relation queries the response was YES. [2024-11-27 20:20:34,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114146 conditions, 83394 events. 17529/83394 cut-off events. For 4468/4542 co-relation queries the response was YES. Maximal size of possible extension queue 1338. Compared 1258082 event pairs, 6187 based on Foata normal form. 5/75928 useless extension candidates. Maximal degree in co-relation 24778. Up to 20381 conditions per place. [2024-11-27 20:20:34,586 INFO L140 encePairwiseOnDemand]: 240/245 looper letters, 52 selfloop transitions, 5 changer transitions 0/248 dead transitions. [2024-11-27 20:20:34,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 248 transitions, 709 flow [2024-11-27 20:20:34,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:20:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 20:20:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1192 transitions. [2024-11-27 20:20:34,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8108843537414966 [2024-11-27 20:20:34,591 INFO L175 Difference]: Start difference. First operand has 223 places, 224 transitions, 545 flow. Second operand 6 states and 1192 transitions. [2024-11-27 20:20:34,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 248 transitions, 709 flow [2024-11-27 20:20:34,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 248 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:20:34,637 INFO L231 Difference]: Finished difference. Result has 229 places, 227 transitions, 557 flow [2024-11-27 20:20:34,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=557, PETRI_PLACES=229, PETRI_TRANSITIONS=227} [2024-11-27 20:20:34,639 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, 3 predicate places. [2024-11-27 20:20:34,639 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 227 transitions, 557 flow [2024-11-27 20:20:34,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.6) internal successors, (953), 5 states have internal predecessors, (953), 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-27 20:20:34,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:20:34,640 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1] [2024-11-27 20:20:34,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 20:20:34,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-27 20:20:34,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:34,641 INFO L85 PathProgramCache]: Analyzing trace with hash -718950050, now seen corresponding path program 1 times [2024-11-27 20:20:34,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:20:34,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39897031] [2024-11-27 20:20:34,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:34,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:20:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:34,733 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-27 20:20:34,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:20:34,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39897031] [2024-11-27 20:20:34,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39897031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:20:34,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:20:34,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:20:34,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924035537] [2024-11-27 20:20:34,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:20:34,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:20:34,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:20:34,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:20:34,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:20:34,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 245 [2024-11-27 20:20:34,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 227 transitions, 557 flow. Second operand has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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-27 20:20:34,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:20:34,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 245 [2024-11-27 20:20:34,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:20:50,737 INFO L124 PetriNetUnfolderBase]: 28122/117304 cut-off events. [2024-11-27 20:20:50,737 INFO L125 PetriNetUnfolderBase]: For 1437/1437 co-relation queries the response was YES. [2024-11-27 20:20:51,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162949 conditions, 117304 events. 28122/117304 cut-off events. For 1437/1437 co-relation queries the response was YES. Maximal size of possible extension queue 2393. Compared 1841561 event pairs, 16827 based on Foata normal form. 242/106697 useless extension candidates. Maximal degree in co-relation 162812. Up to 22645 conditions per place. [2024-11-27 20:20:51,511 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 47 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2024-11-27 20:20:51,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 246 transitions, 693 flow [2024-11-27 20:20:51,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:20:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:20:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2024-11-27 20:20:51,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8476190476190476 [2024-11-27 20:20:51,514 INFO L175 Difference]: Start difference. First operand has 229 places, 227 transitions, 557 flow. Second operand 3 states and 623 transitions. [2024-11-27 20:20:51,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 246 transitions, 693 flow [2024-11-27 20:20:51,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 246 transitions, 687 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-27 20:20:51,535 INFO L231 Difference]: Finished difference. Result has 230 places, 228 transitions, 563 flow [2024-11-27 20:20:51,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=563, PETRI_PLACES=230, PETRI_TRANSITIONS=228} [2024-11-27 20:20:51,536 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, 4 predicate places. [2024-11-27 20:20:51,536 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 228 transitions, 563 flow [2024-11-27 20:20:51,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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-27 20:20:51,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:20:51,537 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 20:20:51,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 20:20:51,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-27 20:20:51,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash -641372581, now seen corresponding path program 1 times [2024-11-27 20:20:51,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:20:51,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334953490] [2024-11-27 20:20:51,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:51,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:20:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:20:51,574 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:20:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:20:51,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:20:51,603 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:20:51,603 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-27 20:20:51,603 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-27 20:20:51,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-27 20:20:51,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-27 20:20:51,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-27 20:20:51,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-27 20:20:51,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-27 20:20:51,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-27 20:20:51,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-27 20:20:51,604 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-27 20:20:51,605 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-27 20:20:51,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 20:20:51,605 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-27 20:20:51,607 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 20:20:51,608 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-27 20:20:51,651 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-27 20:20:51,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 277 transitions, 594 flow [2024-11-27 20:20:52,082 INFO L124 PetriNetUnfolderBase]: 103/983 cut-off events. [2024-11-27 20:20:52,082 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-27 20:20:52,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1034 conditions, 983 events. 103/983 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4666 event pairs, 6 based on Foata normal form. 0/835 useless extension candidates. Maximal degree in co-relation 696. Up to 32 conditions per place. [2024-11-27 20:20:52,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 255 places, 277 transitions, 594 flow [2024-11-27 20:20:52,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 277 transitions, 594 flow [2024-11-27 20:20:52,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:20:52,098 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;@6c96a2a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:20:52,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-27 20:20:52,103 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 20:20:52,104 INFO L124 PetriNetUnfolderBase]: 2/58 cut-off events. [2024-11-27 20:20:52,104 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:20:52,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:20:52,105 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] [2024-11-27 20:20:52,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-27 20:20:52,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1811500755, now seen corresponding path program 1 times [2024-11-27 20:20:52,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:20:52,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891138412] [2024-11-27 20:20:52,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:20:52,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:20:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:52,418 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-27 20:20:52,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:20:52,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891138412] [2024-11-27 20:20:52,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891138412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:20:52,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:20:52,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:20:52,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306429444] [2024-11-27 20:20:52,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:20:52,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:20:52,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:20:52,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:20:52,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:20:52,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 277 [2024-11-27 20:20:52,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 277 transitions, 594 flow. Second operand has 6 states, 6 states have (on average 201.5) internal successors, (1209), 6 states have internal predecessors, (1209), 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-27 20:20:52,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:20:52,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 277 [2024-11-27 20:20:52,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand