./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c --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_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1 --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 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-d790fec
[2024-12-02 13:17:41,201 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-12-02 13:17:41,259 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-12-02 13:17:41,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-12-02 13:17:41,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-12-02 13:17:41,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-12-02 13:17:41,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-12-02 13:17:41,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-12-02 13:17:41,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-12-02 13:17:41,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-12-02 13:17:41,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-12-02 13:17:41,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-12-02 13:17:41,288 INFO L153 SettingsManager]: * Use SBE=true
[2024-12-02 13:17:41,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-12-02 13:17:41,289 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-12-02 13:17:41,289 INFO L153 SettingsManager]: * sizeof long=4
[2024-12-02 13:17:41,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-12-02 13:17:41,289 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-12-02 13:17:41,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-12-02 13:17:41,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-12-02 13:17:41,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-12-02 13:17:41,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-12-02 13:17:41,289 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true
[2024-12-02 13:17:41,289 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-12-02 13:17:41,289 INFO L153 SettingsManager]: * sizeof long double=12
[2024-12-02 13:17:41,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-12-02 13:17:41,290 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-12-02 13:17:41,290 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-12-02 13:17:41,290 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-12-02 13:17:41,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-02 13:17:41,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-02 13:17:41,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 13:17:41,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-12-02 13:17:41,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-12-02 13:17:41,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-12-02 13:17:41,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 13:17:41,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-12-02 13:17:41,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-12-02 13:17:41,291 INFO L153 SettingsManager]: * Compute procedure contracts=false
[2024-12-02 13:17:41,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-12-02 13:17:41,291 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-12-02 13:17:41,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-12-02 13:17:41,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-12-02 13:17:41,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-12-02 13:17:41,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-12-02 13:17:41,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-12-02 13:17:41,291 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_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1
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 -> 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a
[2024-12-02 13:17:41,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-12-02 13:17:41,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-12-02 13:17:41,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-12-02 13:17:41,536 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-12-02 13:17:41,537 INFO L274 PluginConnector]: CDTParser initialized
[2024-12-02 13:17:41,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c
[2024-12-02 13:17:44,244 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1/data/7076a4a2b/e4ff87b0623d49eea2e8a70478ea9c83/FLAGd3e556afb
[2024-12-02 13:17:44,460 INFO L384 CDTParser]: Found 1 translation units.
[2024-12-02 13:17:44,461 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c
[2024-12-02 13:17:44,473 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1/data/7076a4a2b/e4ff87b0623d49eea2e8a70478ea9c83/FLAGd3e556afb
[2024-12-02 13:17:44,814 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1/data/7076a4a2b/e4ff87b0623d49eea2e8a70478ea9c83
[2024-12-02 13:17:44,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-12-02 13:17:44,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-12-02 13:17:44,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-12-02 13:17:44,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-12-02 13:17:44,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-12-02 13:17:44,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:17:44" (1/1) ...
[2024-12-02 13:17:44,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d7e1898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:44, skipping insertion in model container
[2024-12-02 13:17:44,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:17:44" (1/1) ...
[2024-12-02 13:17:44,835 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-12-02 13:17:44,963 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-02 13:17:44,972 INFO L200 MainTranslator]: Completed pre-run
[2024-12-02 13:17:44,996 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-12-02 13:17:45,008 INFO L204 MainTranslator]: Completed translation
[2024-12-02 13:17:45,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:45 WrapperNode
[2024-12-02 13:17:45,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-12-02 13:17:45,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-12-02 13:17:45,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-12-02 13:17:45,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-12-02 13:17:45,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:45" (1/1) ...
[2024-12-02 13:17:45,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:45" (1/1) ...
[2024-12-02 13:17:45,043 INFO L138 Inliner]: procedures = 22, calls = 16, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 304
[2024-12-02 13:17:45,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-12-02 13:17:45,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-12-02 13:17:45,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-12-02 13:17:45,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-12-02 13:17:45,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:45" (1/1) ...
[2024-12-02 13:17:45,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:45" (1/1) ...
[2024-12-02 13:17:45,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:45" (1/1) ...
[2024-12-02 13:17:45,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:45" (1/1) ...
[2024-12-02 13:17:45,061 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:45" (1/1) ...
[2024-12-02 13:17:45,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:45" (1/1) ...
[2024-12-02 13:17:45,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:45" (1/1) ...
[2024-12-02 13:17:45,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:45" (1/1) ...
[2024-12-02 13:17:45,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:45" (1/1) ...
[2024-12-02 13:17:45,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-12-02 13:17:45,071 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-12-02 13:17:45,071 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-12-02 13:17:45,072 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-12-02 13:17:45,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:45" (1/1) ...
[2024-12-02 13:17:45,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-12-02 13:17:45,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1/z3
[2024-12-02 13:17:45,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-12-02 13:17:45,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-12-02 13:17:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-12-02 13:17:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure thread1
[2024-12-02 13:17:45,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1
[2024-12-02 13:17:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure thread2
[2024-12-02 13:17:45,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2
[2024-12-02 13:17:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure thread3
[2024-12-02 13:17:45,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3
[2024-12-02 13:17:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-12-02 13:17:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-12-02 13:17:45,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-12-02 13:17:45,124 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-12-02 13:17:45,219 INFO L234 CfgBuilder]: Building ICFG
[2024-12-02 13:17:45,220 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-12-02 13:17:45,611 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-12-02 13:17:45,611 INFO L283 CfgBuilder]: Performing block encoding
[2024-12-02 13:17:45,629 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-12-02 13:17:45,629 INFO L312 CfgBuilder]: Removed 0 assume(true) statements.
[2024-12-02 13:17:45,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:17:45 BoogieIcfgContainer
[2024-12-02 13:17:45,630 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-12-02 13:17:45,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-12-02 13:17:45,632 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-12-02 13:17:45,635 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-12-02 13:17:45,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:17:44" (1/3) ...
[2024-12-02 13:17:45,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad5451d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:17:45, skipping insertion in model container
[2024-12-02 13:17:45,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:45" (2/3) ...
[2024-12-02 13:17:45,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad5451d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:17:45, skipping insertion in model container
[2024-12-02 13:17:45,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:17:45" (3/3) ...
[2024-12-02 13:17:45,637 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c
[2024-12-02 13:17:45,651 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-12-02 13:17:45,653 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-trans.wvr.c that has 4 procedures, 383 locations, 1 initial locations, 0 loop locations, and 39 error locations.
[2024-12-02 13:17:45,653 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-12-02 13:17:45,771 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2024-12-02 13:17:45,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 392 places, 403 transitions, 827 flow
[2024-12-02 13:17:45,946 INFO L124 PetriNetUnfolderBase]: 21/400 cut-off events.
[2024-12-02 13:17:45,948 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-12-02 13:17:45,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 400 events. 21/400 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1056 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 283. Up to 2 conditions per place.
[2024-12-02 13:17:45,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 392 places, 403 transitions, 827 flow
[2024-12-02 13:17:45,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 370 places, 379 transitions, 776 flow
[2024-12-02 13:17:45,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-12-02 13:17:45,989 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;@70846a22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-12-02 13:17:45,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations.
[2024-12-02 13:17:45,997 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-12-02 13:17:45,997 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events.
[2024-12-02 13:17:45,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-12-02 13:17:45,997 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:45,997 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]
[2024-12-02 13:17:45,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:46,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:46,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1689132341, now seen corresponding path program 1 times
[2024-12-02 13:17:46,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:46,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769206534]
[2024-12-02 13:17:46,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:46,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:46,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:46,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769206534]
[2024-12-02 13:17:46,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769206534] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:46,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:46,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:46,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927610405]
[2024-12-02 13:17:46,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:46,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:46,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:46,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:46,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:46,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403
[2024-12-02 13:17:46,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 379 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 13:17:46,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:46,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403
[2024-12-02 13:17:46,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:46,384 INFO L124 PetriNetUnfolderBase]: 26/544 cut-off events.
[2024-12-02 13:17:46,384 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES.
[2024-12-02 13:17:46,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 544 events. 26/544 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2190 event pairs, 5 based on Foata normal form. 19/475 useless extension candidates. Maximal degree in co-relation 434. Up to 22 conditions per place.
[2024-12-02 13:17:46,393 INFO L140 encePairwiseOnDemand]: 394/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/372 dead transitions.
[2024-12-02 13:17:46,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 372 transitions, 788 flow
[2024-12-02 13:17:46,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions.
[2024-12-02 13:17:46,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9594706368899917
[2024-12-02 13:17:46,410 INFO L175 Difference]: Start difference. First operand has 370 places, 379 transitions, 776 flow. Second operand 3 states and 1160 transitions.
[2024-12-02 13:17:46,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 372 transitions, 788 flow
[2024-12-02 13:17:46,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 372 transitions, 776 flow, removed 0 selfloop flow, removed 6 redundant places.
[2024-12-02 13:17:46,424 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 754 flow
[2024-12-02 13:17:46,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=365, PETRI_TRANSITIONS=372}
[2024-12-02 13:17:46,430 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -5 predicate places.
[2024-12-02 13:17:46,430 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 754 flow
[2024-12-02 13:17:46,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 13:17:46,431 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:46,431 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]
[2024-12-02 13:17:46,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-12-02 13:17:46,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:46,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:46,432 INFO L85 PathProgramCache]: Analyzing trace with hash 904607753, now seen corresponding path program 1 times
[2024-12-02 13:17:46,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:46,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476016768]
[2024-12-02 13:17:46,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:46,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:46,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:46,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476016768]
[2024-12-02 13:17:46,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476016768] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:46,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:46,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:46,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890784442]
[2024-12-02 13:17:46,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:46,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:46,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:46,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:46,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:46,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403
[2024-12-02 13:17:46,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 372 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 13:17:46,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:46,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403
[2024-12-02 13:17:46,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:46,701 INFO L124 PetriNetUnfolderBase]: 36/706 cut-off events.
[2024-12-02 13:17:46,701 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES.
[2024-12-02 13:17:46,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 706 events. 36/706 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3260 event pairs, 7 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 707. Up to 25 conditions per place.
[2024-12-02 13:17:46,709 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/371 dead transitions.
[2024-12-02 13:17:46,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 371 transitions, 778 flow
[2024-12-02 13:17:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions.
[2024-12-02 13:17:46,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642
[2024-12-02 13:17:46,712 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 754 flow. Second operand 3 states and 1154 transitions.
[2024-12-02 13:17:46,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 371 transitions, 778 flow
[2024-12-02 13:17:46,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 371 transitions, 774 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 13:17:46,719 INFO L231 Difference]: Finished difference. Result has 364 places, 371 transitions, 752 flow
[2024-12-02 13:17:46,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=364, PETRI_TRANSITIONS=371}
[2024-12-02 13:17:46,720 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -6 predicate places.
[2024-12-02 13:17:46,720 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 371 transitions, 752 flow
[2024-12-02 13:17:46,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 13:17:46,721 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:46,721 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]
[2024-12-02 13:17:46,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-12-02 13:17:46,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:46,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:46,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1815141124, now seen corresponding path program 1 times
[2024-12-02 13:17:46,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:46,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599748860]
[2024-12-02 13:17:46,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:46,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:46,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:46,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:46,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599748860]
[2024-12-02 13:17:46,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599748860] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:46,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:46,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:46,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492957049]
[2024-12-02 13:17:46,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:46,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:46,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:46,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:46,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:46,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403
[2024-12-02 13:17:46,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 371 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 13:17:46,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:46,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403
[2024-12-02 13:17:46,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:46,904 INFO L124 PetriNetUnfolderBase]: 24/462 cut-off events.
[2024-12-02 13:17:46,904 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES.
[2024-12-02 13:17:46,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 462 events. 24/462 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1676 event pairs, 7 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 452. Up to 25 conditions per place.
[2024-12-02 13:17:46,912 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/370 dead transitions.
[2024-12-02 13:17:46,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 370 transitions, 776 flow
[2024-12-02 13:17:46,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:46,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions.
[2024-12-02 13:17:46,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642
[2024-12-02 13:17:46,915 INFO L175 Difference]: Start difference. First operand has 364 places, 371 transitions, 752 flow. Second operand 3 states and 1154 transitions.
[2024-12-02 13:17:46,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 370 transitions, 776 flow
[2024-12-02 13:17:46,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 370 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 13:17:46,921 INFO L231 Difference]: Finished difference. Result has 363 places, 370 transitions, 750 flow
[2024-12-02 13:17:46,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=363, PETRI_TRANSITIONS=370}
[2024-12-02 13:17:46,923 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -7 predicate places.
[2024-12-02 13:17:46,923 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 370 transitions, 750 flow
[2024-12-02 13:17:46,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 13:17:46,924 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:46,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:46,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-12-02 13:17:46,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:46,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:46,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1551951284, now seen corresponding path program 1 times
[2024-12-02 13:17:46,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:46,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973688054]
[2024-12-02 13:17:46,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:46,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:46,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:46,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:46,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973688054]
[2024-12-02 13:17:46,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973688054] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:46,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:46,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:46,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735175386]
[2024-12-02 13:17:46,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:46,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:46,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:46,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:46,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:46,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403
[2024-12-02 13:17:46,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 370 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 13:17:46,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:46,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403
[2024-12-02 13:17:46,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:47,130 INFO L124 PetriNetUnfolderBase]: 30/607 cut-off events.
[2024-12-02 13:17:47,130 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2024-12-02 13:17:47,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 607 events. 30/607 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2836 event pairs, 5 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 587. Up to 22 conditions per place.
[2024-12-02 13:17:47,140 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/369 dead transitions.
[2024-12-02 13:17:47,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 369 transitions, 774 flow
[2024-12-02 13:17:47,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions.
[2024-12-02 13:17:47,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642
[2024-12-02 13:17:47,144 INFO L175 Difference]: Start difference. First operand has 363 places, 370 transitions, 750 flow. Second operand 3 states and 1154 transitions.
[2024-12-02 13:17:47,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 369 transitions, 774 flow
[2024-12-02 13:17:47,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 369 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 13:17:47,151 INFO L231 Difference]: Finished difference. Result has 362 places, 369 transitions, 748 flow
[2024-12-02 13:17:47,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=362, PETRI_TRANSITIONS=369}
[2024-12-02 13:17:47,153 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -8 predicate places.
[2024-12-02 13:17:47,153 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 369 transitions, 748 flow
[2024-12-02 13:17:47,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 13:17:47,154 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:47,154 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]
[2024-12-02 13:17:47,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-12-02 13:17:47,154 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:47,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:47,155 INFO L85 PathProgramCache]: Analyzing trace with hash 599973764, now seen corresponding path program 1 times
[2024-12-02 13:17:47,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:47,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577072884]
[2024-12-02 13:17:47,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:47,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:47,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:47,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577072884]
[2024-12-02 13:17:47,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577072884] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:47,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:47,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:47,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828742528]
[2024-12-02 13:17:47,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:47,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:47,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:47,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:47,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:47,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403
[2024-12-02 13:17:47,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 369 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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-12-02 13:17:47,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:47,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403
[2024-12-02 13:17:47,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:47,459 INFO L124 PetriNetUnfolderBase]: 53/904 cut-off events.
[2024-12-02 13:17:47,459 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-12-02 13:17:47,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 904 events. 53/904 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5208 event pairs, 12 based on Foata normal form. 0/749 useless extension candidates. Maximal degree in co-relation 894. Up to 35 conditions per place.
[2024-12-02 13:17:47,473 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 12 selfloop transitions, 2 changer transitions 0/368 dead transitions.
[2024-12-02 13:17:47,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 368 transitions, 774 flow
[2024-12-02 13:17:47,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:47,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions.
[2024-12-02 13:17:47,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528535980148883
[2024-12-02 13:17:47,477 INFO L175 Difference]: Start difference. First operand has 362 places, 369 transitions, 748 flow. Second operand 3 states and 1152 transitions.
[2024-12-02 13:17:47,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 368 transitions, 774 flow
[2024-12-02 13:17:47,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 368 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 13:17:47,485 INFO L231 Difference]: Finished difference. Result has 361 places, 368 transitions, 746 flow
[2024-12-02 13:17:47,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=746, PETRI_PLACES=361, PETRI_TRANSITIONS=368}
[2024-12-02 13:17:47,486 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -9 predicate places.
[2024-12-02 13:17:47,486 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 368 transitions, 746 flow
[2024-12-02 13:17:47,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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-12-02 13:17:47,487 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:47,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:47,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-12-02 13:17:47,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:47,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:47,488 INFO L85 PathProgramCache]: Analyzing trace with hash -17834254, now seen corresponding path program 1 times
[2024-12-02 13:17:47,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:47,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323080857]
[2024-12-02 13:17:47,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:47,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:47,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:47,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323080857]
[2024-12-02 13:17:47,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323080857] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:47,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:47,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:47,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072692759]
[2024-12-02 13:17:47,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:47,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:47,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:47,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:47,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:47,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 403
[2024-12-02 13:17:47,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 368 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 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-12-02 13:17:47,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:47,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 403
[2024-12-02 13:17:47,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:47,792 INFO L124 PetriNetUnfolderBase]: 65/963 cut-off events.
[2024-12-02 13:17:47,792 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES.
[2024-12-02 13:17:47,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 963 events. 65/963 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5210 event pairs, 20 based on Foata normal form. 0/802 useless extension candidates. Maximal degree in co-relation 955. Up to 50 conditions per place.
[2024-12-02 13:17:47,806 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 13 selfloop transitions, 2 changer transitions 0/367 dead transitions.
[2024-12-02 13:17:47,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 367 transitions, 774 flow
[2024-12-02 13:17:47,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions.
[2024-12-02 13:17:47,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511993382961125
[2024-12-02 13:17:47,810 INFO L175 Difference]: Start difference. First operand has 361 places, 368 transitions, 746 flow. Second operand 3 states and 1150 transitions.
[2024-12-02 13:17:47,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 367 transitions, 774 flow
[2024-12-02 13:17:47,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 367 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 13:17:47,818 INFO L231 Difference]: Finished difference. Result has 360 places, 367 transitions, 744 flow
[2024-12-02 13:17:47,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=360, PETRI_TRANSITIONS=367}
[2024-12-02 13:17:47,819 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -10 predicate places.
[2024-12-02 13:17:47,819 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 367 transitions, 744 flow
[2024-12-02 13:17:47,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 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-12-02 13:17:47,820 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:47,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:47,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-12-02 13:17:47,820 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:47,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:47,821 INFO L85 PathProgramCache]: Analyzing trace with hash -81682211, now seen corresponding path program 1 times
[2024-12-02 13:17:47,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:47,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325499111]
[2024-12-02 13:17:47,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:47,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:47,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:47,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325499111]
[2024-12-02 13:17:47,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325499111] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:47,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:47,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:47,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948034145]
[2024-12-02 13:17:47,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:47,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:47,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:47,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:47,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:47,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403
[2024-12-02 13:17:47,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 367 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 13:17:47,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:47,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403
[2024-12-02 13:17:47,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:48,022 INFO L124 PetriNetUnfolderBase]: 26/538 cut-off events.
[2024-12-02 13:17:48,022 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES.
[2024-12-02 13:17:48,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 538 events. 26/538 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2315 event pairs, 5 based on Foata normal form. 0/457 useless extension candidates. Maximal degree in co-relation 494. Up to 22 conditions per place.
[2024-12-02 13:17:48,030 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/366 dead transitions.
[2024-12-02 13:17:48,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 366 transitions, 768 flow
[2024-12-02 13:17:48,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions.
[2024-12-02 13:17:48,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642
[2024-12-02 13:17:48,034 INFO L175 Difference]: Start difference. First operand has 360 places, 367 transitions, 744 flow. Second operand 3 states and 1154 transitions.
[2024-12-02 13:17:48,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 366 transitions, 768 flow
[2024-12-02 13:17:48,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 366 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 13:17:48,042 INFO L231 Difference]: Finished difference. Result has 359 places, 366 transitions, 742 flow
[2024-12-02 13:17:48,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=359, PETRI_TRANSITIONS=366}
[2024-12-02 13:17:48,043 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -11 predicate places.
[2024-12-02 13:17:48,043 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 366 transitions, 742 flow
[2024-12-02 13:17:48,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 381.3333333333333) internal successors, (1144), 3 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-12-02 13:17:48,044 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:48,044 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:48,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-12-02 13:17:48,044 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:48,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:48,045 INFO L85 PathProgramCache]: Analyzing trace with hash -771227952, now seen corresponding path program 1 times
[2024-12-02 13:17:48,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:48,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871655446]
[2024-12-02 13:17:48,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:48,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:48,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:48,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871655446]
[2024-12-02 13:17:48,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871655446] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:48,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:48,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:48,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915154601]
[2024-12-02 13:17:48,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:48,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:48,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:48,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:48,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:48,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403
[2024-12-02 13:17:48,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 366 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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-12-02 13:17:48,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:48,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403
[2024-12-02 13:17:48,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:48,279 INFO L124 PetriNetUnfolderBase]: 53/951 cut-off events.
[2024-12-02 13:17:48,279 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES.
[2024-12-02 13:17:48,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 951 events. 53/951 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5710 event pairs, 12 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 917. Up to 35 conditions per place.
[2024-12-02 13:17:48,292 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 12 selfloop transitions, 2 changer transitions 0/365 dead transitions.
[2024-12-02 13:17:48,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 365 transitions, 768 flow
[2024-12-02 13:17:48,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:48,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions.
[2024-12-02 13:17:48,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528535980148883
[2024-12-02 13:17:48,295 INFO L175 Difference]: Start difference. First operand has 359 places, 366 transitions, 742 flow. Second operand 3 states and 1152 transitions.
[2024-12-02 13:17:48,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 365 transitions, 768 flow
[2024-12-02 13:17:48,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 365 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 13:17:48,300 INFO L231 Difference]: Finished difference. Result has 358 places, 365 transitions, 740 flow
[2024-12-02 13:17:48,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=358, PETRI_TRANSITIONS=365}
[2024-12-02 13:17:48,301 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -12 predicate places.
[2024-12-02 13:17:48,301 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 365 transitions, 740 flow
[2024-12-02 13:17:48,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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-12-02 13:17:48,302 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:48,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:17:48,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-12-02 13:17:48,303 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:48,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:48,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1482047006, now seen corresponding path program 1 times
[2024-12-02 13:17:48,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:48,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829175922]
[2024-12-02 13:17:48,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:48,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:48,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:48,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829175922]
[2024-12-02 13:17:48,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829175922] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:48,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:48,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:48,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377702919]
[2024-12-02 13:17:48,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:48,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:48,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:48,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:48,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:48,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 403
[2024-12-02 13:17:48,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 365 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 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-12-02 13:17:48,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:48,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 403
[2024-12-02 13:17:48,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:48,474 INFO L124 PetriNetUnfolderBase]: 41/556 cut-off events.
[2024-12-02 13:17:48,475 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES.
[2024-12-02 13:17:48,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 556 events. 41/556 cut-off events. For 9/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2620 event pairs, 20 based on Foata normal form. 0/476 useless extension candidates. Maximal degree in co-relation 524. Up to 50 conditions per place.
[2024-12-02 13:17:48,483 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 13 selfloop transitions, 2 changer transitions 0/364 dead transitions.
[2024-12-02 13:17:48,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 364 transitions, 768 flow
[2024-12-02 13:17:48,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions.
[2024-12-02 13:17:48,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511993382961125
[2024-12-02 13:17:48,485 INFO L175 Difference]: Start difference. First operand has 358 places, 365 transitions, 740 flow. Second operand 3 states and 1150 transitions.
[2024-12-02 13:17:48,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 364 transitions, 768 flow
[2024-12-02 13:17:48,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 364 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 13:17:48,490 INFO L231 Difference]: Finished difference. Result has 357 places, 364 transitions, 738 flow
[2024-12-02 13:17:48,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=357, PETRI_TRANSITIONS=364}
[2024-12-02 13:17:48,492 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -13 predicate places.
[2024-12-02 13:17:48,492 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 364 transitions, 738 flow
[2024-12-02 13:17:48,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 379.3333333333333) internal successors, (1138), 3 states have internal predecessors, (1138), 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-12-02 13:17:48,493 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:48,493 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:48,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-12-02 13:17:48,493 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:48,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:48,493 INFO L85 PathProgramCache]: Analyzing trace with hash -638811393, now seen corresponding path program 1 times
[2024-12-02 13:17:48,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:48,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201085617]
[2024-12-02 13:17:48,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:48,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:48,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:48,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201085617]
[2024-12-02 13:17:48,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201085617] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:48,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:48,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:48,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389734507]
[2024-12-02 13:17:48,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:48,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:48,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:48,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:48,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:48,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403
[2024-12-02 13:17:48,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 364 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-12-02 13:17:48,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:48,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403
[2024-12-02 13:17:48,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:48,692 INFO L124 PetriNetUnfolderBase]: 53/916 cut-off events.
[2024-12-02 13:17:48,692 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-12-02 13:17:48,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 916 events. 53/916 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5422 event pairs, 8 based on Foata normal form. 0/767 useless extension candidates. Maximal degree in co-relation 862. Up to 31 conditions per place.
[2024-12-02 13:17:48,704 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 13 selfloop transitions, 2 changer transitions 0/366 dead transitions.
[2024-12-02 13:17:48,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 366 transitions, 774 flow
[2024-12-02 13:17:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions.
[2024-12-02 13:17:48,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555
[2024-12-02 13:17:48,707 INFO L175 Difference]: Start difference. First operand has 357 places, 364 transitions, 738 flow. Second operand 3 states and 1163 transitions.
[2024-12-02 13:17:48,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 366 transitions, 774 flow
[2024-12-02 13:17:48,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 366 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 13:17:48,713 INFO L231 Difference]: Finished difference. Result has 356 places, 364 transitions, 744 flow
[2024-12-02 13:17:48,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=356, PETRI_TRANSITIONS=364}
[2024-12-02 13:17:48,714 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places.
[2024-12-02 13:17:48,714 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 364 transitions, 744 flow
[2024-12-02 13:17:48,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-12-02 13:17:48,715 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:48,715 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:48,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-12-02 13:17:48,716 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:48,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash 170798306, now seen corresponding path program 1 times
[2024-12-02 13:17:48,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:48,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478459577]
[2024-12-02 13:17:48,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:48,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:48,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:48,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478459577]
[2024-12-02 13:17:48,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478459577] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:48,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:48,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:48,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060792403]
[2024-12-02 13:17:48,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:48,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:48,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:48,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:48,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:48,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403
[2024-12-02 13:17:48,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 364 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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-12-02 13:17:48,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:48,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403
[2024-12-02 13:17:48,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:49,012 INFO L124 PetriNetUnfolderBase]: 119/1686 cut-off events.
[2024-12-02 13:17:49,012 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-12-02 13:17:49,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 1686 events. 119/1686 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 13710 event pairs, 21 based on Foata normal form. 0/1406 useless extension candidates. Maximal degree in co-relation 1530. Up to 73 conditions per place.
[2024-12-02 13:17:49,031 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 15 selfloop transitions, 3 changer transitions 0/366 dead transitions.
[2024-12-02 13:17:49,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 366 transitions, 786 flow
[2024-12-02 13:17:49,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1158 transitions.
[2024-12-02 13:17:49,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9578163771712159
[2024-12-02 13:17:49,034 INFO L175 Difference]: Start difference. First operand has 356 places, 364 transitions, 744 flow. Second operand 3 states and 1158 transitions.
[2024-12-02 13:17:49,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 366 transitions, 786 flow
[2024-12-02 13:17:49,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 366 transitions, 786 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-12-02 13:17:49,039 INFO L231 Difference]: Finished difference. Result has 356 places, 364 transitions, 759 flow
[2024-12-02 13:17:49,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=356, PETRI_TRANSITIONS=364}
[2024-12-02 13:17:49,040 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places.
[2024-12-02 13:17:49,040 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 364 transitions, 759 flow
[2024-12-02 13:17:49,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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-12-02 13:17:49,041 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:49,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:49,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-12-02 13:17:49,041 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:49,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:49,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1282984152, now seen corresponding path program 1 times
[2024-12-02 13:17:49,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:49,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817047155]
[2024-12-02 13:17:49,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:49,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:49,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:49,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:49,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817047155]
[2024-12-02 13:17:49,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817047155] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:49,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:49,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:49,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368685185]
[2024-12-02 13:17:49,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:49,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:49,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:49,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:49,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:49,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403
[2024-12-02 13:17:49,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 364 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-12-02 13:17:49,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:49,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403
[2024-12-02 13:17:49,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:49,295 INFO L124 PetriNetUnfolderBase]: 57/1088 cut-off events.
[2024-12-02 13:17:49,295 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES.
[2024-12-02 13:17:49,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 1088 events. 57/1088 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6910 event pairs, 2 based on Foata normal form. 0/933 useless extension candidates. Maximal degree in co-relation 955. Up to 38 conditions per place.
[2024-12-02 13:17:49,311 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 16 selfloop transitions, 2 changer transitions 0/369 dead transitions.
[2024-12-02 13:17:49,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 369 transitions, 810 flow
[2024-12-02 13:17:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions.
[2024-12-02 13:17:49,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644334160463193
[2024-12-02 13:17:49,313 INFO L175 Difference]: Start difference. First operand has 356 places, 364 transitions, 759 flow. Second operand 3 states and 1166 transitions.
[2024-12-02 13:17:49,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 369 transitions, 810 flow
[2024-12-02 13:17:49,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 369 transitions, 810 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-12-02 13:17:49,319 INFO L231 Difference]: Finished difference. Result has 357 places, 364 transitions, 769 flow
[2024-12-02 13:17:49,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=357, PETRI_TRANSITIONS=364}
[2024-12-02 13:17:49,320 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -13 predicate places.
[2024-12-02 13:17:49,320 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 364 transitions, 769 flow
[2024-12-02 13:17:49,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-12-02 13:17:49,320 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:49,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:49,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-12-02 13:17:49,321 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:49,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:49,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1313359499, now seen corresponding path program 1 times
[2024-12-02 13:17:49,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:49,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142328132]
[2024-12-02 13:17:49,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:49,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:49,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:49,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142328132]
[2024-12-02 13:17:49,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142328132] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:49,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:49,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:49,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234947722]
[2024-12-02 13:17:49,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:49,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:49,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:49,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:49,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:49,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 403
[2024-12-02 13:17:49,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 364 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 384.3333333333333) internal successors, (1153), 3 states have internal predecessors, (1153), 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-12-02 13:17:49,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:49,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 403
[2024-12-02 13:17:49,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:49,552 INFO L124 PetriNetUnfolderBase]: 59/1040 cut-off events.
[2024-12-02 13:17:49,552 INFO L125 PetriNetUnfolderBase]: For 4/20 co-relation queries the response was YES.
[2024-12-02 13:17:49,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 1040 events. 59/1040 cut-off events. For 4/20 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6848 event pairs, 8 based on Foata normal form. 2/895 useless extension candidates. Maximal degree in co-relation 941. Up to 32 conditions per place.
[2024-12-02 13:17:49,566 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/365 dead transitions.
[2024-12-02 13:17:49,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 365 transitions, 799 flow
[2024-12-02 13:17:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions.
[2024-12-02 13:17:49,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555
[2024-12-02 13:17:49,568 INFO L175 Difference]: Start difference. First operand has 357 places, 364 transitions, 769 flow. Second operand 3 states and 1163 transitions.
[2024-12-02 13:17:49,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 365 transitions, 799 flow
[2024-12-02 13:17:49,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 365 transitions, 799 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-12-02 13:17:49,573 INFO L231 Difference]: Finished difference. Result has 358 places, 363 transitions, 771 flow
[2024-12-02 13:17:49,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=358, PETRI_TRANSITIONS=363}
[2024-12-02 13:17:49,574 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -12 predicate places.
[2024-12-02 13:17:49,574 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 363 transitions, 771 flow
[2024-12-02 13:17:49,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 384.3333333333333) internal successors, (1153), 3 states have internal predecessors, (1153), 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-12-02 13:17:49,574 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:49,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:49,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-12-02 13:17:49,575 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:49,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2071790774, now seen corresponding path program 1 times
[2024-12-02 13:17:49,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:49,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44618161]
[2024-12-02 13:17:49,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:49,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:49,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44618161]
[2024-12-02 13:17:49,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44618161] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:49,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:49,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:49,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525834350]
[2024-12-02 13:17:49,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:49,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:49,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:49,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:49,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:49,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 403
[2024-12-02 13:17:49,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 363 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 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-12-02 13:17:49,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:49,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 403
[2024-12-02 13:17:49,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:50,142 INFO L124 PetriNetUnfolderBase]: 341/3866 cut-off events.
[2024-12-02 13:17:50,142 INFO L125 PetriNetUnfolderBase]: For 62/74 co-relation queries the response was YES.
[2024-12-02 13:17:50,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4299 conditions, 3866 events. 341/3866 cut-off events. For 62/74 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 41144 event pairs, 56 based on Foata normal form. 0/3307 useless extension candidates. Maximal degree in co-relation 3570. Up to 320 conditions per place.
[2024-12-02 13:17:50,159 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 17 selfloop transitions, 4 changer transitions 0/365 dead transitions.
[2024-12-02 13:17:50,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 365 transitions, 819 flow
[2024-12-02 13:17:50,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1153 transitions.
[2024-12-02 13:17:50,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536807278742763
[2024-12-02 13:17:50,161 INFO L175 Difference]: Start difference. First operand has 358 places, 363 transitions, 771 flow. Second operand 3 states and 1153 transitions.
[2024-12-02 13:17:50,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 365 transitions, 819 flow
[2024-12-02 13:17:50,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 365 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 13:17:50,165 INFO L231 Difference]: Finished difference. Result has 355 places, 363 transitions, 787 flow
[2024-12-02 13:17:50,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=787, PETRI_PLACES=355, PETRI_TRANSITIONS=363}
[2024-12-02 13:17:50,166 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places.
[2024-12-02 13:17:50,166 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 363 transitions, 787 flow
[2024-12-02 13:17:50,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 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-12-02 13:17:50,166 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:50,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 13:17:50,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-12-02 13:17:50,167 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:50,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:50,167 INFO L85 PathProgramCache]: Analyzing trace with hash -465967603, now seen corresponding path program 1 times
[2024-12-02 13:17:50,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:50,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205766287]
[2024-12-02 13:17:50,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:50,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:50,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:50,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205766287]
[2024-12-02 13:17:50,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205766287] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:50,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:50,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:50,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32726542]
[2024-12-02 13:17:50,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:50,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:50,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:50,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:50,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:50,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403
[2024-12-02 13:17:50,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 363 transitions, 787 flow. Second operand has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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-12-02 13:17:50,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:50,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403
[2024-12-02 13:17:50,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:50,491 INFO L124 PetriNetUnfolderBase]: 151/2564 cut-off events.
[2024-12-02 13:17:50,492 INFO L125 PetriNetUnfolderBase]: For 8/11 co-relation queries the response was YES.
[2024-12-02 13:17:50,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 2564 events. 151/2564 cut-off events. For 8/11 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 24412 event pairs, 10 based on Foata normal form. 1/2204 useless extension candidates. Maximal degree in co-relation 2402. Up to 94 conditions per place.
[2024-12-02 13:17:50,504 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 18 selfloop transitions, 3 changer transitions 0/368 dead transitions.
[2024-12-02 13:17:50,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 368 transitions, 844 flow
[2024-12-02 13:17:50,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:50,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1161 transitions.
[2024-12-02 13:17:50,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9602977667493796
[2024-12-02 13:17:50,507 INFO L175 Difference]: Start difference. First operand has 355 places, 363 transitions, 787 flow. Second operand 3 states and 1161 transitions.
[2024-12-02 13:17:50,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 368 transitions, 844 flow
[2024-12-02 13:17:50,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 368 transitions, 844 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-12-02 13:17:50,511 INFO L231 Difference]: Finished difference. Result has 355 places, 363 transitions, 802 flow
[2024-12-02 13:17:50,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=802, PETRI_PLACES=355, PETRI_TRANSITIONS=363}
[2024-12-02 13:17:50,512 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places.
[2024-12-02 13:17:50,512 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 363 transitions, 802 flow
[2024-12-02 13:17:50,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 380.3333333333333) internal successors, (1141), 3 states have internal predecessors, (1141), 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-12-02 13:17:50,512 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:50,513 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:50,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-12-02 13:17:50,513 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:50,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:50,513 INFO L85 PathProgramCache]: Analyzing trace with hash -305609868, now seen corresponding path program 1 times
[2024-12-02 13:17:50,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:50,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189516151]
[2024-12-02 13:17:50,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:50,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:50,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:50,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189516151]
[2024-12-02 13:17:50,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189516151] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:50,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:50,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:50,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650985131]
[2024-12-02 13:17:50,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:50,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:50,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:50,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:50,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:50,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403
[2024-12-02 13:17:50,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 363 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-12-02 13:17:50,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:50,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403
[2024-12-02 13:17:50,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:50,918 INFO L124 PetriNetUnfolderBase]: 121/2849 cut-off events.
[2024-12-02 13:17:50,918 INFO L125 PetriNetUnfolderBase]: For 33/45 co-relation queries the response was YES.
[2024-12-02 13:17:50,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3103 conditions, 2849 events. 121/2849 cut-off events. For 33/45 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 25322 event pairs, 6 based on Foata normal form. 2/2521 useless extension candidates. Maximal degree in co-relation 2660. Up to 114 conditions per place.
[2024-12-02 13:17:50,936 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 16 selfloop transitions, 2 changer transitions 0/368 dead transitions.
[2024-12-02 13:17:50,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 368 transitions, 853 flow
[2024-12-02 13:17:50,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:50,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions.
[2024-12-02 13:17:50,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644334160463193
[2024-12-02 13:17:50,939 INFO L175 Difference]: Start difference. First operand has 355 places, 363 transitions, 802 flow. Second operand 3 states and 1166 transitions.
[2024-12-02 13:17:50,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 368 transitions, 853 flow
[2024-12-02 13:17:50,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 368 transitions, 853 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-12-02 13:17:50,944 INFO L231 Difference]: Finished difference. Result has 356 places, 363 transitions, 812 flow
[2024-12-02 13:17:50,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=356, PETRI_TRANSITIONS=363}
[2024-12-02 13:17:50,945 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places.
[2024-12-02 13:17:50,945 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 363 transitions, 812 flow
[2024-12-02 13:17:50,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-12-02 13:17:50,945 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:50,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:50,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-12-02 13:17:50,946 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:50,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:50,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1690903923, now seen corresponding path program 1 times
[2024-12-02 13:17:50,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:50,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666519192]
[2024-12-02 13:17:50,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:50,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:51,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:51,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666519192]
[2024-12-02 13:17:51,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666519192] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:51,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:51,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:51,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679491886]
[2024-12-02 13:17:51,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:51,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:51,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:51,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:51,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:51,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 403
[2024-12-02 13:17:51,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 363 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 384.6666666666667) internal successors, (1154), 3 states have internal predecessors, (1154), 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-12-02 13:17:51,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:51,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 403
[2024-12-02 13:17:51,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:51,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][349], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 100#L80true, 443#(= |#race~filename_5~0| 0), Black: 426#true, Black: 430#true, 432#(= |#race~filename_2~0| 0), 449#true, Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:51,534 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event
[2024-12-02 13:17:51,534 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event
[2024-12-02 13:17:51,535 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event
[2024-12-02 13:17:51,535 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event
[2024-12-02 13:17:51,537 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][349], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 100#L80true, 443#(= |#race~filename_5~0| 0), Black: 426#true, Black: 430#true, 432#(= |#race~filename_2~0| 0), 449#true, Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:51,537 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is not cut-off event
[2024-12-02 13:17:51,538 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event
[2024-12-02 13:17:51,538 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event
[2024-12-02 13:17:51,538 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event
[2024-12-02 13:17:51,538 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event
[2024-12-02 13:17:51,540 INFO L124 PetriNetUnfolderBase]: 166/3483 cut-off events.
[2024-12-02 13:17:51,541 INFO L125 PetriNetUnfolderBase]: For 35/124 co-relation queries the response was YES.
[2024-12-02 13:17:51,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3920 conditions, 3483 events. 166/3483 cut-off events. For 35/124 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 34474 event pairs, 24 based on Foata normal form. 5/3082 useless extension candidates. Maximal degree in co-relation 3253. Up to 99 conditions per place.
[2024-12-02 13:17:51,571 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/364 dead transitions.
[2024-12-02 13:17:51,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 364 transitions, 842 flow
[2024-12-02 13:17:51,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:51,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:51,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions.
[2024-12-02 13:17:51,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555
[2024-12-02 13:17:51,574 INFO L175 Difference]: Start difference. First operand has 356 places, 363 transitions, 812 flow. Second operand 3 states and 1163 transitions.
[2024-12-02 13:17:51,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 364 transitions, 842 flow
[2024-12-02 13:17:51,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 364 transitions, 842 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-12-02 13:17:51,579 INFO L231 Difference]: Finished difference. Result has 357 places, 362 transitions, 814 flow
[2024-12-02 13:17:51,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=814, PETRI_PLACES=357, PETRI_TRANSITIONS=362}
[2024-12-02 13:17:51,580 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -13 predicate places.
[2024-12-02 13:17:51,580 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 362 transitions, 814 flow
[2024-12-02 13:17:51,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 384.6666666666667) internal successors, (1154), 3 states have internal predecessors, (1154), 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-12-02 13:17:51,581 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:51,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:51,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-12-02 13:17:51,582 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:51,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:51,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1633276073, now seen corresponding path program 1 times
[2024-12-02 13:17:51,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:51,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399027275]
[2024-12-02 13:17:51,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:51,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:51,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:51,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399027275]
[2024-12-02 13:17:51,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399027275] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:51,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:51,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:51,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804991927]
[2024-12-02 13:17:51,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:51,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:51,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:51,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:51,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:51,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403
[2024-12-02 13:17:51,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 362 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-12-02 13:17:51,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:51,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403
[2024-12-02 13:17:51,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:52,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][366], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 100#L80true, 443#(= |#race~filename_5~0| 0), 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, 432#(= |#race~filename_2~0| 0), 449#true, Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:52,181 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event
[2024-12-02 13:17:52,182 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event
[2024-12-02 13:17:52,182 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event
[2024-12-02 13:17:52,182 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event
[2024-12-02 13:17:52,184 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][366], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), 100#L80true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, 432#(= |#race~filename_2~0| 0), 449#true, Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:52,184 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is not cut-off event
[2024-12-02 13:17:52,184 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event
[2024-12-02 13:17:52,184 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event
[2024-12-02 13:17:52,184 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event
[2024-12-02 13:17:52,184 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event
[2024-12-02 13:17:52,195 INFO L124 PetriNetUnfolderBase]: 113/2930 cut-off events.
[2024-12-02 13:17:52,195 INFO L125 PetriNetUnfolderBase]: For 17/35 co-relation queries the response was YES.
[2024-12-02 13:17:52,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3260 conditions, 2930 events. 113/2930 cut-off events. For 17/35 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 26764 event pairs, 6 based on Foata normal form. 1/2619 useless extension candidates. Maximal degree in co-relation 2815. Up to 87 conditions per place.
[2024-12-02 13:17:52,224 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 16 selfloop transitions, 2 changer transitions 0/367 dead transitions.
[2024-12-02 13:17:52,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 865 flow
[2024-12-02 13:17:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions.
[2024-12-02 13:17:52,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9644334160463193
[2024-12-02 13:17:52,226 INFO L175 Difference]: Start difference. First operand has 357 places, 362 transitions, 814 flow. Second operand 3 states and 1166 transitions.
[2024-12-02 13:17:52,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 865 flow
[2024-12-02 13:17:52,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 367 transitions, 861 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 13:17:52,230 INFO L231 Difference]: Finished difference. Result has 356 places, 362 transitions, 820 flow
[2024-12-02 13:17:52,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=356, PETRI_TRANSITIONS=362}
[2024-12-02 13:17:52,231 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places.
[2024-12-02 13:17:52,231 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 362 transitions, 820 flow
[2024-12-02 13:17:52,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.3333333333333) internal successors, (1150), 3 states have internal predecessors, (1150), 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-12-02 13:17:52,232 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:52,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:52,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-12-02 13:17:52,232 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:52,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:52,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1646992267, now seen corresponding path program 1 times
[2024-12-02 13:17:52,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:52,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628557733]
[2024-12-02 13:17:52,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:52,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:52,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:52,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628557733]
[2024-12-02 13:17:52,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628557733] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:52,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:52,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:52,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080852985]
[2024-12-02 13:17:52,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:52,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:52,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:52,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:52,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:52,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 403
[2024-12-02 13:17:52,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 362 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 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-12-02 13:17:52,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:52,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 403
[2024-12-02 13:17:52,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:53,223 INFO L124 PetriNetUnfolderBase]: 473/7671 cut-off events.
[2024-12-02 13:17:53,223 INFO L125 PetriNetUnfolderBase]: For 134/144 co-relation queries the response was YES.
[2024-12-02 13:17:53,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8649 conditions, 7671 events. 473/7671 cut-off events. For 134/144 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 91397 event pairs, 76 based on Foata normal form. 0/6925 useless extension candidates. Maximal degree in co-relation 7730. Up to 624 conditions per place.
[2024-12-02 13:17:53,256 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 19 selfloop transitions, 4 changer transitions 0/366 dead transitions.
[2024-12-02 13:17:53,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 366 transitions, 878 flow
[2024-12-02 13:17:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1155 transitions.
[2024-12-02 13:17:53,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9553349875930521
[2024-12-02 13:17:53,259 INFO L175 Difference]: Start difference. First operand has 356 places, 362 transitions, 820 flow. Second operand 3 states and 1155 transitions.
[2024-12-02 13:17:53,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 366 transitions, 878 flow
[2024-12-02 13:17:53,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 366 transitions, 878 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-12-02 13:17:53,265 INFO L231 Difference]: Finished difference. Result has 355 places, 362 transitions, 840 flow
[2024-12-02 13:17:53,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=355, PETRI_TRANSITIONS=362}
[2024-12-02 13:17:53,266 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places.
[2024-12-02 13:17:53,266 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 362 transitions, 840 flow
[2024-12-02 13:17:53,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 377.6666666666667) internal successors, (1133), 3 states have internal predecessors, (1133), 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-12-02 13:17:53,267 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:53,267 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:53,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-12-02 13:17:53,267 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:53,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:53,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1862235787, now seen corresponding path program 1 times
[2024-12-02 13:17:53,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:53,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045693445]
[2024-12-02 13:17:53,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:53,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:53,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:53,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:53,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045693445]
[2024-12-02 13:17:53,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045693445] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:53,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:53,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:53,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86777462]
[2024-12-02 13:17:53,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:53,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:53,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:53,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:53,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:53,334 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 403
[2024-12-02 13:17:53,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 362 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 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-12-02 13:17:53,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:53,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 403
[2024-12-02 13:17:53,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:53,867 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1068] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][225], [424#(= |#race~isNull_0~0| 0), 452#true, 428#(= |#race~isNull_3~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 445#true, Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,867 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event
[2024-12-02 13:17:53,867 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event
[2024-12-02 13:17:53,867 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event
[2024-12-02 13:17:53,867 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event
[2024-12-02 13:17:53,922 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,922 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event
[2024-12-02 13:17:53,922 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event
[2024-12-02 13:17:53,922 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event
[2024-12-02 13:17:53,922 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event
[2024-12-02 13:17:53,923 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,923 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event
[2024-12-02 13:17:53,923 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event
[2024-12-02 13:17:53,923 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event
[2024-12-02 13:17:53,923 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event
[2024-12-02 13:17:53,923 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event
[2024-12-02 13:17:53,924 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1068] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][225], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,924 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event
[2024-12-02 13:17:53,924 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event
[2024-12-02 13:17:53,924 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event
[2024-12-02 13:17:53,924 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event
[2024-12-02 13:17:53,924 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1068] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][225], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,924 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event
[2024-12-02 13:17:53,924 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event
[2024-12-02 13:17:53,924 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event
[2024-12-02 13:17:53,924 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event
[2024-12-02 13:17:53,924 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event
[2024-12-02 13:17:53,924 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1068] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][225], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,924 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event
[2024-12-02 13:17:53,924 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event
[2024-12-02 13:17:53,925 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event
[2024-12-02 13:17:53,925 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event
[2024-12-02 13:17:53,925 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event
[2024-12-02 13:17:53,925 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event
[2024-12-02 13:17:53,926 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1068] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][225], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,926 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event
[2024-12-02 13:17:53,926 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event
[2024-12-02 13:17:53,926 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event
[2024-12-02 13:17:53,926 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event
[2024-12-02 13:17:53,926 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event
[2024-12-02 13:17:53,926 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event
[2024-12-02 13:17:53,926 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event
[2024-12-02 13:17:53,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,928 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event
[2024-12-02 13:17:53,928 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:53,928 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event
[2024-12-02 13:17:53,928 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:53,928 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,928 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event
[2024-12-02 13:17:53,929 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:53,929 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event
[2024-12-02 13:17:53,929 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:53,929 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event
[2024-12-02 13:17:53,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 95#L56-42true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,931 INFO L294 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event
[2024-12-02 13:17:53,931 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event
[2024-12-02 13:17:53,931 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event
[2024-12-02 13:17:53,931 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event
[2024-12-02 13:17:53,932 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 95#L56-42true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,932 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event
[2024-12-02 13:17:53,932 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event
[2024-12-02 13:17:53,932 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event
[2024-12-02 13:17:53,932 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event
[2024-12-02 13:17:53,932 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event
[2024-12-02 13:17:53,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 44#L58true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,939 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event
[2024-12-02 13:17:53,939 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event
[2024-12-02 13:17:53,939 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event
[2024-12-02 13:17:53,939 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event
[2024-12-02 13:17:53,939 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 44#L58true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,939 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event
[2024-12-02 13:17:53,939 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event
[2024-12-02 13:17:53,939 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event
[2024-12-02 13:17:53,939 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event
[2024-12-02 13:17:53,940 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event
[2024-12-02 13:17:53,940 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 223#L56-40true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,940 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is not cut-off event
[2024-12-02 13:17:53,940 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event
[2024-12-02 13:17:53,941 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event
[2024-12-02 13:17:53,941 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event
[2024-12-02 13:17:53,941 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event
[2024-12-02 13:17:53,941 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event
[2024-12-02 13:17:53,941 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 165#L56-41true, Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,941 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event
[2024-12-02 13:17:53,941 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event
[2024-12-02 13:17:53,941 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:53,941 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event
[2024-12-02 13:17:53,941 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:53,941 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event
[2024-12-02 13:17:53,942 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][344], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 462#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 95#L56-42true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,942 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event
[2024-12-02 13:17:53,942 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event
[2024-12-02 13:17:53,942 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event
[2024-12-02 13:17:53,942 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event
[2024-12-02 13:17:53,942 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event
[2024-12-02 13:17:53,942 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event
[2024-12-02 13:17:53,946 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][307], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 44#L58true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:53,946 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is not cut-off event
[2024-12-02 13:17:53,946 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event
[2024-12-02 13:17:53,946 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event
[2024-12-02 13:17:53,946 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event
[2024-12-02 13:17:53,946 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is not cut-off event
[2024-12-02 13:17:53,947 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event
[2024-12-02 13:17:53,951 INFO L124 PetriNetUnfolderBase]: 375/3955 cut-off events.
[2024-12-02 13:17:53,952 INFO L125 PetriNetUnfolderBase]: For 240/323 co-relation queries the response was YES.
[2024-12-02 13:17:53,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5021 conditions, 3955 events. 375/3955 cut-off events. For 240/323 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 40721 event pairs, 82 based on Foata normal form. 3/3591 useless extension candidates. Maximal degree in co-relation 4375. Up to 398 conditions per place.
[2024-12-02 13:17:53,970 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/363 dead transitions.
[2024-12-02 13:17:53,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 363 transitions, 870 flow
[2024-12-02 13:17:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:53,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions.
[2024-12-02 13:17:53,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555
[2024-12-02 13:17:53,972 INFO L175 Difference]: Start difference. First operand has 355 places, 362 transitions, 840 flow. Second operand 3 states and 1163 transitions.
[2024-12-02 13:17:53,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 363 transitions, 870 flow
[2024-12-02 13:17:53,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 363 transitions, 870 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-12-02 13:17:53,978 INFO L231 Difference]: Finished difference. Result has 356 places, 361 transitions, 842 flow
[2024-12-02 13:17:53,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=356, PETRI_TRANSITIONS=361}
[2024-12-02 13:17:53,978 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places.
[2024-12-02 13:17:53,979 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 361 transitions, 842 flow
[2024-12-02 13:17:53,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.0) internal successors, (1155), 3 states have internal predecessors, (1155), 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-12-02 13:17:53,979 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:53,979 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:53,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-12-02 13:17:53,979 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:53,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:53,980 INFO L85 PathProgramCache]: Analyzing trace with hash -96543169, now seen corresponding path program 1 times
[2024-12-02 13:17:53,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:53,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702809503]
[2024-12-02 13:17:53,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:53,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:54,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:54,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702809503]
[2024-12-02 13:17:54,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702809503] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:54,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:54,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:54,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423301467]
[2024-12-02 13:17:54,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:54,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:54,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:54,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:54,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:54,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403
[2024-12-02 13:17:54,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 361 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 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-12-02 13:17:54,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:54,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403
[2024-12-02 13:17:54,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:54,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][348], [424#(= |#race~isNull_0~0| 0), 452#true, 463#true, 428#(= |#race~isNull_3~0| 0), Black: 422#true, 100#L80true, 443#(= |#race~filename_5~0| 0), Black: 456#true, Black: 426#true, 460#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 445#true, Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:54,636 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is not cut-off event
[2024-12-02 13:17:54,636 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event
[2024-12-02 13:17:54,637 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event
[2024-12-02 13:17:54,637 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event
[2024-12-02 13:17:54,725 INFO L124 PetriNetUnfolderBase]: 252/5660 cut-off events.
[2024-12-02 13:17:54,725 INFO L125 PetriNetUnfolderBase]: For 71/83 co-relation queries the response was YES.
[2024-12-02 13:17:54,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6543 conditions, 5660 events. 252/5660 cut-off events. For 71/83 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 61192 event pairs, 20 based on Foata normal form. 0/5264 useless extension candidates. Maximal degree in co-relation 5776. Up to 304 conditions per place.
[2024-12-02 13:17:54,754 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 15 selfloop transitions, 2 changer transitions 0/365 dead transitions.
[2024-12-02 13:17:54,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 365 transitions, 888 flow
[2024-12-02 13:17:54,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions.
[2024-12-02 13:17:54,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9636062861869313
[2024-12-02 13:17:54,756 INFO L175 Difference]: Start difference. First operand has 356 places, 361 transitions, 842 flow. Second operand 3 states and 1165 transitions.
[2024-12-02 13:17:54,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 365 transitions, 888 flow
[2024-12-02 13:17:54,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 365 transitions, 884 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-12-02 13:17:54,763 INFO L231 Difference]: Finished difference. Result has 355 places, 361 transitions, 848 flow
[2024-12-02 13:17:54,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=355, PETRI_TRANSITIONS=361}
[2024-12-02 13:17:54,764 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places.
[2024-12-02 13:17:54,764 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 361 transitions, 848 flow
[2024-12-02 13:17:54,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 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-12-02 13:17:54,765 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:54,765 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:54,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-12-02 13:17:54,765 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:54,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:54,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2086252291, now seen corresponding path program 1 times
[2024-12-02 13:17:54,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:54,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458865296]
[2024-12-02 13:17:54,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:54,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:54,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:54,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458865296]
[2024-12-02 13:17:54,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458865296] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:54,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:54,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:54,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820258384]
[2024-12-02 13:17:54,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:54,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:54,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:54,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:54,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:54,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 403
[2024-12-02 13:17:54,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 361 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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-12-02 13:17:54,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:54,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 403
[2024-12-02 13:17:54,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:55,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 100#L80true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), 467#true, Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:55,429 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event
[2024-12-02 13:17:55,429 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event
[2024-12-02 13:17:55,429 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event
[2024-12-02 13:17:55,429 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event
[2024-12-02 13:17:55,429 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 443#(= |#race~filename_5~0| 0), 465#(= |#race~filename_7~0| 0), 100#L80true, 467#true, Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:55,429 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event
[2024-12-02 13:17:55,429 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event
[2024-12-02 13:17:55,429 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event
[2024-12-02 13:17:55,429 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event
[2024-12-02 13:17:55,429 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event
[2024-12-02 13:17:55,430 INFO L124 PetriNetUnfolderBase]: 201/5128 cut-off events.
[2024-12-02 13:17:55,430 INFO L125 PetriNetUnfolderBase]: For 21/57 co-relation queries the response was YES.
[2024-12-02 13:17:55,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5840 conditions, 5128 events. 201/5128 cut-off events. For 21/57 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 53987 event pairs, 6 based on Foata normal form. 0/4785 useless extension candidates. Maximal degree in co-relation 5195. Up to 140 conditions per place.
[2024-12-02 13:17:55,464 INFO L140 encePairwiseOnDemand]: 401/403 looper letters, 8 selfloop transitions, 1 changer transitions 0/360 dead transitions.
[2024-12-02 13:17:55,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 360 transitions, 864 flow
[2024-12-02 13:17:55,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions.
[2024-12-02 13:17:55,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9636062861869313
[2024-12-02 13:17:55,508 INFO L175 Difference]: Start difference. First operand has 355 places, 361 transitions, 848 flow. Second operand 3 states and 1165 transitions.
[2024-12-02 13:17:55,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 360 transitions, 864 flow
[2024-12-02 13:17:55,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 360 transitions, 864 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-12-02 13:17:55,511 INFO L231 Difference]: Finished difference. Result has 356 places, 360 transitions, 848 flow
[2024-12-02 13:17:55,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=356, PETRI_TRANSITIONS=360}
[2024-12-02 13:17:55,512 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places.
[2024-12-02 13:17:55,512 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 360 transitions, 848 flow
[2024-12-02 13:17:55,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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-12-02 13:17:55,512 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:55,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:55,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-12-02 13:17:55,513 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:55,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:55,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1728951746, now seen corresponding path program 1 times
[2024-12-02 13:17:55,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:55,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316680669]
[2024-12-02 13:17:55,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:55,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:55,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:55,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:55,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316680669]
[2024-12-02 13:17:55,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316680669] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:55,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:55,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:55,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901848654]
[2024-12-02 13:17:55,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:55,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:55,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:55,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:55,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:55,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 403
[2024-12-02 13:17:55,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 360 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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-12-02 13:17:55,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:55,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 403
[2024-12-02 13:17:55,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:56,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] thread3EXIT-->L80: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][346], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 100#L80true, 443#(= |#race~filename_5~0| 0), 467#true, Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:56,094 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event
[2024-12-02 13:17:56,094 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event
[2024-12-02 13:17:56,095 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event
[2024-12-02 13:17:56,095 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event
[2024-12-02 13:17:56,097 INFO L124 PetriNetUnfolderBase]: 199/5606 cut-off events.
[2024-12-02 13:17:56,097 INFO L125 PetriNetUnfolderBase]: For 22/66 co-relation queries the response was YES.
[2024-12-02 13:17:56,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6401 conditions, 5606 events. 199/5606 cut-off events. For 22/66 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 60400 event pairs, 23 based on Foata normal form. 0/5234 useless extension candidates. Maximal degree in co-relation 6161. Up to 158 conditions per place.
[2024-12-02 13:17:56,142 INFO L140 encePairwiseOnDemand]: 401/403 looper letters, 8 selfloop transitions, 1 changer transitions 0/359 dead transitions.
[2024-12-02 13:17:56,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 359 transitions, 864 flow
[2024-12-02 13:17:56,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:56,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions.
[2024-12-02 13:17:56,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9636062861869313
[2024-12-02 13:17:56,143 INFO L175 Difference]: Start difference. First operand has 356 places, 360 transitions, 848 flow. Second operand 3 states and 1165 transitions.
[2024-12-02 13:17:56,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 359 transitions, 864 flow
[2024-12-02 13:17:56,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 359 transitions, 863 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-12-02 13:17:56,148 INFO L231 Difference]: Finished difference. Result has 356 places, 359 transitions, 847 flow
[2024-12-02 13:17:56,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=847, PETRI_PLACES=356, PETRI_TRANSITIONS=359}
[2024-12-02 13:17:56,148 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places.
[2024-12-02 13:17:56,148 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 359 transitions, 847 flow
[2024-12-02 13:17:56,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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-12-02 13:17:56,149 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-12-02 13:17:56,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-12-02 13:17:56,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-12-02 13:17:56,149 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] ===
[2024-12-02 13:17:56,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-12-02 13:17:56,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1857811918, now seen corresponding path program 1 times
[2024-12-02 13:17:56,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-12-02 13:17:56,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843402252]
[2024-12-02 13:17:56,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-12-02 13:17:56,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-12-02 13:17:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-12-02 13:17:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-12-02 13:17:56,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-12-02 13:17:56,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843402252]
[2024-12-02 13:17:56,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843402252] provided 1 perfect and 0 imperfect interpolant sequences
[2024-12-02 13:17:56,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-12-02 13:17:56,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-12-02 13:17:56,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609164474]
[2024-12-02 13:17:56,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-12-02 13:17:56,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-12-02 13:17:56,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-12-02 13:17:56,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-12-02 13:17:56,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-12-02 13:17:56,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 403
[2024-12-02 13:17:56,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 359 transitions, 847 flow. Second operand has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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-12-02 13:17:56,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-12-02 13:17:56,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 403
[2024-12-02 13:17:56,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-12-02 13:17:56,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [424#(= |#race~isNull_0~0| 0), 452#true, 463#true, 428#(= |#race~isNull_3~0| 0), 470#true, Black: 422#true, 443#(= |#race~filename_5~0| 0), Black: 456#true, Black: 426#true, 473#true, Black: 430#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 445#true, 165#L56-41true, Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:56,565 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event
[2024-12-02 13:17:56,565 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event
[2024-12-02 13:17:56,565 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event
[2024-12-02 13:17:56,565 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event
[2024-12-02 13:17:56,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:56,601 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event
[2024-12-02 13:17:56,601 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:56,601 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:56,601 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event
[2024-12-02 13:17:56,613 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1072] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 165#L56-41true, Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:56,613 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event
[2024-12-02 13:17:56,613 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:56,613 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:56,613 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event
[2024-12-02 13:17:56,613 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event
[2024-12-02 13:17:56,613 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1072] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:56,613 INFO L294 olderBase$Statistics]: this new event has 271 ancestors and is cut-off event
[2024-12-02 13:17:56,613 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:56,613 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:56,614 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event
[2024-12-02 13:17:56,614 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event
[2024-12-02 13:17:56,614 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event
[2024-12-02 13:17:56,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][304], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:56,614 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event
[2024-12-02 13:17:56,614 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:56,614 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event
[2024-12-02 13:17:56,614 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:56,615 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1137] thread2EXIT-->L79: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][304], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), Black: 437#true, 165#L56-41true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:56,615 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event
[2024-12-02 13:17:56,615 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:56,615 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event
[2024-12-02 13:17:56,615 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:56,615 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event
[2024-12-02 13:17:56,616 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1072] L56-40-->L56-41: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][233], [Black: 445#true, 424#(= |#race~isNull_0~0| 0), 428#(= |#race~isNull_3~0| 0), 470#true, Black: 452#true, 447#(= |#race~filename_1~0| 0), Black: 422#true, 465#(= |#race~filename_7~0| 0), 443#(= |#race~filename_5~0| 0), Black: 456#true, 454#(= |#race~filename_4~0| 0), Black: 426#true, 473#true, Black: 430#true, Black: 463#true, 458#(= |#race~filename_8~0| 0), 432#(= |#race~filename_2~0| 0), 165#L56-41true, Black: 437#true, 45#L79true, Black: 441#true, 439#(= |#race~isNull_6~0| 0)])
[2024-12-02 13:17:56,616 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is not cut-off event
[2024-12-02 13:17:56,616 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event
[2024-12-02 13:17:56,616 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event
[2024-12-02 13:17:56,616 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event
[2024-12-02 13:17:56,616 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event
[2024-12-02 13:17:56,616 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is not cut-off event
[2024-12-02 13:17:56,616 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event
[2024-12-02 13:17:56,618 INFO L124 PetriNetUnfolderBase]: 199/3881 cut-off events.
[2024-12-02 13:17:56,618 INFO L125 PetriNetUnfolderBase]: For 64/102 co-relation queries the response was YES.
[2024-12-02 13:17:56,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4594 conditions, 3881 events. 199/3881 cut-off events. For 64/102 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 39171 event pairs, 48 based on Foata normal form. 24/3604 useless extension candidates. Maximal degree in co-relation 4486. Up to 239 conditions per place.
[2024-12-02 13:17:56,637 INFO L140 encePairwiseOnDemand]: 401/403 looper letters, 0 selfloop transitions, 0 changer transitions 358/358 dead transitions.
[2024-12-02 13:17:56,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 861 flow
[2024-12-02 13:17:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-12-02 13:17:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-12-02 13:17:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1164 transitions.
[2024-12-02 13:17:56,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627791563275434
[2024-12-02 13:17:56,638 INFO L175 Difference]: Start difference. First operand has 356 places, 359 transitions, 847 flow. Second operand 3 states and 1164 transitions.
[2024-12-02 13:17:56,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 861 flow
[2024-12-02 13:17:56,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 358 transitions, 860 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-12-02 13:17:56,641 INFO L231 Difference]: Finished difference. Result has 356 places, 0 transitions, 0 flow
[2024-12-02 13:17:56,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=356, PETRI_TRANSITIONS=0}
[2024-12-02 13:17:56,641 INFO L279 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places.
[2024-12-02 13:17:56,641 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 0 transitions, 0 flow
[2024-12-02 13:17:56,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 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-12-02 13:17:56,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (68 of 69 remaining)
[2024-12-02 13:17:56,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining)
[2024-12-02 13:17:56,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining)
[2024-12-02 13:17:56,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining)
[2024-12-02 13:17:56,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining)
[2024-12-02 13:17:56,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining)
[2024-12-02 13:17:56,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining)
[2024-12-02 13:17:56,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining)
[2024-12-02 13:17:56,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining)
[2024-12-02 13:17:56,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining)
[2024-12-02 13:17:56,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining)
[2024-12-02 13:17:56,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining)
[2024-12-02 13:17:56,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining)
[2024-12-02 13:17:56,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining)
[2024-12-02 13:17:56,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining)
[2024-12-02 13:17:56,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining)
[2024-12-02 13:17:56,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining)
[2024-12-02 13:17:56,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining)
[2024-12-02 13:17:56,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining)
[2024-12-02 13:17:56,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining)
[2024-12-02 13:17:56,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining)
[2024-12-02 13:17:56,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining)
[2024-12-02 13:17:56,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining)
[2024-12-02 13:17:56,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining)
[2024-12-02 13:17:56,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining)
[2024-12-02 13:17:56,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining)
[2024-12-02 13:17:56,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining)
[2024-12-02 13:17:56,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining)
[2024-12-02 13:17:56,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining)
[2024-12-02 13:17:56,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining)
[2024-12-02 13:17:56,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining)
[2024-12-02 13:17:56,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining)
[2024-12-02 13:17:56,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining)
[2024-12-02 13:17:56,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining)
[2024-12-02 13:17:56,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining)
[2024-12-02 13:17:56,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining)
[2024-12-02 13:17:56,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining)
[2024-12-02 13:17:56,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining)
[2024-12-02 13:17:56,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining)
[2024-12-02 13:17:56,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining)
[2024-12-02 13:17:56,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 69 remaining)
[2024-12-02 13:17:56,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 69 remaining)
[2024-12-02 13:17:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining)
[2024-12-02 13:17:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining)
[2024-12-02 13:17:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining)
[2024-12-02 13:17:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining)
[2024-12-02 13:17:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining)
[2024-12-02 13:17:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining)
[2024-12-02 13:17:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining)
[2024-12-02 13:17:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining)
[2024-12-02 13:17:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining)
[2024-12-02 13:17:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining)
[2024-12-02 13:17:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining)
[2024-12-02 13:17:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining)
[2024-12-02 13:17:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining)
[2024-12-02 13:17:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining)
[2024-12-02 13:17:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining)
[2024-12-02 13:17:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining)
[2024-12-02 13:17:56,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining)
[2024-12-02 13:17:56,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining)
[2024-12-02 13:17:56,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining)
[2024-12-02 13:17:56,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining)
[2024-12-02 13:17:56,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining)
[2024-12-02 13:17:56,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining)
[2024-12-02 13:17:56,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining)
[2024-12-02 13:17:56,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining)
[2024-12-02 13:17:56,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining)
[2024-12-02 13:17:56,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining)
[2024-12-02 13:17:56,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining)
[2024-12-02 13:17:56,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-12-02 13:17:56,649 INFO L422 BasicCegarLoop]: Path program 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]
[2024-12-02 13:17:56,654 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-12-02 13:17:56,654 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-12-02 13:17:56,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:17:56 BasicIcfg
[2024-12-02 13:17:56,659 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-12-02 13:17:56,659 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-12-02 13:17:56,659 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-12-02 13:17:56,659 INFO L274 PluginConnector]: Witness Printer initialized
[2024-12-02 13:17:56,660 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:17:45" (3/4) ...
[2024-12-02 13:17:56,662 INFO L146 WitnessPrinter]: Generating witness for correct program
[2024-12-02 13:17:56,664 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1
[2024-12-02 13:17:56,664 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2
[2024-12-02 13:17:56,664 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3
[2024-12-02 13:17:56,667 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges
[2024-12-02 13:17:56,667 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges
[2024-12-02 13:17:56,667 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-12-02 13:17:56,667 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-12-02 13:17:56,741 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1/witness.graphml
[2024-12-02 13:17:56,741 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1/witness.yml
[2024-12-02 13:17:56,741 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-12-02 13:17:56,742 INFO L158 Benchmark]: Toolchain (without parser) took 11925.36ms. Allocated memory was 142.6MB in the beginning and 813.7MB in the end (delta: 671.1MB). Free memory was 119.9MB in the beginning and 540.2MB in the end (delta: -420.3MB). Peak memory consumption was 247.9MB. Max. memory is 16.1GB.
[2024-12-02 13:17:56,742 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 142.6MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 13:17:56,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.34ms. Allocated memory is still 142.6MB. Free memory was 119.7MB in the beginning and 107.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-12-02 13:17:56,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.30ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 105.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-12-02 13:17:56,743 INFO L158 Benchmark]: Boogie Preprocessor took 26.78ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 103.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-12-02 13:17:56,743 INFO L158 Benchmark]: RCFGBuilder took 558.33ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 77.4MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-12-02 13:17:56,744 INFO L158 Benchmark]: TraceAbstraction took 11026.84ms. Allocated memory was 142.6MB in the beginning and 813.7MB in the end (delta: 671.1MB). Free memory was 77.0MB in the beginning and 544.5MB in the end (delta: -467.5MB). Peak memory consumption was 499.2MB. Max. memory is 16.1GB.
[2024-12-02 13:17:56,744 INFO L158 Benchmark]: Witness Printer took 82.15ms. Allocated memory is still 813.7MB. Free memory was 544.5MB in the beginning and 540.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-12-02 13:17:56,746 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.33ms. Allocated memory is still 142.6MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 191.34ms. Allocated memory is still 142.6MB. Free memory was 119.7MB in the beginning and 107.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 34.30ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 105.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 26.78ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 103.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 558.33ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 77.4MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* TraceAbstraction took 11026.84ms. Allocated memory was 142.6MB in the beginning and 813.7MB in the end (delta: 671.1MB). Free memory was 77.0MB in the beginning and 544.5MB in the end (delta: -467.5MB). Peak memory consumption was 499.2MB. Max. memory is 16.1GB.
* Witness Printer took 82.15ms. Allocated memory is still 813.7MB. Free memory was 544.5MB in the beginning and 540.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 44]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 44]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 44]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 44]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 44]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 44]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 44]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 44]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 44]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 50]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 50]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 50]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 50]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 50]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 50]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 50]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 50]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 50]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 56]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 56]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 56]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 56]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 56]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 56]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 56]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 56]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 56]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 64]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 65]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 66]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 67]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 68]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 69]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 70]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 71]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 72]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 82]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 82]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 82]: there are no data races
For all program executions holds that there are no data races at this location
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 611 locations, 69 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.9s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 482 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 646 IncrementalHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 91 mSDtfsCounter, 646 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=848occurred in iteration=21, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2438 NumberOfCodeBlocks, 2438 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2414 ConstructedInterpolants, 0 QuantifiedInterpolants, 2462 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
- AllSpecificationsHoldResult: All specifications hold
39 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2024-12-02 13:17:56,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_858d77aa-b032-4d52-8a09-bdbaa701260d/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE