./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 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU/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_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU --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.2.5-dev-4fc63b2 [2024-10-31 21:59:07,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:59:07,765 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 21:59:07,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:59:07,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:59:07,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:59:07,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:59:07,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:59:07,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:59:07,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:59:07,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:59:07,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:59:07,818 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:59:07,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:59:07,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:59:07,821 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:59:07,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:59:07,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:59:07,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:59:07,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:59:07,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:59:07,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:59:07,827 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 21:59:07,828 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:59:07,828 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 21:59:07,828 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:59:07,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:59:07,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:59:07,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:59:07,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:59:07,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:59:07,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:59:07,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:59:07,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:59:07,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:59:07,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:59:07,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:59:07,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:59:07,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:59:07,835 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:59:07,835 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:59:07,836 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU 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-10-31 21:59:08,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:59:08,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:59:08,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:59:08,198 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:59:08,199 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:59:08,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c Unable to find full path for "g++" [2024-10-31 21:59:10,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:59:10,428 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:59:10,428 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2024-10-31 21:59:10,437 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU/data/a9d327a5d/08829e3a741d4b19a95f1a607c8ea5f3/FLAG1e0d243c1 [2024-10-31 21:59:10,462 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU/data/a9d327a5d/08829e3a741d4b19a95f1a607c8ea5f3 [2024-10-31 21:59:10,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:59:10,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:59:10,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:59:10,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:59:10,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:59:10,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:59:10" (1/1) ... [2024-10-31 21:59:10,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fbc5d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:10, skipping insertion in model container [2024-10-31 21:59:10,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:59:10" (1/1) ... [2024-10-31 21:59:10,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:59:10,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:59:10,844 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:59:10,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:59:10,921 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:59:10,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:10 WrapperNode [2024-10-31 21:59:10,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:59:10,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:59:10,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:59:10,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:59:10,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:10" (1/1) ... [2024-10-31 21:59:10,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:10" (1/1) ... [2024-10-31 21:59:10,983 INFO L138 Inliner]: procedures = 22, calls = 16, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 304 [2024-10-31 21:59:10,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:59:10,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:59:10,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:59:10,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:59:10,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:10" (1/1) ... [2024-10-31 21:59:11,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:10" (1/1) ... [2024-10-31 21:59:11,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:10" (1/1) ... [2024-10-31 21:59:11,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:10" (1/1) ... [2024-10-31 21:59:11,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:10" (1/1) ... [2024-10-31 21:59:11,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:10" (1/1) ... [2024-10-31 21:59:11,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:10" (1/1) ... [2024-10-31 21:59:11,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:10" (1/1) ... [2024-10-31 21:59:11,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:59:11,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:59:11,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:59:11,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:59:11,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:10" (1/1) ... [2024-10-31 21:59:11,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:59:11,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:59:11,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:59:11,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:59:11,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:59:11,122 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-31 21:59:11,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-31 21:59:11,122 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-31 21:59:11,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-31 21:59:11,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-31 21:59:11,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-31 21:59:11,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 21:59:11,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:59:11,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:59:11,126 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 21:59:11,269 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:59:11,272 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:59:11,860 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 21:59:11,860 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:59:11,897 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:59:11,897 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 21:59:11,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:59:11 BoogieIcfgContainer [2024-10-31 21:59:11,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:59:11,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:59:11,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:59:11,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:59:11,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:59:10" (1/3) ... [2024-10-31 21:59:11,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f660ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:59:11, skipping insertion in model container [2024-10-31 21:59:11,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:10" (2/3) ... [2024-10-31 21:59:11,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f660ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:59:11, skipping insertion in model container [2024-10-31 21:59:11,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:59:11" (3/3) ... [2024-10-31 21:59:11,911 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2024-10-31 21:59:11,933 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:59:11,933 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2024-10-31 21:59:11,934 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 21:59:12,124 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-31 21:59:12,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 392 places, 403 transitions, 827 flow [2024-10-31 21:59:12,439 INFO L124 PetriNetUnfolderBase]: 21/400 cut-off events. [2024-10-31 21:59:12,439 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-31 21:59:12,454 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-10-31 21:59:12,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 392 places, 403 transitions, 827 flow [2024-10-31 21:59:12,469 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 370 places, 379 transitions, 776 flow [2024-10-31 21:59:12,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:59:12,493 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;@6002e602, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:59:12,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2024-10-31 21:59:12,502 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 21:59:12,503 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-10-31 21:59:12,503 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:59:12,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:12,504 INFO L204 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-10-31 21:59:12,505 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-10-31 21:59:12,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:12,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1689132341, now seen corresponding path program 1 times [2024-10-31 21:59:12,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:12,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398728185] [2024-10-31 21:59:12,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:12,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:12,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:12,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:12,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398728185] [2024-10-31 21:59:12,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398728185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:12,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:12,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:12,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589423667] [2024-10-31 21:59:12,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:12,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:12,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:12,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:12,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:12,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2024-10-31 21:59:12,871 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-10-31 21:59:12,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:12,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2024-10-31 21:59:12,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:13,100 INFO L124 PetriNetUnfolderBase]: 26/544 cut-off events. [2024-10-31 21:59:13,100 INFO L125 PetriNetUnfolderBase]: For 16/18 co-relation queries the response was YES. [2024-10-31 21:59:13,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 544 events. 26/544 cut-off events. For 16/18 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-10-31 21:59:13,111 INFO L140 encePairwiseOnDemand]: 394/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2024-10-31 21:59:13,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 372 transitions, 788 flow [2024-10-31 21:59:13,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1160 transitions. [2024-10-31 21:59:13,135 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9594706368899917 [2024-10-31 21:59:13,141 INFO L175 Difference]: Start difference. First operand has 370 places, 379 transitions, 776 flow. Second operand 3 states and 1160 transitions. [2024-10-31 21:59:13,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 372 transitions, 788 flow [2024-10-31 21:59:13,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 372 transitions, 776 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-31 21:59:13,161 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 754 flow [2024-10-31 21:59:13,164 INFO L260 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-10-31 21:59:13,170 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -5 predicate places. [2024-10-31 21:59:13,171 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 754 flow [2024-10-31 21:59:13,172 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-10-31 21:59:13,173 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:13,173 INFO L204 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-10-31 21:59:13,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:59:13,174 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-10-31 21:59:13,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:13,176 INFO L85 PathProgramCache]: Analyzing trace with hash 904607753, now seen corresponding path program 1 times [2024-10-31 21:59:13,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:13,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633041118] [2024-10-31 21:59:13,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:13,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:13,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:13,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633041118] [2024-10-31 21:59:13,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633041118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:13,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:13,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:13,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75471140] [2024-10-31 21:59:13,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:13,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:13,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:13,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:13,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:13,291 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2024-10-31 21:59:13,293 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-10-31 21:59:13,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:13,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2024-10-31 21:59:13,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:13,514 INFO L124 PetriNetUnfolderBase]: 36/706 cut-off events. [2024-10-31 21:59:13,514 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-31 21:59:13,520 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-10-31 21:59:13,526 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2024-10-31 21:59:13,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 371 transitions, 778 flow [2024-10-31 21:59:13,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2024-10-31 21:59:13,530 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642 [2024-10-31 21:59:13,530 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 754 flow. Second operand 3 states and 1154 transitions. [2024-10-31 21:59:13,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 371 transitions, 778 flow [2024-10-31 21:59:13,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 371 transitions, 774 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:13,539 INFO L231 Difference]: Finished difference. Result has 364 places, 371 transitions, 752 flow [2024-10-31 21:59:13,539 INFO L260 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-10-31 21:59:13,541 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -6 predicate places. [2024-10-31 21:59:13,541 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 371 transitions, 752 flow [2024-10-31 21:59:13,542 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-10-31 21:59:13,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:13,542 INFO L204 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-10-31 21:59:13,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:59:13,543 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-10-31 21:59:13,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:13,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1815141124, now seen corresponding path program 1 times [2024-10-31 21:59:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:13,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033515170] [2024-10-31 21:59:13,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:13,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:13,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:13,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033515170] [2024-10-31 21:59:13,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033515170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:13,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:13,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:13,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100659942] [2024-10-31 21:59:13,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:13,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:13,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:13,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:13,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:13,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2024-10-31 21:59:13,665 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-10-31 21:59:13,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:13,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2024-10-31 21:59:13,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:13,793 INFO L124 PetriNetUnfolderBase]: 24/462 cut-off events. [2024-10-31 21:59:13,793 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-10-31 21:59:13,796 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-10-31 21:59:13,800 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2024-10-31 21:59:13,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 370 transitions, 776 flow [2024-10-31 21:59:13,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:13,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2024-10-31 21:59:13,804 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642 [2024-10-31 21:59:13,804 INFO L175 Difference]: Start difference. First operand has 364 places, 371 transitions, 752 flow. Second operand 3 states and 1154 transitions. [2024-10-31 21:59:13,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 370 transitions, 776 flow [2024-10-31 21:59:13,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 370 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:13,813 INFO L231 Difference]: Finished difference. Result has 363 places, 370 transitions, 750 flow [2024-10-31 21:59:13,814 INFO L260 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-10-31 21:59:13,814 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -7 predicate places. [2024-10-31 21:59:13,815 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 370 transitions, 750 flow [2024-10-31 21:59:13,816 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-10-31 21:59:13,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:13,816 INFO L204 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-10-31 21:59:13,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:59:13,817 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-10-31 21:59:13,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:13,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1551951284, now seen corresponding path program 1 times [2024-10-31 21:59:13,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:13,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975608912] [2024-10-31 21:59:13,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:13,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:13,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:13,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975608912] [2024-10-31 21:59:13,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975608912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:13,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:13,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:13,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385871648] [2024-10-31 21:59:13,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:13,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:13,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:13,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:13,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:13,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2024-10-31 21:59:13,946 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-10-31 21:59:13,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:13,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2024-10-31 21:59:13,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:14,093 INFO L124 PetriNetUnfolderBase]: 30/607 cut-off events. [2024-10-31 21:59:14,094 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-31 21:59:14,099 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-10-31 21:59:14,105 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2024-10-31 21:59:14,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 369 transitions, 774 flow [2024-10-31 21:59:14,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2024-10-31 21:59:14,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642 [2024-10-31 21:59:14,110 INFO L175 Difference]: Start difference. First operand has 363 places, 370 transitions, 750 flow. Second operand 3 states and 1154 transitions. [2024-10-31 21:59:14,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 369 transitions, 774 flow [2024-10-31 21:59:14,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 369 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:14,117 INFO L231 Difference]: Finished difference. Result has 362 places, 369 transitions, 748 flow [2024-10-31 21:59:14,118 INFO L260 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-10-31 21:59:14,120 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -8 predicate places. [2024-10-31 21:59:14,121 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 369 transitions, 748 flow [2024-10-31 21:59:14,122 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-10-31 21:59:14,122 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:14,122 INFO L204 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-10-31 21:59:14,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:59:14,124 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-10-31 21:59:14,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:14,126 INFO L85 PathProgramCache]: Analyzing trace with hash 599973764, now seen corresponding path program 1 times [2024-10-31 21:59:14,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:14,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522596402] [2024-10-31 21:59:14,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:14,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:14,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:14,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:14,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522596402] [2024-10-31 21:59:14,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522596402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:14,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:14,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:14,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824236130] [2024-10-31 21:59:14,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:14,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:14,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:14,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:14,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:14,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403 [2024-10-31 21:59:14,252 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-10-31 21:59:14,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:14,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403 [2024-10-31 21:59:14,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:14,446 INFO L124 PetriNetUnfolderBase]: 53/904 cut-off events. [2024-10-31 21:59:14,446 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-31 21:59:14,452 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-10-31 21:59:14,459 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 12 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2024-10-31 21:59:14,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 368 transitions, 774 flow [2024-10-31 21:59:14,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions. [2024-10-31 21:59:14,462 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9528535980148883 [2024-10-31 21:59:14,463 INFO L175 Difference]: Start difference. First operand has 362 places, 369 transitions, 748 flow. Second operand 3 states and 1152 transitions. [2024-10-31 21:59:14,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 368 transitions, 774 flow [2024-10-31 21:59:14,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 368 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:14,470 INFO L231 Difference]: Finished difference. Result has 361 places, 368 transitions, 746 flow [2024-10-31 21:59:14,471 INFO L260 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-10-31 21:59:14,474 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -9 predicate places. [2024-10-31 21:59:14,474 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 368 transitions, 746 flow [2024-10-31 21:59:14,476 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-10-31 21:59:14,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:14,476 INFO L204 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-10-31 21:59:14,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:59:14,477 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-10-31 21:59:14,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:14,478 INFO L85 PathProgramCache]: Analyzing trace with hash -17834254, now seen corresponding path program 1 times [2024-10-31 21:59:14,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:14,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16431355] [2024-10-31 21:59:14,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:14,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:14,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:14,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:14,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16431355] [2024-10-31 21:59:14,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16431355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:14,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:14,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:14,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872447346] [2024-10-31 21:59:14,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:14,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:14,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:14,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:14,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:14,620 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 403 [2024-10-31 21:59:14,621 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-10-31 21:59:14,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:14,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 403 [2024-10-31 21:59:14,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:14,824 INFO L124 PetriNetUnfolderBase]: 65/963 cut-off events. [2024-10-31 21:59:14,825 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-10-31 21:59:14,832 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-10-31 21:59:14,840 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 13 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2024-10-31 21:59:14,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 367 transitions, 774 flow [2024-10-31 21:59:14,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions. [2024-10-31 21:59:14,844 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9511993382961125 [2024-10-31 21:59:14,844 INFO L175 Difference]: Start difference. First operand has 361 places, 368 transitions, 746 flow. Second operand 3 states and 1150 transitions. [2024-10-31 21:59:14,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 367 transitions, 774 flow [2024-10-31 21:59:14,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 367 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:14,852 INFO L231 Difference]: Finished difference. Result has 360 places, 367 transitions, 744 flow [2024-10-31 21:59:14,853 INFO L260 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-10-31 21:59:14,854 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -10 predicate places. [2024-10-31 21:59:14,854 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 367 transitions, 744 flow [2024-10-31 21:59:14,855 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-10-31 21:59:14,856 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:14,856 INFO L204 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-10-31 21:59:14,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:59:14,856 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-10-31 21:59:14,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:14,857 INFO L85 PathProgramCache]: Analyzing trace with hash -81682211, now seen corresponding path program 1 times [2024-10-31 21:59:14,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:14,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301054193] [2024-10-31 21:59:14,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:14,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:14,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:14,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301054193] [2024-10-31 21:59:14,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301054193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:14,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:14,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:14,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865584868] [2024-10-31 21:59:14,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:14,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:14,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:14,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:14,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:14,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 403 [2024-10-31 21:59:14,951 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-10-31 21:59:14,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:14,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 403 [2024-10-31 21:59:14,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:15,083 INFO L124 PetriNetUnfolderBase]: 26/538 cut-off events. [2024-10-31 21:59:15,084 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-31 21:59:15,088 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-10-31 21:59:15,098 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/366 dead transitions. [2024-10-31 21:59:15,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 366 transitions, 768 flow [2024-10-31 21:59:15,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:15,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2024-10-31 21:59:15,103 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9545078577336642 [2024-10-31 21:59:15,103 INFO L175 Difference]: Start difference. First operand has 360 places, 367 transitions, 744 flow. Second operand 3 states and 1154 transitions. [2024-10-31 21:59:15,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 366 transitions, 768 flow [2024-10-31 21:59:15,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 366 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:15,111 INFO L231 Difference]: Finished difference. Result has 359 places, 366 transitions, 742 flow [2024-10-31 21:59:15,112 INFO L260 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-10-31 21:59:15,112 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -11 predicate places. [2024-10-31 21:59:15,113 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 366 transitions, 742 flow [2024-10-31 21:59:15,114 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-10-31 21:59:15,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:15,114 INFO L204 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-10-31 21:59:15,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:59:15,115 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-10-31 21:59:15,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:15,115 INFO L85 PathProgramCache]: Analyzing trace with hash -771227952, now seen corresponding path program 1 times [2024-10-31 21:59:15,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:15,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689019842] [2024-10-31 21:59:15,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:15,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:15,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:15,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689019842] [2024-10-31 21:59:15,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689019842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:15,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:15,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:15,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353892286] [2024-10-31 21:59:15,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:15,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:15,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:15,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:15,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:15,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403 [2024-10-31 21:59:15,254 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-10-31 21:59:15,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:15,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403 [2024-10-31 21:59:15,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:15,452 INFO L124 PetriNetUnfolderBase]: 53/951 cut-off events. [2024-10-31 21:59:15,452 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2024-10-31 21:59:15,459 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-10-31 21:59:15,466 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 12 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2024-10-31 21:59:15,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 365 transitions, 768 flow [2024-10-31 21:59:15,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:15,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:15,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions. [2024-10-31 21:59:15,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9528535980148883 [2024-10-31 21:59:15,470 INFO L175 Difference]: Start difference. First operand has 359 places, 366 transitions, 742 flow. Second operand 3 states and 1152 transitions. [2024-10-31 21:59:15,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 365 transitions, 768 flow [2024-10-31 21:59:15,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 365 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:15,478 INFO L231 Difference]: Finished difference. Result has 358 places, 365 transitions, 740 flow [2024-10-31 21:59:15,479 INFO L260 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-10-31 21:59:15,481 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -12 predicate places. [2024-10-31 21:59:15,482 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 365 transitions, 740 flow [2024-10-31 21:59:15,483 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-10-31 21:59:15,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:15,483 INFO L204 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-10-31 21:59:15,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:59:15,484 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-10-31 21:59:15,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:15,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1482047006, now seen corresponding path program 1 times [2024-10-31 21:59:15,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:15,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411801321] [2024-10-31 21:59:15,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:15,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:15,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:15,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411801321] [2024-10-31 21:59:15,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411801321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:15,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:15,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:15,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636203210] [2024-10-31 21:59:15,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:15,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:15,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:15,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:15,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:15,631 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 403 [2024-10-31 21:59:15,632 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-10-31 21:59:15,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:15,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 403 [2024-10-31 21:59:15,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:15,762 INFO L124 PetriNetUnfolderBase]: 41/556 cut-off events. [2024-10-31 21:59:15,762 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2024-10-31 21:59:15,767 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-10-31 21:59:15,771 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 13 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2024-10-31 21:59:15,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 364 transitions, 768 flow [2024-10-31 21:59:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:15,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1150 transitions. [2024-10-31 21:59:15,774 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9511993382961125 [2024-10-31 21:59:15,775 INFO L175 Difference]: Start difference. First operand has 358 places, 365 transitions, 740 flow. Second operand 3 states and 1150 transitions. [2024-10-31 21:59:15,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 364 transitions, 768 flow [2024-10-31 21:59:15,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 364 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:15,782 INFO L231 Difference]: Finished difference. Result has 357 places, 364 transitions, 738 flow [2024-10-31 21:59:15,783 INFO L260 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-10-31 21:59:15,783 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -13 predicate places. [2024-10-31 21:59:15,784 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 364 transitions, 738 flow [2024-10-31 21:59:15,785 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-10-31 21:59:15,785 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:15,785 INFO L204 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-10-31 21:59:15,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:59:15,786 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-10-31 21:59:15,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:15,786 INFO L85 PathProgramCache]: Analyzing trace with hash -638811393, now seen corresponding path program 1 times [2024-10-31 21:59:15,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:15,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669500290] [2024-10-31 21:59:15,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:15,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:15,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:15,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669500290] [2024-10-31 21:59:15,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669500290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:15,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:15,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:15,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926756915] [2024-10-31 21:59:15,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:15,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:15,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:15,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:15,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:15,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2024-10-31 21:59:15,868 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-10-31 21:59:15,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:15,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2024-10-31 21:59:15,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:16,075 INFO L124 PetriNetUnfolderBase]: 53/916 cut-off events. [2024-10-31 21:59:16,076 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 21:59:16,082 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-10-31 21:59:16,089 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 13 selfloop transitions, 2 changer transitions 0/366 dead transitions. [2024-10-31 21:59:16,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 366 transitions, 774 flow [2024-10-31 21:59:16,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:16,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2024-10-31 21:59:16,094 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555 [2024-10-31 21:59:16,094 INFO L175 Difference]: Start difference. First operand has 357 places, 364 transitions, 738 flow. Second operand 3 states and 1163 transitions. [2024-10-31 21:59:16,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 366 transitions, 774 flow [2024-10-31 21:59:16,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 366 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:16,102 INFO L231 Difference]: Finished difference. Result has 356 places, 364 transitions, 744 flow [2024-10-31 21:59:16,103 INFO L260 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-10-31 21:59:16,104 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2024-10-31 21:59:16,105 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 364 transitions, 744 flow [2024-10-31 21:59:16,106 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-10-31 21:59:16,106 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:16,106 INFO L204 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-10-31 21:59:16,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 21:59:16,107 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-10-31 21:59:16,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:16,111 INFO L85 PathProgramCache]: Analyzing trace with hash 170798306, now seen corresponding path program 1 times [2024-10-31 21:59:16,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:16,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127952829] [2024-10-31 21:59:16,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:16,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:16,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:16,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127952829] [2024-10-31 21:59:16,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127952829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:16,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:16,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:16,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800829118] [2024-10-31 21:59:16,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:16,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:16,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:16,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:16,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:16,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403 [2024-10-31 21:59:16,225 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-10-31 21:59:16,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:16,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403 [2024-10-31 21:59:16,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:16,548 INFO L124 PetriNetUnfolderBase]: 119/1686 cut-off events. [2024-10-31 21:59:16,549 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 21:59:16,558 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-10-31 21:59:16,570 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 15 selfloop transitions, 3 changer transitions 0/366 dead transitions. [2024-10-31 21:59:16,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 366 transitions, 786 flow [2024-10-31 21:59:16,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1158 transitions. [2024-10-31 21:59:16,577 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9578163771712159 [2024-10-31 21:59:16,577 INFO L175 Difference]: Start difference. First operand has 356 places, 364 transitions, 744 flow. Second operand 3 states and 1158 transitions. [2024-10-31 21:59:16,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 366 transitions, 786 flow [2024-10-31 21:59:16,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 366 transitions, 786 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:59:16,588 INFO L231 Difference]: Finished difference. Result has 356 places, 364 transitions, 759 flow [2024-10-31 21:59:16,589 INFO L260 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-10-31 21:59:16,590 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2024-10-31 21:59:16,590 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 364 transitions, 759 flow [2024-10-31 21:59:16,591 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-10-31 21:59:16,592 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:16,592 INFO L204 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-10-31 21:59:16,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 21:59:16,592 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-10-31 21:59:16,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:16,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1282984152, now seen corresponding path program 1 times [2024-10-31 21:59:16,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:16,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091496872] [2024-10-31 21:59:16,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:16,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:16,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:16,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091496872] [2024-10-31 21:59:16,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091496872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:16,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:16,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:16,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807879700] [2024-10-31 21:59:16,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:16,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:16,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:16,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:16,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:16,679 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2024-10-31 21:59:16,681 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-10-31 21:59:16,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:16,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2024-10-31 21:59:16,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:16,940 INFO L124 PetriNetUnfolderBase]: 57/1088 cut-off events. [2024-10-31 21:59:16,940 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-10-31 21:59:16,951 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-10-31 21:59:16,959 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 16 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2024-10-31 21:59:16,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 369 transitions, 810 flow [2024-10-31 21:59:16,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2024-10-31 21:59:16,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9644334160463193 [2024-10-31 21:59:16,962 INFO L175 Difference]: Start difference. First operand has 356 places, 364 transitions, 759 flow. Second operand 3 states and 1166 transitions. [2024-10-31 21:59:16,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 369 transitions, 810 flow [2024-10-31 21:59:16,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 369 transitions, 810 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:59:16,969 INFO L231 Difference]: Finished difference. Result has 357 places, 364 transitions, 769 flow [2024-10-31 21:59:16,970 INFO L260 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-10-31 21:59:16,970 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -13 predicate places. [2024-10-31 21:59:16,971 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 364 transitions, 769 flow [2024-10-31 21:59:16,972 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-10-31 21:59:16,972 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:16,972 INFO L204 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-10-31 21:59:16,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 21:59:16,972 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-10-31 21:59:16,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:16,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1313359499, now seen corresponding path program 1 times [2024-10-31 21:59:16,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:16,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302719641] [2024-10-31 21:59:16,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:16,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:17,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:17,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302719641] [2024-10-31 21:59:17,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302719641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:17,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:17,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:17,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706449445] [2024-10-31 21:59:17,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:17,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:17,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:17,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:17,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:17,036 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 403 [2024-10-31 21:59:17,037 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-10-31 21:59:17,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:17,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 403 [2024-10-31 21:59:17,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:17,276 INFO L124 PetriNetUnfolderBase]: 59/1040 cut-off events. [2024-10-31 21:59:17,276 INFO L125 PetriNetUnfolderBase]: For 4/20 co-relation queries the response was YES. [2024-10-31 21:59:17,290 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-10-31 21:59:17,298 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2024-10-31 21:59:17,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 365 transitions, 799 flow [2024-10-31 21:59:17,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2024-10-31 21:59:17,304 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555 [2024-10-31 21:59:17,305 INFO L175 Difference]: Start difference. First operand has 357 places, 364 transitions, 769 flow. Second operand 3 states and 1163 transitions. [2024-10-31 21:59:17,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 365 transitions, 799 flow [2024-10-31 21:59:17,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 365 transitions, 799 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:59:17,312 INFO L231 Difference]: Finished difference. Result has 358 places, 363 transitions, 771 flow [2024-10-31 21:59:17,312 INFO L260 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-10-31 21:59:17,313 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -12 predicate places. [2024-10-31 21:59:17,313 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 363 transitions, 771 flow [2024-10-31 21:59:17,314 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-10-31 21:59:17,314 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:17,314 INFO L204 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-10-31 21:59:17,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 21:59:17,315 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-10-31 21:59:17,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:17,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2071790774, now seen corresponding path program 1 times [2024-10-31 21:59:17,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:17,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674155398] [2024-10-31 21:59:17,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:17,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:17,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-10-31 21:59:17,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:17,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674155398] [2024-10-31 21:59:17,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674155398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:17,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:17,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:17,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125116348] [2024-10-31 21:59:17,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:17,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:17,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:17,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:17,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:17,401 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 403 [2024-10-31 21:59:17,403 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-10-31 21:59:17,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:17,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 403 [2024-10-31 21:59:17,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:18,049 INFO L124 PetriNetUnfolderBase]: 341/3866 cut-off events. [2024-10-31 21:59:18,050 INFO L125 PetriNetUnfolderBase]: For 62/74 co-relation queries the response was YES. [2024-10-31 21:59:18,070 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-10-31 21:59:18,085 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 17 selfloop transitions, 4 changer transitions 0/365 dead transitions. [2024-10-31 21:59:18,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 365 transitions, 819 flow [2024-10-31 21:59:18,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:18,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1153 transitions. [2024-10-31 21:59:18,088 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9536807278742763 [2024-10-31 21:59:18,088 INFO L175 Difference]: Start difference. First operand has 358 places, 363 transitions, 771 flow. Second operand 3 states and 1153 transitions. [2024-10-31 21:59:18,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 365 transitions, 819 flow [2024-10-31 21:59:18,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 365 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:18,096 INFO L231 Difference]: Finished difference. Result has 355 places, 363 transitions, 787 flow [2024-10-31 21:59:18,096 INFO L260 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-10-31 21:59:18,098 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places. [2024-10-31 21:59:18,098 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 363 transitions, 787 flow [2024-10-31 21:59:18,099 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-10-31 21:59:18,099 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:18,099 INFO L204 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-10-31 21:59:18,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 21:59:18,100 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-10-31 21:59:18,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:18,101 INFO L85 PathProgramCache]: Analyzing trace with hash -465967603, now seen corresponding path program 1 times [2024-10-31 21:59:18,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:18,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132564894] [2024-10-31 21:59:18,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:18,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:18,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:18,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132564894] [2024-10-31 21:59:18,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132564894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:18,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:18,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:18,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771516204] [2024-10-31 21:59:18,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:18,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:18,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:18,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:18,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:18,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 403 [2024-10-31 21:59:18,180 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-10-31 21:59:18,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:18,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 403 [2024-10-31 21:59:18,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:18,880 INFO L124 PetriNetUnfolderBase]: 151/2564 cut-off events. [2024-10-31 21:59:18,880 INFO L125 PetriNetUnfolderBase]: For 8/11 co-relation queries the response was YES. [2024-10-31 21:59:18,914 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-10-31 21:59:18,931 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 18 selfloop transitions, 3 changer transitions 0/368 dead transitions. [2024-10-31 21:59:18,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 368 transitions, 844 flow [2024-10-31 21:59:18,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1161 transitions. [2024-10-31 21:59:18,935 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9602977667493796 [2024-10-31 21:59:18,935 INFO L175 Difference]: Start difference. First operand has 355 places, 363 transitions, 787 flow. Second operand 3 states and 1161 transitions. [2024-10-31 21:59:18,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 368 transitions, 844 flow [2024-10-31 21:59:18,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 368 transitions, 844 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:59:18,943 INFO L231 Difference]: Finished difference. Result has 355 places, 363 transitions, 802 flow [2024-10-31 21:59:18,944 INFO L260 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-10-31 21:59:18,944 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places. [2024-10-31 21:59:18,945 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 363 transitions, 802 flow [2024-10-31 21:59:18,945 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-10-31 21:59:18,946 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:18,946 INFO L204 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-10-31 21:59:18,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 21:59:18,946 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-10-31 21:59:18,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:18,947 INFO L85 PathProgramCache]: Analyzing trace with hash -305609868, now seen corresponding path program 1 times [2024-10-31 21:59:18,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:18,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677790789] [2024-10-31 21:59:18,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:18,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,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-10-31 21:59:19,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:19,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677790789] [2024-10-31 21:59:19,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677790789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:19,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:19,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:19,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893533754] [2024-10-31 21:59:19,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:19,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:19,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:19,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:19,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:19,021 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2024-10-31 21:59:19,022 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-10-31 21:59:19,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:19,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2024-10-31 21:59:19,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:19,588 INFO L124 PetriNetUnfolderBase]: 121/2849 cut-off events. [2024-10-31 21:59:19,588 INFO L125 PetriNetUnfolderBase]: For 33/45 co-relation queries the response was YES. [2024-10-31 21:59:19,617 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-10-31 21:59:19,630 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 16 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2024-10-31 21:59:19,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 368 transitions, 853 flow [2024-10-31 21:59:19,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:19,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2024-10-31 21:59:19,633 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9644334160463193 [2024-10-31 21:59:19,634 INFO L175 Difference]: Start difference. First operand has 355 places, 363 transitions, 802 flow. Second operand 3 states and 1166 transitions. [2024-10-31 21:59:19,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 368 transitions, 853 flow [2024-10-31 21:59:19,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 368 transitions, 853 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:59:19,640 INFO L231 Difference]: Finished difference. Result has 356 places, 363 transitions, 812 flow [2024-10-31 21:59:19,640 INFO L260 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-10-31 21:59:19,641 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2024-10-31 21:59:19,641 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 363 transitions, 812 flow [2024-10-31 21:59:19,642 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-10-31 21:59:19,642 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:19,642 INFO L204 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-10-31 21:59:19,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 21:59:19,643 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-10-31 21:59:19,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1690903923, now seen corresponding path program 1 times [2024-10-31 21:59:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:19,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475131202] [2024-10-31 21:59:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:19,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:19,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475131202] [2024-10-31 21:59:19,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475131202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:19,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:19,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:19,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856242743] [2024-10-31 21:59:19,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:19,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:19,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:19,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:19,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:19,712 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 403 [2024-10-31 21:59:19,713 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-10-31 21:59:19,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:19,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 403 [2024-10-31 21:59:19,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:20,400 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-10-31 21:59:20,400 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2024-10-31 21:59:20,400 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-10-31 21:59:20,400 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-10-31 21:59:20,400 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-10-31 21:59:20,403 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-10-31 21:59:20,404 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is not cut-off event [2024-10-31 21:59:20,404 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event [2024-10-31 21:59:20,404 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event [2024-10-31 21:59:20,404 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-31 21:59:20,404 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event [2024-10-31 21:59:20,409 INFO L124 PetriNetUnfolderBase]: 166/3483 cut-off events. [2024-10-31 21:59:20,409 INFO L125 PetriNetUnfolderBase]: For 35/124 co-relation queries the response was YES. [2024-10-31 21:59:20,469 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-10-31 21:59:20,602 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2024-10-31 21:59:20,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 364 transitions, 842 flow [2024-10-31 21:59:20,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2024-10-31 21:59:20,608 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555 [2024-10-31 21:59:20,609 INFO L175 Difference]: Start difference. First operand has 356 places, 363 transitions, 812 flow. Second operand 3 states and 1163 transitions. [2024-10-31 21:59:20,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 364 transitions, 842 flow [2024-10-31 21:59:20,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 364 transitions, 842 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:59:20,617 INFO L231 Difference]: Finished difference. Result has 357 places, 362 transitions, 814 flow [2024-10-31 21:59:20,618 INFO L260 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-10-31 21:59:20,619 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -13 predicate places. [2024-10-31 21:59:20,619 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 362 transitions, 814 flow [2024-10-31 21:59:20,620 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-10-31 21:59:20,620 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:20,620 INFO L204 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-10-31 21:59:20,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 21:59:20,621 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-10-31 21:59:20,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:20,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1633276073, now seen corresponding path program 1 times [2024-10-31 21:59:20,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:20,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173699088] [2024-10-31 21:59:20,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:20,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:20,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:20,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173699088] [2024-10-31 21:59:20,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173699088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:20,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:20,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:20,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156100764] [2024-10-31 21:59:20,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:20,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:20,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:20,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:20,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:20,703 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2024-10-31 21:59:20,706 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-10-31 21:59:20,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:20,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2024-10-31 21:59:20,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:21,491 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-10-31 21:59:21,492 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event [2024-10-31 21:59:21,492 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-10-31 21:59:21,492 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2024-10-31 21:59:21,492 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2024-10-31 21:59:21,497 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-10-31 21:59:21,498 INFO L294 olderBase$Statistics]: this new event has 209 ancestors and is not cut-off event [2024-10-31 21:59:21,498 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is not cut-off event [2024-10-31 21:59:21,498 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-31 21:59:21,498 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-31 21:59:21,498 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-10-31 21:59:21,519 INFO L124 PetriNetUnfolderBase]: 113/2930 cut-off events. [2024-10-31 21:59:21,519 INFO L125 PetriNetUnfolderBase]: For 17/35 co-relation queries the response was YES. [2024-10-31 21:59:21,548 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-10-31 21:59:21,562 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 16 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2024-10-31 21:59:21,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 865 flow [2024-10-31 21:59:21,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1166 transitions. [2024-10-31 21:59:21,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9644334160463193 [2024-10-31 21:59:21,567 INFO L175 Difference]: Start difference. First operand has 357 places, 362 transitions, 814 flow. Second operand 3 states and 1166 transitions. [2024-10-31 21:59:21,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 865 flow [2024-10-31 21:59:21,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 367 transitions, 861 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:21,577 INFO L231 Difference]: Finished difference. Result has 356 places, 362 transitions, 820 flow [2024-10-31 21:59:21,578 INFO L260 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-10-31 21:59:21,578 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2024-10-31 21:59:21,579 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 362 transitions, 820 flow [2024-10-31 21:59:21,579 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-10-31 21:59:21,580 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:21,580 INFO L204 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-10-31 21:59:21,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 21:59:21,580 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-10-31 21:59:21,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:21,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1646992267, now seen corresponding path program 1 times [2024-10-31 21:59:21,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:21,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226850034] [2024-10-31 21:59:21,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:21,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:21,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:21,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226850034] [2024-10-31 21:59:21,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226850034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:21,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:21,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:21,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521389254] [2024-10-31 21:59:21,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:21,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:21,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:21,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:21,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:21,677 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 403 [2024-10-31 21:59:21,679 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-10-31 21:59:21,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:21,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 403 [2024-10-31 21:59:21,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:23,261 INFO L124 PetriNetUnfolderBase]: 473/7671 cut-off events. [2024-10-31 21:59:23,261 INFO L125 PetriNetUnfolderBase]: For 134/144 co-relation queries the response was YES. [2024-10-31 21:59:23,308 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-10-31 21:59:23,331 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 19 selfloop transitions, 4 changer transitions 0/366 dead transitions. [2024-10-31 21:59:23,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 366 transitions, 878 flow [2024-10-31 21:59:23,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1155 transitions. [2024-10-31 21:59:23,335 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9553349875930521 [2024-10-31 21:59:23,335 INFO L175 Difference]: Start difference. First operand has 356 places, 362 transitions, 820 flow. Second operand 3 states and 1155 transitions. [2024-10-31 21:59:23,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 366 transitions, 878 flow [2024-10-31 21:59:23,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 366 transitions, 878 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:59:23,342 INFO L231 Difference]: Finished difference. Result has 355 places, 362 transitions, 840 flow [2024-10-31 21:59:23,342 INFO L260 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-10-31 21:59:23,343 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places. [2024-10-31 21:59:23,343 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 362 transitions, 840 flow [2024-10-31 21:59:23,344 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-10-31 21:59:23,344 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:23,344 INFO L204 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-10-31 21:59:23,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 21:59:23,344 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-10-31 21:59:23,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:23,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1862235787, now seen corresponding path program 1 times [2024-10-31 21:59:23,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:23,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228409070] [2024-10-31 21:59:23,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:23,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:23,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:23,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228409070] [2024-10-31 21:59:23,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228409070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:23,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:23,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:23,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723540847] [2024-10-31 21:59:23,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:23,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:23,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:23,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:23,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:23,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 403 [2024-10-31 21:59:23,408 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-10-31 21:59:23,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:23,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 403 [2024-10-31 21:59:23,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:24,160 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-10-31 21:59:24,160 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2024-10-31 21:59:24,161 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-10-31 21:59:24,161 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-10-31 21:59:24,161 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-10-31 21:59:24,244 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-10-31 21:59:24,245 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2024-10-31 21:59:24,245 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 21:59:24,245 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 21:59:24,245 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 21:59:24,246 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-10-31 21:59:24,246 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-10-31 21:59:24,246 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 21:59:24,246 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 21:59:24,246 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 21:59:24,246 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-31 21:59:24,247 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-10-31 21:59:24,247 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-10-31 21:59:24,247 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 21:59:24,247 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 21:59:24,247 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 21:59:24,248 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-10-31 21:59:24,248 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2024-10-31 21:59:24,248 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 21:59:24,248 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-31 21:59:24,248 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 21:59:24,248 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 21:59:24,248 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-10-31 21:59:24,248 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2024-10-31 21:59:24,248 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 21:59:24,249 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-31 21:59:24,249 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 21:59:24,249 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 21:59:24,249 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 21:59:24,250 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-10-31 21:59:24,251 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2024-10-31 21:59:24,251 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 21:59:24,251 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-31 21:59:24,251 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 21:59:24,251 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-31 21:59:24,251 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 21:59:24,251 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 21:59:24,254 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-10-31 21:59:24,254 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-10-31 21:59:24,254 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:24,254 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-31 21:59:24,255 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:24,255 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-10-31 21:59:24,255 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2024-10-31 21:59:24,255 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:24,256 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-31 21:59:24,256 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:24,256 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 21:59:24,259 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-10-31 21:59:24,259 INFO L294 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event [2024-10-31 21:59:24,260 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-10-31 21:59:24,260 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-31 21:59:24,260 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-31 21:59:24,260 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-10-31 21:59:24,261 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2024-10-31 21:59:24,261 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-10-31 21:59:24,261 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-31 21:59:24,261 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2024-10-31 21:59:24,261 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-31 21:59:24,270 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-10-31 21:59:24,270 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2024-10-31 21:59:24,270 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-31 21:59:24,270 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-31 21:59:24,270 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-31 21:59:24,271 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-10-31 21:59:24,271 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2024-10-31 21:59:24,271 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-31 21:59:24,271 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-31 21:59:24,272 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-10-31 21:59:24,272 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-31 21:59:24,273 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-10-31 21:59:24,273 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is not cut-off event [2024-10-31 21:59:24,273 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2024-10-31 21:59:24,273 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2024-10-31 21:59:24,274 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2024-10-31 21:59:24,274 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2024-10-31 21:59:24,274 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2024-10-31 21:59:24,274 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-10-31 21:59:24,274 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2024-10-31 21:59:24,274 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2024-10-31 21:59:24,275 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:24,275 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-31 21:59:24,275 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:24,275 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 21:59:24,277 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-10-31 21:59:24,277 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2024-10-31 21:59:24,277 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-10-31 21:59:24,277 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-31 21:59:24,278 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2024-10-31 21:59:24,278 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-31 21:59:24,278 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-10-31 21:59:24,286 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-10-31 21:59:24,286 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is not cut-off event [2024-10-31 21:59:24,286 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2024-10-31 21:59:24,286 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2024-10-31 21:59:24,286 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2024-10-31 21:59:24,286 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is not cut-off event [2024-10-31 21:59:24,287 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2024-10-31 21:59:24,297 INFO L124 PetriNetUnfolderBase]: 375/3955 cut-off events. [2024-10-31 21:59:24,297 INFO L125 PetriNetUnfolderBase]: For 240/323 co-relation queries the response was YES. [2024-10-31 21:59:24,327 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-10-31 21:59:24,339 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 11 selfloop transitions, 2 changer transitions 0/363 dead transitions. [2024-10-31 21:59:24,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 363 transitions, 870 flow [2024-10-31 21:59:24,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1163 transitions. [2024-10-31 21:59:24,345 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9619520264681555 [2024-10-31 21:59:24,345 INFO L175 Difference]: Start difference. First operand has 355 places, 362 transitions, 840 flow. Second operand 3 states and 1163 transitions. [2024-10-31 21:59:24,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 363 transitions, 870 flow [2024-10-31 21:59:24,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 363 transitions, 870 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:59:24,352 INFO L231 Difference]: Finished difference. Result has 356 places, 361 transitions, 842 flow [2024-10-31 21:59:24,353 INFO L260 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-10-31 21:59:24,353 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2024-10-31 21:59:24,354 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 361 transitions, 842 flow [2024-10-31 21:59:24,354 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-10-31 21:59:24,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:24,355 INFO L204 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-10-31 21:59:24,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 21:59:24,355 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-10-31 21:59:24,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash -96543169, now seen corresponding path program 1 times [2024-10-31 21:59:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:24,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381710222] [2024-10-31 21:59:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:24,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:24,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:24,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381710222] [2024-10-31 21:59:24,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381710222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:24,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:24,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361848840] [2024-10-31 21:59:24,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:24,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:24,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:24,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:24,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:24,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 403 [2024-10-31 21:59:24,427 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-10-31 21:59:24,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:24,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 403 [2024-10-31 21:59:24,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:25,326 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-10-31 21:59:25,326 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is not cut-off event [2024-10-31 21:59:25,326 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2024-10-31 21:59:25,326 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event [2024-10-31 21:59:25,326 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2024-10-31 21:59:25,412 INFO L124 PetriNetUnfolderBase]: 252/5660 cut-off events. [2024-10-31 21:59:25,412 INFO L125 PetriNetUnfolderBase]: For 71/83 co-relation queries the response was YES. [2024-10-31 21:59:25,440 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-10-31 21:59:25,454 INFO L140 encePairwiseOnDemand]: 399/403 looper letters, 15 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2024-10-31 21:59:25,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 365 transitions, 888 flow [2024-10-31 21:59:25,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:25,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-31 21:59:25,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9636062861869313 [2024-10-31 21:59:25,458 INFO L175 Difference]: Start difference. First operand has 356 places, 361 transitions, 842 flow. Second operand 3 states and 1165 transitions. [2024-10-31 21:59:25,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 365 transitions, 888 flow [2024-10-31 21:59:25,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 365 transitions, 884 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:59:25,472 INFO L231 Difference]: Finished difference. Result has 355 places, 361 transitions, 848 flow [2024-10-31 21:59:25,473 INFO L260 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-10-31 21:59:25,473 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -15 predicate places. [2024-10-31 21:59:25,473 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 361 transitions, 848 flow [2024-10-31 21:59:25,474 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-10-31 21:59:25,474 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:25,474 INFO L204 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-10-31 21:59:25,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-31 21:59:25,475 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-10-31 21:59:25,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2086252291, now seen corresponding path program 1 times [2024-10-31 21:59:25,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:25,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087663268] [2024-10-31 21:59:25,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:25,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:25,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:25,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087663268] [2024-10-31 21:59:25,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087663268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:25,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:25,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:25,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181082617] [2024-10-31 21:59:25,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:25,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:25,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:25,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:25,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:25,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 403 [2024-10-31 21:59:25,557 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-10-31 21:59:25,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:25,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 403 [2024-10-31 21:59:25,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:26,394 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-10-31 21:59:26,394 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2024-10-31 21:59:26,394 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-31 21:59:26,394 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-31 21:59:26,394 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2024-10-31 21:59:26,395 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-10-31 21:59:26,395 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2024-10-31 21:59:26,395 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-10-31 21:59:26,395 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-31 21:59:26,395 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-10-31 21:59:26,395 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-31 21:59:26,397 INFO L124 PetriNetUnfolderBase]: 201/5128 cut-off events. [2024-10-31 21:59:26,398 INFO L125 PetriNetUnfolderBase]: For 21/57 co-relation queries the response was YES. [2024-10-31 21:59:26,422 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-10-31 21:59:26,435 INFO L140 encePairwiseOnDemand]: 401/403 looper letters, 8 selfloop transitions, 1 changer transitions 0/360 dead transitions. [2024-10-31 21:59:26,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 360 transitions, 864 flow [2024-10-31 21:59:26,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-31 21:59:26,440 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9636062861869313 [2024-10-31 21:59:26,440 INFO L175 Difference]: Start difference. First operand has 355 places, 361 transitions, 848 flow. Second operand 3 states and 1165 transitions. [2024-10-31 21:59:26,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 360 transitions, 864 flow [2024-10-31 21:59:26,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 360 transitions, 864 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:59:26,450 INFO L231 Difference]: Finished difference. Result has 356 places, 360 transitions, 848 flow [2024-10-31 21:59:26,451 INFO L260 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-10-31 21:59:26,451 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2024-10-31 21:59:26,452 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 360 transitions, 848 flow [2024-10-31 21:59:26,452 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-10-31 21:59:26,453 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:26,453 INFO L204 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-10-31 21:59:26,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-31 21:59:26,453 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-10-31 21:59:26,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1728951746, now seen corresponding path program 1 times [2024-10-31 21:59:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:26,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651964034] [2024-10-31 21:59:26,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:26,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:26,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651964034] [2024-10-31 21:59:26,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651964034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:26,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:26,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:26,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499992746] [2024-10-31 21:59:26,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:26,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:26,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:26,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:26,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:26,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 403 [2024-10-31 21:59:26,553 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-10-31 21:59:26,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:26,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 403 [2024-10-31 21:59:26,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:27,647 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-10-31 21:59:27,647 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2024-10-31 21:59:27,647 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-10-31 21:59:27,647 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-31 21:59:27,648 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-31 21:59:27,650 INFO L124 PetriNetUnfolderBase]: 199/5606 cut-off events. [2024-10-31 21:59:27,650 INFO L125 PetriNetUnfolderBase]: For 22/66 co-relation queries the response was YES. [2024-10-31 21:59:27,683 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-10-31 21:59:27,695 INFO L140 encePairwiseOnDemand]: 401/403 looper letters, 8 selfloop transitions, 1 changer transitions 0/359 dead transitions. [2024-10-31 21:59:27,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 359 transitions, 864 flow [2024-10-31 21:59:27,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:27,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1165 transitions. [2024-10-31 21:59:27,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9636062861869313 [2024-10-31 21:59:27,700 INFO L175 Difference]: Start difference. First operand has 356 places, 360 transitions, 848 flow. Second operand 3 states and 1165 transitions. [2024-10-31 21:59:27,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 359 transitions, 864 flow [2024-10-31 21:59:27,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 359 transitions, 863 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:59:27,710 INFO L231 Difference]: Finished difference. Result has 356 places, 359 transitions, 847 flow [2024-10-31 21:59:27,711 INFO L260 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-10-31 21:59:27,711 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2024-10-31 21:59:27,711 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 359 transitions, 847 flow [2024-10-31 21:59:27,712 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-10-31 21:59:27,712 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:59:27,713 INFO L204 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-10-31 21:59:27,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-31 21:59:27,713 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-10-31 21:59:27,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:27,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1857811918, now seen corresponding path program 1 times [2024-10-31 21:59:27,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:27,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329063903] [2024-10-31 21:59:27,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:27,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:59:27,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:27,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329063903] [2024-10-31 21:59:27,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329063903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:27,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:27,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:27,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320988219] [2024-10-31 21:59:27,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:27,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:59:27,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:27,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:59:27,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:59:27,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 403 [2024-10-31 21:59:27,803 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-10-31 21:59:27,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:59:27,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 403 [2024-10-31 21:59:27,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:59:28,672 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-10-31 21:59:28,672 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2024-10-31 21:59:28,672 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2024-10-31 21:59:28,672 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2024-10-31 21:59:28,673 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2024-10-31 21:59:28,789 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-10-31 21:59:28,790 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-10-31 21:59:28,790 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:28,790 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:28,790 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 21:59:28,831 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-10-31 21:59:28,832 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-10-31 21:59:28,832 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:28,832 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:28,832 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 21:59:28,833 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 21:59:28,833 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-10-31 21:59:28,833 INFO L294 olderBase$Statistics]: this new event has 271 ancestors and is cut-off event [2024-10-31 21:59:28,833 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:28,833 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:28,834 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 21:59:28,834 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 21:59:28,834 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 21:59:28,834 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-10-31 21:59:28,834 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2024-10-31 21:59:28,835 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:28,835 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 21:59:28,835 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:28,837 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-10-31 21:59:28,838 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-10-31 21:59:28,838 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:28,838 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 21:59:28,838 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:28,838 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 21:59:28,840 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-10-31 21:59:28,840 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is not cut-off event [2024-10-31 21:59:28,841 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2024-10-31 21:59:28,841 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2024-10-31 21:59:28,841 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2024-10-31 21:59:28,841 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2024-10-31 21:59:28,841 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is not cut-off event [2024-10-31 21:59:28,841 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2024-10-31 21:59:28,847 INFO L124 PetriNetUnfolderBase]: 199/3881 cut-off events. [2024-10-31 21:59:28,848 INFO L125 PetriNetUnfolderBase]: For 64/102 co-relation queries the response was YES. [2024-10-31 21:59:28,895 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-10-31 21:59:28,896 INFO L140 encePairwiseOnDemand]: 401/403 looper letters, 0 selfloop transitions, 0 changer transitions 358/358 dead transitions. [2024-10-31 21:59:28,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 861 flow [2024-10-31 21:59:28,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:59:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:59:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1164 transitions. [2024-10-31 21:59:28,900 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627791563275434 [2024-10-31 21:59:28,900 INFO L175 Difference]: Start difference. First operand has 356 places, 359 transitions, 847 flow. Second operand 3 states and 1164 transitions. [2024-10-31 21:59:28,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 861 flow [2024-10-31 21:59:28,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 358 transitions, 860 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:59:28,906 INFO L231 Difference]: Finished difference. Result has 356 places, 0 transitions, 0 flow [2024-10-31 21:59:28,907 INFO L260 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-10-31 21:59:28,908 INFO L277 CegarLoopForPetriNet]: 370 programPoint places, -14 predicate places. [2024-10-31 21:59:28,908 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 0 transitions, 0 flow [2024-10-31 21:59:28,909 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-10-31 21:59:28,911 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (68 of 69 remaining) [2024-10-31 21:59:28,912 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (67 of 69 remaining) [2024-10-31 21:59:28,912 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (66 of 69 remaining) [2024-10-31 21:59:28,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (65 of 69 remaining) [2024-10-31 21:59:28,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (64 of 69 remaining) [2024-10-31 21:59:28,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (63 of 69 remaining) [2024-10-31 21:59:28,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (62 of 69 remaining) [2024-10-31 21:59:28,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (61 of 69 remaining) [2024-10-31 21:59:28,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (60 of 69 remaining) [2024-10-31 21:59:28,913 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (59 of 69 remaining) [2024-10-31 21:59:28,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (58 of 69 remaining) [2024-10-31 21:59:28,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (57 of 69 remaining) [2024-10-31 21:59:28,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 69 remaining) [2024-10-31 21:59:28,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (55 of 69 remaining) [2024-10-31 21:59:28,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (54 of 69 remaining) [2024-10-31 21:59:28,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (53 of 69 remaining) [2024-10-31 21:59:28,914 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (52 of 69 remaining) [2024-10-31 21:59:28,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (51 of 69 remaining) [2024-10-31 21:59:28,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (50 of 69 remaining) [2024-10-31 21:59:28,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (49 of 69 remaining) [2024-10-31 21:59:28,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (48 of 69 remaining) [2024-10-31 21:59:28,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (47 of 69 remaining) [2024-10-31 21:59:28,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (46 of 69 remaining) [2024-10-31 21:59:28,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (45 of 69 remaining) [2024-10-31 21:59:28,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (44 of 69 remaining) [2024-10-31 21:59:28,915 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (43 of 69 remaining) [2024-10-31 21:59:28,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (42 of 69 remaining) [2024-10-31 21:59:28,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 69 remaining) [2024-10-31 21:59:28,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 69 remaining) [2024-10-31 21:59:28,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (39 of 69 remaining) [2024-10-31 21:59:28,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 69 remaining) [2024-10-31 21:59:28,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 69 remaining) [2024-10-31 21:59:28,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (36 of 69 remaining) [2024-10-31 21:59:28,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (35 of 69 remaining) [2024-10-31 21:59:28,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 69 remaining) [2024-10-31 21:59:28,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 69 remaining) [2024-10-31 21:59:28,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (32 of 69 remaining) [2024-10-31 21:59:28,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 69 remaining) [2024-10-31 21:59:28,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (30 of 69 remaining) [2024-10-31 21:59:28,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 69 remaining) [2024-10-31 21:59:28,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 69 remaining) [2024-10-31 21:59:28,918 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 69 remaining) [2024-10-31 21:59:28,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 69 remaining) [2024-10-31 21:59:28,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 69 remaining) [2024-10-31 21:59:28,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 69 remaining) [2024-10-31 21:59:28,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 69 remaining) [2024-10-31 21:59:28,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 69 remaining) [2024-10-31 21:59:28,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (21 of 69 remaining) [2024-10-31 21:59:28,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 69 remaining) [2024-10-31 21:59:28,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 69 remaining) [2024-10-31 21:59:28,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 69 remaining) [2024-10-31 21:59:28,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 69 remaining) [2024-10-31 21:59:28,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 69 remaining) [2024-10-31 21:59:28,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 69 remaining) [2024-10-31 21:59:28,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 69 remaining) [2024-10-31 21:59:28,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 69 remaining) [2024-10-31 21:59:28,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 69 remaining) [2024-10-31 21:59:28,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 69 remaining) [2024-10-31 21:59:28,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 69 remaining) [2024-10-31 21:59:28,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 69 remaining) [2024-10-31 21:59:28,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 69 remaining) [2024-10-31 21:59:28,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 69 remaining) [2024-10-31 21:59:28,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 69 remaining) [2024-10-31 21:59:28,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 69 remaining) [2024-10-31 21:59:28,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 69 remaining) [2024-10-31 21:59:28,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 69 remaining) [2024-10-31 21:59:28,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 69 remaining) [2024-10-31 21:59:28,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 69 remaining) [2024-10-31 21:59:28,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 69 remaining) [2024-10-31 21:59:28,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-31 21:59:28,924 INFO L407 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-10-31 21:59:28,931 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 21:59:28,931 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 21:59:28,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 09:59:28 BasicIcfg [2024-10-31 21:59:28,937 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 21:59:28,938 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 21:59:28,938 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 21:59:28,938 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 21:59:28,939 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:59:11" (3/4) ... [2024-10-31 21:59:28,941 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-10-31 21:59:28,945 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-31 21:59:28,945 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-31 21:59:28,946 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-31 21:59:28,951 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-31 21:59:28,952 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-31 21:59:28,952 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-31 21:59:28,952 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-31 21:59:29,082 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 21:59:29,083 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU/witness.yml [2024-10-31 21:59:29,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 21:59:29,084 INFO L158 Benchmark]: Toolchain (without parser) took 18615.28ms. Allocated memory was 178.3MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 145.1MB in the beginning and 591.8MB in the end (delta: -446.6MB). Peak memory consumption was 817.8MB. Max. memory is 16.1GB. [2024-10-31 21:59:29,084 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:59:29,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.41ms. Allocated memory is still 178.3MB. Free memory was 145.1MB in the beginning and 142.5MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-31 21:59:29,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.60ms. Allocated memory is still 178.3MB. Free memory was 142.5MB in the beginning and 139.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 21:59:29,085 INFO L158 Benchmark]: Boogie Preprocessor took 31.13ms. Allocated memory is still 178.3MB. Free memory was 139.7MB in the beginning and 138.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:59:29,085 INFO L158 Benchmark]: RCFGBuilder took 877.88ms. Allocated memory is still 178.3MB. Free memory was 138.4MB in the beginning and 109.7MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-31 21:59:29,090 INFO L158 Benchmark]: TraceAbstraction took 17036.65ms. Allocated memory was 178.3MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 109.0MB in the beginning and 597.0MB in the end (delta: -488.0MB). Peak memory consumption was 779.7MB. Max. memory is 16.1GB. [2024-10-31 21:59:29,090 INFO L158 Benchmark]: Witness Printer took 144.92ms. Allocated memory is still 1.4GB. Free memory was 597.0MB in the beginning and 591.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 21:59:29,092 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.27ms. Allocated memory is still 117.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.41ms. Allocated memory is still 178.3MB. Free memory was 145.1MB in the beginning and 142.5MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.60ms. Allocated memory is still 178.3MB. Free memory was 142.5MB in the beginning and 139.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.13ms. Allocated memory is still 178.3MB. Free memory was 139.7MB in the beginning and 138.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 877.88ms. Allocated memory is still 178.3MB. Free memory was 138.4MB in the beginning and 109.7MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17036.65ms. Allocated memory was 178.3MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 109.0MB in the beginning and 597.0MB in the end (delta: -488.0MB). Peak memory consumption was 779.7MB. Max. memory is 16.1GB. * Witness Printer took 144.92ms. Allocated memory is still 1.4GB. Free memory was 597.0MB in the beginning and 591.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 16.8s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 482 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.7s 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.3s SatisfiabilityAnalysisTime, 1.2s 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 - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-31 21:59:29,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8d9e6aa-57fd-4034-ba8b-c10fe9e3e1ce/bin/uautomizer-verify-4GaUIPS5ZU/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