./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e9daa1-3968-4543-b434-8e332f8349c8/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e9daa1-3968-4543-b434-8e332f8349c8/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_00e9daa1-3968-4543-b434-8e332f8349c8/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e9daa1-3968-4543-b434-8e332f8349c8/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e9daa1-3968-4543-b434-8e332f8349c8/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_00e9daa1-3968-4543-b434-8e332f8349c8/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 d7ba2cbd8ed9f48aa977924dd556bad66f28ba8aaa41d75f8db9183096d20ba1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:19:02,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:19:02,952 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e9daa1-3968-4543-b434-8e332f8349c8/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 22:19:02,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:19:02,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:19:02,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:19:02,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:19:02,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:19:02,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:19:02,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:19:02,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:19:02,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:19:02,983 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:19:02,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:19:02,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:19:02,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:19:02,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:19:02,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:19:02,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:19:02,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:19:02,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:19:02,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:19:02,988 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 22:19:02,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:19:02,989 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:19:02,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:19:02,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:19:02,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:19:02,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:19:02,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:19:02,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:19:02,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:02,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:19:02,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:19:02,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:19:02,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:19:02,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:19:02,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:19:02,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:19:02,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:19:02,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:19:02,995 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_00e9daa1-3968-4543-b434-8e332f8349c8/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_00e9daa1-3968-4543-b434-8e332f8349c8/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 -> d7ba2cbd8ed9f48aa977924dd556bad66f28ba8aaa41d75f8db9183096d20ba1 [2024-10-31 22:19:03,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:19:03,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:19:03,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:19:03,335 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:19:03,335 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:19:03,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e9daa1-3968-4543-b434-8e332f8349c8/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c Unable to find full path for "g++" [2024-10-31 22:19:05,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:19:05,490 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:19:05,490 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e9daa1-3968-4543-b434-8e332f8349c8/sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2024-10-31 22:19:05,502 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e9daa1-3968-4543-b434-8e332f8349c8/bin/uautomizer-verify-4GaUIPS5ZU/data/001dc1e63/bb72fe68266044a99012f942b639bf81/FLAGbde4e92a2 [2024-10-31 22:19:05,870 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e9daa1-3968-4543-b434-8e332f8349c8/bin/uautomizer-verify-4GaUIPS5ZU/data/001dc1e63/bb72fe68266044a99012f942b639bf81 [2024-10-31 22:19:05,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:19:05,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:19:05,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:05,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:19:05,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:19:05,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:05" (1/1) ... [2024-10-31 22:19:05,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652aba8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:05, skipping insertion in model container [2024-10-31 22:19:05,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:19:05" (1/1) ... [2024-10-31 22:19:05,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:19:06,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:06,228 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:19:06,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:19:06,299 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:19:06,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:06 WrapperNode [2024-10-31 22:19:06,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:19:06,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:06,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:19:06,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:19:06,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:06" (1/1) ... [2024-10-31 22:19:06,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:06" (1/1) ... [2024-10-31 22:19:06,367 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 308 [2024-10-31 22:19:06,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:19:06,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:19:06,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:19:06,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:19:06,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:06" (1/1) ... [2024-10-31 22:19:06,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:06" (1/1) ... [2024-10-31 22:19:06,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:06" (1/1) ... [2024-10-31 22:19:06,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:06" (1/1) ... [2024-10-31 22:19:06,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:06" (1/1) ... [2024-10-31 22:19:06,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:06" (1/1) ... [2024-10-31 22:19:06,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:06" (1/1) ... [2024-10-31 22:19:06,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:06" (1/1) ... [2024-10-31 22:19:06,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:19:06,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:19:06,423 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:19:06,423 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:19:06,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:06" (1/1) ... [2024-10-31 22:19:06,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:19:06,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e9daa1-3968-4543-b434-8e332f8349c8/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:19:06,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e9daa1-3968-4543-b434-8e332f8349c8/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:19:06,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e9daa1-3968-4543-b434-8e332f8349c8/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:19:06,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:19:06,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-31 22:19:06,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-31 22:19:06,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-31 22:19:06,563 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-31 22:19:06,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-31 22:19:06,563 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-31 22:19:06,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 22:19:06,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:19:06,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:19:06,565 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 22:19:06,692 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:19:06,694 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:19:07,292 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:19:07,292 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:19:07,320 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:19:07,322 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:19:07,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:07 BoogieIcfgContainer [2024-10-31 22:19:07,323 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:19:07,327 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:19:07,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:19:07,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:19:07,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:19:05" (1/3) ... [2024-10-31 22:19:07,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1400bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:19:07, skipping insertion in model container [2024-10-31 22:19:07,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:19:06" (2/3) ... [2024-10-31 22:19:07,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1400bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:19:07, skipping insertion in model container [2024-10-31 22:19:07,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:07" (3/3) ... [2024-10-31 22:19:07,335 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-subst.wvr.c [2024-10-31 22:19:07,355 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:19:07,356 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-10-31 22:19:07,356 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:19:07,528 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-31 22:19:07,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 401 places, 412 transitions, 845 flow [2024-10-31 22:19:07,839 INFO L124 PetriNetUnfolderBase]: 21/409 cut-off events. [2024-10-31 22:19:07,840 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-31 22:19:07,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 409 events. 21/409 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1065 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 283. Up to 2 conditions per place. [2024-10-31 22:19:07,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 401 places, 412 transitions, 845 flow [2024-10-31 22:19:07,867 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 380 places, 389 transitions, 796 flow [2024-10-31 22:19:07,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:19:07,891 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;@60f3ce80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:19:07,892 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2024-10-31 22:19:07,900 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:19:07,900 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-10-31 22:19:07,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:19:07,900 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:07,901 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 22:19:07,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:07,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:07,909 INFO L85 PathProgramCache]: Analyzing trace with hash 795979492, now seen corresponding path program 1 times [2024-10-31 22:19:07,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:07,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718034657] [2024-10-31 22:19:07,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,166 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 22:19:08,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:08,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718034657] [2024-10-31 22:19:08,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718034657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:08,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:08,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:08,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802419985] [2024-10-31 22:19:08,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:08,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:08,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:08,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:08,244 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2024-10-31 22:19:08,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 389 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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 22:19:08,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:08,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2024-10-31 22:19:08,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:08,483 INFO L124 PetriNetUnfolderBase]: 35/716 cut-off events. [2024-10-31 22:19:08,484 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2024-10-31 22:19:08,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 716 events. 35/716 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3261 event pairs, 7 based on Foata normal form. 23/617 useless extension candidates. Maximal degree in co-relation 608. Up to 25 conditions per place. [2024-10-31 22:19:08,499 INFO L140 encePairwiseOnDemand]: 402/412 looper letters, 11 selfloop transitions, 2 changer transitions 1/381 dead transitions. [2024-10-31 22:19:08,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 381 transitions, 806 flow [2024-10-31 22:19:08,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2024-10-31 22:19:08,518 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2024-10-31 22:19:08,522 INFO L175 Difference]: Start difference. First operand has 380 places, 389 transitions, 796 flow. Second operand 3 states and 1185 transitions. [2024-10-31 22:19:08,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 381 transitions, 806 flow [2024-10-31 22:19:08,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 381 transitions, 794 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-31 22:19:08,541 INFO L231 Difference]: Finished difference. Result has 375 places, 380 transitions, 770 flow [2024-10-31 22:19:08,544 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=375, PETRI_TRANSITIONS=380} [2024-10-31 22:19:08,550 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -5 predicate places. [2024-10-31 22:19:08,551 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 380 transitions, 770 flow [2024-10-31 22:19:08,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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 22:19:08,552 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:08,552 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 22:19:08,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:19:08,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:08,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:08,555 INFO L85 PathProgramCache]: Analyzing trace with hash 213531984, now seen corresponding path program 1 times [2024-10-31 22:19:08,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:08,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841883012] [2024-10-31 22:19:08,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:08,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,617 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 22:19:08,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:08,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841883012] [2024-10-31 22:19:08,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841883012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:08,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:08,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:08,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113977976] [2024-10-31 22:19:08,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:08,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:08,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:08,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:08,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:08,655 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2024-10-31 22:19:08,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 380 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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 22:19:08,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:08,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2024-10-31 22:19:08,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:08,850 INFO L124 PetriNetUnfolderBase]: 25/551 cut-off events. [2024-10-31 22:19:08,851 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-31 22:19:08,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 551 events. 25/551 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2196 event pairs, 5 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 547. Up to 22 conditions per place. [2024-10-31 22:19:08,861 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2024-10-31 22:19:08,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 379 transitions, 794 flow [2024-10-31 22:19:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:08,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2024-10-31 22:19:08,867 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2024-10-31 22:19:08,867 INFO L175 Difference]: Start difference. First operand has 375 places, 380 transitions, 770 flow. Second operand 3 states and 1178 transitions. [2024-10-31 22:19:08,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 379 transitions, 794 flow [2024-10-31 22:19:08,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 379 transitions, 790 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:08,879 INFO L231 Difference]: Finished difference. Result has 373 places, 379 transitions, 768 flow [2024-10-31 22:19:08,880 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=373, PETRI_TRANSITIONS=379} [2024-10-31 22:19:08,881 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -7 predicate places. [2024-10-31 22:19:08,881 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 379 transitions, 768 flow [2024-10-31 22:19:08,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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 22:19:08,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:08,883 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 22:19:08,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:19:08,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:08,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash -144288898, now seen corresponding path program 1 times [2024-10-31 22:19:08,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:08,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467102893] [2024-10-31 22:19:08,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:08,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:08,975 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 22:19:08,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:08,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467102893] [2024-10-31 22:19:08,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467102893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:08,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:08,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:08,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818202435] [2024-10-31 22:19:08,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:08,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:08,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:08,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:08,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:09,009 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2024-10-31 22:19:09,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 379 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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 22:19:09,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:09,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2024-10-31 22:19:09,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:09,147 INFO L124 PetriNetUnfolderBase]: 23/470 cut-off events. [2024-10-31 22:19:09,147 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-10-31 22:19:09,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 470 events. 23/470 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1661 event pairs, 7 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 460. Up to 25 conditions per place. [2024-10-31 22:19:09,158 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2024-10-31 22:19:09,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 378 transitions, 792 flow [2024-10-31 22:19:09,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2024-10-31 22:19:09,163 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2024-10-31 22:19:09,164 INFO L175 Difference]: Start difference. First operand has 373 places, 379 transitions, 768 flow. Second operand 3 states and 1178 transitions. [2024-10-31 22:19:09,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 378 transitions, 792 flow [2024-10-31 22:19:09,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 378 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:09,171 INFO L231 Difference]: Finished difference. Result has 372 places, 378 transitions, 766 flow [2024-10-31 22:19:09,172 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=372, PETRI_TRANSITIONS=378} [2024-10-31 22:19:09,173 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -8 predicate places. [2024-10-31 22:19:09,173 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 378 transitions, 766 flow [2024-10-31 22:19:09,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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 22:19:09,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:09,175 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 22:19:09,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:19:09,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:09,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:09,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1587522512, now seen corresponding path program 1 times [2024-10-31 22:19:09,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:09,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924457063] [2024-10-31 22:19:09,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:09,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:09,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:09,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924457063] [2024-10-31 22:19:09,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924457063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:09,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:09,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:09,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782005026] [2024-10-31 22:19:09,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:09,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:09,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:09,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:09,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:09,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2024-10-31 22:19:09,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 378 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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 22:19:09,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:09,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2024-10-31 22:19:09,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:09,471 INFO L124 PetriNetUnfolderBase]: 43/846 cut-off events. [2024-10-31 22:19:09,471 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-31 22:19:09,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 846 events. 43/846 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4599 event pairs, 7 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 831. Up to 25 conditions per place. [2024-10-31 22:19:09,487 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-10-31 22:19:09,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 377 transitions, 790 flow [2024-10-31 22:19:09,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2024-10-31 22:19:09,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2024-10-31 22:19:09,493 INFO L175 Difference]: Start difference. First operand has 372 places, 378 transitions, 766 flow. Second operand 3 states and 1178 transitions. [2024-10-31 22:19:09,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 377 transitions, 790 flow [2024-10-31 22:19:09,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 377 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:09,500 INFO L231 Difference]: Finished difference. Result has 371 places, 377 transitions, 764 flow [2024-10-31 22:19:09,501 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=371, PETRI_TRANSITIONS=377} [2024-10-31 22:19:09,502 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -9 predicate places. [2024-10-31 22:19:09,502 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 377 transitions, 764 flow [2024-10-31 22:19:09,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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 22:19:09,504 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:09,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:19:09,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:09,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:09,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1746765296, now seen corresponding path program 1 times [2024-10-31 22:19:09,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:09,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559762810] [2024-10-31 22:19:09,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:09,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:09,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:09,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559762810] [2024-10-31 22:19:09,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559762810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:09,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:09,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:09,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740234557] [2024-10-31 22:19:09,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:09,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:09,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:09,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:09,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:09,605 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2024-10-31 22:19:09,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 377 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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 22:19:09,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:09,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2024-10-31 22:19:09,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:09,743 INFO L124 PetriNetUnfolderBase]: 32/602 cut-off events. [2024-10-31 22:19:09,744 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-31 22:19:09,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 602 events. 32/602 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2760 event pairs, 8 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 583. Up to 29 conditions per place. [2024-10-31 22:19:09,755 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2024-10-31 22:19:09,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 376 transitions, 790 flow [2024-10-31 22:19:09,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:09,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2024-10-31 22:19:09,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9514563106796117 [2024-10-31 22:19:09,759 INFO L175 Difference]: Start difference. First operand has 371 places, 377 transitions, 764 flow. Second operand 3 states and 1176 transitions. [2024-10-31 22:19:09,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 376 transitions, 790 flow [2024-10-31 22:19:09,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 376 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:09,771 INFO L231 Difference]: Finished difference. Result has 370 places, 376 transitions, 762 flow [2024-10-31 22:19:09,772 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=370, PETRI_TRANSITIONS=376} [2024-10-31 22:19:09,773 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -10 predicate places. [2024-10-31 22:19:09,773 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 376 transitions, 762 flow [2024-10-31 22:19:09,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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 22:19:09,775 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:09,775 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 22:19:09,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:19:09,775 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:09,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:09,776 INFO L85 PathProgramCache]: Analyzing trace with hash 639497774, now seen corresponding path program 1 times [2024-10-31 22:19:09,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:09,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795547136] [2024-10-31 22:19:09,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:09,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:09,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:09,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795547136] [2024-10-31 22:19:09,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795547136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:09,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:09,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:09,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487026013] [2024-10-31 22:19:09,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:09,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:09,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:09,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:09,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:09,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 412 [2024-10-31 22:19:09,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 376 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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 22:19:09,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:09,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 412 [2024-10-31 22:19:09,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:10,134 INFO L124 PetriNetUnfolderBase]: 64/971 cut-off events. [2024-10-31 22:19:10,135 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-10-31 22:19:10,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 971 events. 64/971 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5214 event pairs, 20 based on Foata normal form. 0/809 useless extension candidates. Maximal degree in co-relation 963. Up to 50 conditions per place. [2024-10-31 22:19:10,167 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2024-10-31 22:19:10,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 375 transitions, 790 flow [2024-10-31 22:19:10,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1174 transitions. [2024-10-31 22:19:10,171 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9498381877022654 [2024-10-31 22:19:10,171 INFO L175 Difference]: Start difference. First operand has 370 places, 376 transitions, 762 flow. Second operand 3 states and 1174 transitions. [2024-10-31 22:19:10,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 375 transitions, 790 flow [2024-10-31 22:19:10,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 375 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:10,179 INFO L231 Difference]: Finished difference. Result has 369 places, 375 transitions, 760 flow [2024-10-31 22:19:10,180 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=369, PETRI_TRANSITIONS=375} [2024-10-31 22:19:10,182 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -11 predicate places. [2024-10-31 22:19:10,183 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 375 transitions, 760 flow [2024-10-31 22:19:10,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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 22:19:10,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:10,185 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 22:19:10,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:19:10,185 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:10,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:10,186 INFO L85 PathProgramCache]: Analyzing trace with hash -447938175, now seen corresponding path program 1 times [2024-10-31 22:19:10,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:10,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131125547] [2024-10-31 22:19:10,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:10,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:10,273 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 22:19:10,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:10,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131125547] [2024-10-31 22:19:10,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131125547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:10,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:10,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:10,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854758499] [2024-10-31 22:19:10,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:10,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:10,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:10,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:10,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:10,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 412 [2024-10-31 22:19:10,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 375 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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 22:19:10,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:10,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 412 [2024-10-31 22:19:10,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:10,454 INFO L124 PetriNetUnfolderBase]: 35/709 cut-off events. [2024-10-31 22:19:10,454 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2024-10-31 22:19:10,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 709 events. 35/709 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3503 event pairs, 7 based on Foata normal form. 0/595 useless extension candidates. Maximal degree in co-relation 670. Up to 25 conditions per place. [2024-10-31 22:19:10,471 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2024-10-31 22:19:10,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 374 transitions, 784 flow [2024-10-31 22:19:10,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1178 transitions. [2024-10-31 22:19:10,478 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9530744336569579 [2024-10-31 22:19:10,478 INFO L175 Difference]: Start difference. First operand has 369 places, 375 transitions, 760 flow. Second operand 3 states and 1178 transitions. [2024-10-31 22:19:10,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 374 transitions, 784 flow [2024-10-31 22:19:10,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:10,485 INFO L231 Difference]: Finished difference. Result has 368 places, 374 transitions, 758 flow [2024-10-31 22:19:10,486 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=368, PETRI_TRANSITIONS=374} [2024-10-31 22:19:10,486 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -12 predicate places. [2024-10-31 22:19:10,487 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 374 transitions, 758 flow [2024-10-31 22:19:10,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.3333333333333) internal successors, (1168), 3 states have internal predecessors, (1168), 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 22:19:10,488 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:10,489 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 22:19:10,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:19:10,489 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:10,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:10,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1577847982, now seen corresponding path program 1 times [2024-10-31 22:19:10,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:10,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991425245] [2024-10-31 22:19:10,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:10,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:10,571 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 22:19:10,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:10,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991425245] [2024-10-31 22:19:10,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991425245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:10,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:10,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:10,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581099595] [2024-10-31 22:19:10,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:10,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:10,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:10,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:10,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:10,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2024-10-31 22:19:10,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 374 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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 22:19:10,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:10,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2024-10-31 22:19:10,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:10,783 INFO L124 PetriNetUnfolderBase]: 36/713 cut-off events. [2024-10-31 22:19:10,784 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-31 22:19:10,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 713 events. 36/713 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3722 event pairs, 8 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 670. Up to 29 conditions per place. [2024-10-31 22:19:10,797 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2024-10-31 22:19:10,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 373 transitions, 784 flow [2024-10-31 22:19:10,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:10,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2024-10-31 22:19:10,801 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9514563106796117 [2024-10-31 22:19:10,801 INFO L175 Difference]: Start difference. First operand has 368 places, 374 transitions, 758 flow. Second operand 3 states and 1176 transitions. [2024-10-31 22:19:10,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 373 transitions, 784 flow [2024-10-31 22:19:10,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 373 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:10,810 INFO L231 Difference]: Finished difference. Result has 367 places, 373 transitions, 756 flow [2024-10-31 22:19:10,811 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=367, PETRI_TRANSITIONS=373} [2024-10-31 22:19:10,814 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -13 predicate places. [2024-10-31 22:19:10,814 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 373 transitions, 756 flow [2024-10-31 22:19:10,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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 22:19:10,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:19:10,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:19:10,816 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:10,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:10,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1051413800, now seen corresponding path program 1 times [2024-10-31 22:19:10,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:10,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765290457] [2024-10-31 22:19:10,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:10,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:10,930 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 22:19:10,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:10,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765290457] [2024-10-31 22:19:10,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765290457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:10,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:10,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937211083] [2024-10-31 22:19:10,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:10,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:10,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:10,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:10,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:10,983 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 386 out of 412 [2024-10-31 22:19:10,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 373 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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 22:19:10,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:10,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 386 of 412 [2024-10-31 22:19:10,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:11,139 INFO L124 PetriNetUnfolderBase]: 40/564 cut-off events. [2024-10-31 22:19:11,139 INFO L125 PetriNetUnfolderBase]: For 9/13 co-relation queries the response was YES. [2024-10-31 22:19:11,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 564 events. 40/564 cut-off events. For 9/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2627 event pairs, 20 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 532. Up to 50 conditions per place. [2024-10-31 22:19:11,151 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2024-10-31 22:19:11,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 372 transitions, 784 flow [2024-10-31 22:19:11,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1174 transitions. [2024-10-31 22:19:11,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9498381877022654 [2024-10-31 22:19:11,155 INFO L175 Difference]: Start difference. First operand has 367 places, 373 transitions, 756 flow. Second operand 3 states and 1174 transitions. [2024-10-31 22:19:11,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 372 transitions, 784 flow [2024-10-31 22:19:11,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:11,162 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 754 flow [2024-10-31 22:19:11,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=364, 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=366, PETRI_TRANSITIONS=372} [2024-10-31 22:19:11,164 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2024-10-31 22:19:11,164 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 754 flow [2024-10-31 22:19:11,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 387.3333333333333) internal successors, (1162), 3 states have internal predecessors, (1162), 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 22:19:11,166 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:11,166 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 22:19:11,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:19:11,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:11,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:11,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1398066235, now seen corresponding path program 1 times [2024-10-31 22:19:11,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:11,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439211119] [2024-10-31 22:19:11,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:11,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,217 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 22:19:11,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:11,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439211119] [2024-10-31 22:19:11,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439211119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:11,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:11,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:11,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436751322] [2024-10-31 22:19:11,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:11,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:11,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:11,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:11,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:11,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-31 22:19:11,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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 22:19:11,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:11,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-31 22:19:11,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:11,474 INFO L124 PetriNetUnfolderBase]: 76/1238 cut-off events. [2024-10-31 22:19:11,474 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 22:19:11,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 1238 events. 76/1238 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 8585 event pairs, 13 based on Foata normal form. 0/1025 useless extension candidates. Maximal degree in co-relation 1202. Up to 43 conditions per place. [2024-10-31 22:19:11,494 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 13 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2024-10-31 22:19:11,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 374 transitions, 790 flow [2024-10-31 22:19:11,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2024-10-31 22:19:11,497 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9603559870550162 [2024-10-31 22:19:11,498 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 754 flow. Second operand 3 states and 1187 transitions. [2024-10-31 22:19:11,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 374 transitions, 790 flow [2024-10-31 22:19:11,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 374 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:11,504 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 760 flow [2024-10-31 22:19:11,506 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=365, PETRI_TRANSITIONS=372} [2024-10-31 22:19:11,507 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-31 22:19:11,507 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 760 flow [2024-10-31 22:19:11,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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 22:19:11,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:11,508 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 22:19:11,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:19:11,509 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:11,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1492401106, now seen corresponding path program 1 times [2024-10-31 22:19:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:11,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13891933] [2024-10-31 22:19:11,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:11,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,560 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 22:19:11,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:11,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13891933] [2024-10-31 22:19:11,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13891933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:11,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:11,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:11,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080305070] [2024-10-31 22:19:11,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:11,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:11,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:11,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:11,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:11,582 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2024-10-31 22:19:11,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 372 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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 22:19:11,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:11,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2024-10-31 22:19:11,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:11,800 INFO L124 PetriNetUnfolderBase]: 69/1058 cut-off events. [2024-10-31 22:19:11,800 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 22:19:11,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 1058 events. 69/1058 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6756 event pairs, 10 based on Foata normal form. 0/893 useless extension candidates. Maximal degree in co-relation 942. Up to 49 conditions per place. [2024-10-31 22:19:11,825 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 15 selfloop transitions, 3 changer transitions 0/374 dead transitions. [2024-10-31 22:19:11,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 374 transitions, 802 flow [2024-10-31 22:19:11,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:11,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2024-10-31 22:19:11,829 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9563106796116505 [2024-10-31 22:19:11,830 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 760 flow. Second operand 3 states and 1182 transitions. [2024-10-31 22:19:11,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 374 transitions, 802 flow [2024-10-31 22:19:11,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 374 transitions, 802 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:11,841 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 775 flow [2024-10-31 22:19:11,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=365, PETRI_TRANSITIONS=372} [2024-10-31 22:19:11,842 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-31 22:19:11,842 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 775 flow [2024-10-31 22:19:11,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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 22:19:11,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:11,843 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 22:19:11,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:19:11,844 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:11,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:11,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1381044782, now seen corresponding path program 1 times [2024-10-31 22:19:11,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:11,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881736668] [2024-10-31 22:19:11,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:11,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:11,905 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 22:19:11,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:11,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881736668] [2024-10-31 22:19:11,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881736668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:11,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:11,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:11,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639914949] [2024-10-31 22:19:11,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:11,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:11,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:11,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:11,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:11,921 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-31 22:19:11,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 372 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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 22:19:11,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:11,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-31 22:19:11,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:12,184 INFO L124 PetriNetUnfolderBase]: 70/1296 cut-off events. [2024-10-31 22:19:12,184 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2024-10-31 22:19:12,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 1296 events. 70/1296 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9339 event pairs, 4 based on Foata normal form. 1/1110 useless extension candidates. Maximal degree in co-relation 1117. Up to 53 conditions per place. [2024-10-31 22:19:12,211 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-10-31 22:19:12,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 377 transitions, 826 flow [2024-10-31 22:19:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2024-10-31 22:19:12,215 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2024-10-31 22:19:12,215 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 775 flow. Second operand 3 states and 1190 transitions. [2024-10-31 22:19:12,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 377 transitions, 826 flow [2024-10-31 22:19:12,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 377 transitions, 826 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:12,224 INFO L231 Difference]: Finished difference. Result has 366 places, 372 transitions, 785 flow [2024-10-31 22:19:12,225 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=366, PETRI_TRANSITIONS=372} [2024-10-31 22:19:12,225 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2024-10-31 22:19:12,226 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 372 transitions, 785 flow [2024-10-31 22:19:12,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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 22:19:12,227 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:12,227 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 22:19:12,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:19:12,228 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:12,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1644657233, now seen corresponding path program 1 times [2024-10-31 22:19:12,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:12,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618144836] [2024-10-31 22:19:12,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:12,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:12,286 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 22:19:12,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:12,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618144836] [2024-10-31 22:19:12,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618144836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:12,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:12,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:12,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716833561] [2024-10-31 22:19:12,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:12,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:12,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:12,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:12,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:12,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 412 [2024-10-31 22:19:12,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 372 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 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 22:19:12,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:12,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 412 [2024-10-31 22:19:12,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:12,533 INFO L124 PetriNetUnfolderBase]: 57/1056 cut-off events. [2024-10-31 22:19:12,533 INFO L125 PetriNetUnfolderBase]: For 4/20 co-relation queries the response was YES. [2024-10-31 22:19:12,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 1056 events. 57/1056 cut-off events. For 4/20 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6850 event pairs, 8 based on Foata normal form. 2/909 useless extension candidates. Maximal degree in co-relation 957. Up to 32 conditions per place. [2024-10-31 22:19:12,559 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 11 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2024-10-31 22:19:12,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 373 transitions, 815 flow [2024-10-31 22:19:12,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2024-10-31 22:19:12,563 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9603559870550162 [2024-10-31 22:19:12,563 INFO L175 Difference]: Start difference. First operand has 366 places, 372 transitions, 785 flow. Second operand 3 states and 1187 transitions. [2024-10-31 22:19:12,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 373 transitions, 815 flow [2024-10-31 22:19:12,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 373 transitions, 815 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:12,571 INFO L231 Difference]: Finished difference. Result has 367 places, 371 transitions, 787 flow [2024-10-31 22:19:12,572 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=365, 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=787, PETRI_PLACES=367, PETRI_TRANSITIONS=371} [2024-10-31 22:19:12,572 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -13 predicate places. [2024-10-31 22:19:12,573 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 371 transitions, 787 flow [2024-10-31 22:19:12,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.3333333333333) internal successors, (1177), 3 states have internal predecessors, (1177), 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 22:19:12,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:12,574 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 22:19:12,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:19:12,574 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:12,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:12,575 INFO L85 PathProgramCache]: Analyzing trace with hash -375103681, now seen corresponding path program 1 times [2024-10-31 22:19:12,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:12,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751324327] [2024-10-31 22:19:12,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:12,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:19:12,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:12,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751324327] [2024-10-31 22:19:12,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751324327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:12,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:12,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:12,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125392756] [2024-10-31 22:19:12,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:12,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:12,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:12,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:12,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:12,646 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 412 [2024-10-31 22:19:12,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 371 transitions, 787 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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 22:19:12,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:12,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 412 [2024-10-31 22:19:12,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:13,342 INFO L124 PetriNetUnfolderBase]: 344/3908 cut-off events. [2024-10-31 22:19:13,343 INFO L125 PetriNetUnfolderBase]: For 62/74 co-relation queries the response was YES. [2024-10-31 22:19:13,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4300 conditions, 3908 events. 344/3908 cut-off events. For 62/74 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 40513 event pairs, 96 based on Foata normal form. 0/3321 useless extension candidates. Maximal degree in co-relation 3500. Up to 312 conditions per place. [2024-10-31 22:19:13,394 INFO L140 encePairwiseOnDemand]: 404/412 looper letters, 17 selfloop transitions, 4 changer transitions 0/373 dead transitions. [2024-10-31 22:19:13,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 373 transitions, 835 flow [2024-10-31 22:19:13,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1177 transitions. [2024-10-31 22:19:13,398 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9522653721682848 [2024-10-31 22:19:13,398 INFO L175 Difference]: Start difference. First operand has 367 places, 371 transitions, 787 flow. Second operand 3 states and 1177 transitions. [2024-10-31 22:19:13,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 373 transitions, 835 flow [2024-10-31 22:19:13,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 373 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:13,407 INFO L231 Difference]: Finished difference. Result has 364 places, 371 transitions, 803 flow [2024-10-31 22:19:13,408 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=803, PETRI_PLACES=364, PETRI_TRANSITIONS=371} [2024-10-31 22:19:13,408 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2024-10-31 22:19:13,409 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 371 transitions, 803 flow [2024-10-31 22:19:13,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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 22:19:13,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:13,410 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 22:19:13,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:19:13,410 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:13,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:13,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1214327577, now seen corresponding path program 1 times [2024-10-31 22:19:13,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:13,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586114463] [2024-10-31 22:19:13,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:13,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:13,470 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 22:19:13,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:13,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586114463] [2024-10-31 22:19:13,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586114463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:13,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:13,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:13,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843959146] [2024-10-31 22:19:13,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:13,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:13,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:13,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:13,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:13,496 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 412 [2024-10-31 22:19:13,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 371 transitions, 803 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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 22:19:13,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:13,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 412 [2024-10-31 22:19:13,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:14,110 INFO L124 PetriNetUnfolderBase]: 167/2950 cut-off events. [2024-10-31 22:19:14,110 INFO L125 PetriNetUnfolderBase]: For 23/34 co-relation queries the response was YES. [2024-10-31 22:19:14,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3185 conditions, 2950 events. 167/2950 cut-off events. For 23/34 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 27821 event pairs, 20 based on Foata normal form. 1/2540 useless extension candidates. Maximal degree in co-relation 2794. Up to 133 conditions per place. [2024-10-31 22:19:14,152 INFO L140 encePairwiseOnDemand]: 406/412 looper letters, 18 selfloop transitions, 3 changer transitions 0/376 dead transitions. [2024-10-31 22:19:14,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 376 transitions, 860 flow [2024-10-31 22:19:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:14,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:14,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2024-10-31 22:19:14,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2024-10-31 22:19:14,156 INFO L175 Difference]: Start difference. First operand has 364 places, 371 transitions, 803 flow. Second operand 3 states and 1185 transitions. [2024-10-31 22:19:14,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 376 transitions, 860 flow [2024-10-31 22:19:14,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 376 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:14,162 INFO L231 Difference]: Finished difference. Result has 364 places, 371 transitions, 818 flow [2024-10-31 22:19:14,162 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=818, PETRI_PLACES=364, PETRI_TRANSITIONS=371} [2024-10-31 22:19:14,163 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2024-10-31 22:19:14,163 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 371 transitions, 818 flow [2024-10-31 22:19:14,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 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 22:19:14,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:14,164 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 22:19:14,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:19:14,164 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:14,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:14,165 INFO L85 PathProgramCache]: Analyzing trace with hash -475719494, now seen corresponding path program 1 times [2024-10-31 22:19:14,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:14,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163001720] [2024-10-31 22:19:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:14,208 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 22:19:14,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:14,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163001720] [2024-10-31 22:19:14,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163001720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:14,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:14,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:14,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130731627] [2024-10-31 22:19:14,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:14,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:14,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:14,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:14,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:14,222 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-31 22:19:14,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 371 transitions, 818 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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 22:19:14,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:14,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-31 22:19:14,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:14,722 INFO L124 PetriNetUnfolderBase]: 114/2582 cut-off events. [2024-10-31 22:19:14,722 INFO L125 PetriNetUnfolderBase]: For 12/18 co-relation queries the response was YES. [2024-10-31 22:19:14,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2804 conditions, 2582 events. 114/2582 cut-off events. For 12/18 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 23033 event pairs, 4 based on Foata normal form. 0/2258 useless extension candidates. Maximal degree in co-relation 2341. Up to 68 conditions per place. [2024-10-31 22:19:14,838 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2024-10-31 22:19:14,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 376 transitions, 869 flow [2024-10-31 22:19:14,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2024-10-31 22:19:14,841 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2024-10-31 22:19:14,841 INFO L175 Difference]: Start difference. First operand has 364 places, 371 transitions, 818 flow. Second operand 3 states and 1190 transitions. [2024-10-31 22:19:14,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 376 transitions, 869 flow [2024-10-31 22:19:14,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 376 transitions, 869 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:14,848 INFO L231 Difference]: Finished difference. Result has 365 places, 371 transitions, 828 flow [2024-10-31 22:19:14,849 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=365, PETRI_TRANSITIONS=371} [2024-10-31 22:19:14,849 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-31 22:19:14,849 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 371 transitions, 828 flow [2024-10-31 22:19:14,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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 22:19:14,850 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:14,851 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 22:19:14,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:19:14,851 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:14,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:14,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1624830416, now seen corresponding path program 1 times [2024-10-31 22:19:14,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:14,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765827744] [2024-10-31 22:19:14,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:14,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:14,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 22:19:14,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:14,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765827744] [2024-10-31 22:19:14,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765827744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:14,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:14,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:14,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845634176] [2024-10-31 22:19:14,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:14,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:14,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:14,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:14,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:14,927 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-31 22:19:14,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 371 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 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 22:19:14,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:14,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-31 22:19:14,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:15,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1006] L50-39-->L50-40: Formula: true InVars {} OutVars{thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~nondet12#1][173], [437#(= |#race~is_null_3~0| 0), 139#L50-40true, Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, Black: 431#true, 458#true, 324#$Ultimate##0true, 74#L78-1true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:15,588 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2024-10-31 22:19:15,589 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-31 22:19:15,589 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:19:15,589 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2024-10-31 22:19:15,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] thread1EXIT-->L78-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][225], [437#(= |#race~is_null_3~0| 0), 139#L50-40true, Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, Black: 431#true, 458#true, 324#$Ultimate##0true, 74#L78-1true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:15,643 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2024-10-31 22:19:15,643 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-10-31 22:19:15,643 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2024-10-31 22:19:15,643 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-10-31 22:19:15,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] thread1EXIT-->L78-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][265], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 460#(= |#race~result_10~0| |thread2Thread1of1ForFork2_#t~nondet12#1|), Black: 431#true, 324#$Ultimate##0true, 74#L78-1true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 93#L50-41true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:15,644 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-10-31 22:19:15,644 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-31 22:19:15,644 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-31 22:19:15,644 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2024-10-31 22:19:15,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] thread1EXIT-->L78-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][265], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 387#L50-42true, 460#(= |#race~result_10~0| |thread2Thread1of1ForFork2_#t~nondet12#1|), Black: 431#true, 324#$Ultimate##0true, 74#L78-1true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:15,653 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-10-31 22:19:15,653 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-10-31 22:19:15,653 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-10-31 22:19:15,653 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2024-10-31 22:19:15,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1154] thread1EXIT-->L78-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][225], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, Black: 454#true, 100#L52true, Black: 431#true, 458#true, 324#$Ultimate##0true, 74#L78-1true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:15,696 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2024-10-31 22:19:15,696 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-10-31 22:19:15,696 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is cut-off event [2024-10-31 22:19:15,696 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2024-10-31 22:19:15,769 INFO L124 PetriNetUnfolderBase]: 227/3804 cut-off events. [2024-10-31 22:19:15,769 INFO L125 PetriNetUnfolderBase]: For 44/113 co-relation queries the response was YES. [2024-10-31 22:19:15,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4274 conditions, 3804 events. 227/3804 cut-off events. For 44/113 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 36952 event pairs, 28 based on Foata normal form. 1/3299 useless extension candidates. Maximal degree in co-relation 3487. Up to 120 conditions per place. [2024-10-31 22:19:15,830 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2024-10-31 22:19:15,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 372 transitions, 860 flow [2024-10-31 22:19:15,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:15,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2024-10-31 22:19:15,834 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2024-10-31 22:19:15,834 INFO L175 Difference]: Start difference. First operand has 365 places, 371 transitions, 828 flow. Second operand 3 states and 1185 transitions. [2024-10-31 22:19:15,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 372 transitions, 860 flow [2024-10-31 22:19:15,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 860 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:15,843 INFO L231 Difference]: Finished difference. Result has 366 places, 370 transitions, 830 flow [2024-10-31 22:19:15,843 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=364, 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=830, PETRI_PLACES=366, PETRI_TRANSITIONS=370} [2024-10-31 22:19:15,844 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2024-10-31 22:19:15,844 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 370 transitions, 830 flow [2024-10-31 22:19:15,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 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 22:19:15,845 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:15,845 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 22:19:15,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:19:15,846 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:15,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:15,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1899868835, now seen corresponding path program 1 times [2024-10-31 22:19:15,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:15,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905964054] [2024-10-31 22:19:15,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:15,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:15,904 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 22:19:15,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:15,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905964054] [2024-10-31 22:19:15,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905964054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:15,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:15,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:15,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210230321] [2024-10-31 22:19:15,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:15,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:15,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:15,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:15,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:15,920 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-31 22:19:15,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 370 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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 22:19:15,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:15,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-31 22:19:15,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:16,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] 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[][350], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= 0 |#race~filename_is_null_5~0|), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), 299#L56-25true, Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:16,682 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is cut-off event [2024-10-31 22:19:16,682 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2024-10-31 22:19:16,682 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2024-10-31 22:19:16,682 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2024-10-31 22:19:16,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] 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[][350], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 433#(= |#race~is_null_0~0| 0), 452#(= 0 |#race~filename_is_null_5~0|), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), 193#L56-26true, Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:16,689 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is cut-off event [2024-10-31 22:19:16,689 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-10-31 22:19:16,689 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is cut-off event [2024-10-31 22:19:16,689 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is cut-off event [2024-10-31 22:19:16,720 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] 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[][350], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), 299#L56-25true, Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:16,720 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2024-10-31 22:19:16,720 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2024-10-31 22:19:16,720 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2024-10-31 22:19:16,720 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2024-10-31 22:19:16,720 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2024-10-31 22:19:16,722 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] 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[][350], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), 193#L56-26true, Black: 450#true, Black: 454#true, Black: 431#true, 458#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:16,722 INFO L294 olderBase$Statistics]: this new event has 204 ancestors and is not cut-off event [2024-10-31 22:19:16,722 INFO L297 olderBase$Statistics]: existing Event has 204 ancestors and is not cut-off event [2024-10-31 22:19:16,722 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is not cut-off event [2024-10-31 22:19:16,722 INFO L297 olderBase$Statistics]: existing Event has 212 ancestors and is not cut-off event [2024-10-31 22:19:16,722 INFO L297 olderBase$Statistics]: existing Event has 240 ancestors and is not cut-off event [2024-10-31 22:19:16,756 INFO L124 PetriNetUnfolderBase]: 126/3370 cut-off events. [2024-10-31 22:19:16,757 INFO L125 PetriNetUnfolderBase]: For 43/80 co-relation queries the response was YES. [2024-10-31 22:19:16,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3690 conditions, 3370 events. 126/3370 cut-off events. For 43/80 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 30759 event pairs, 14 based on Foata normal form. 2/3002 useless extension candidates. Maximal degree in co-relation 3242. Up to 140 conditions per place. [2024-10-31 22:19:16,804 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 16 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2024-10-31 22:19:16,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 375 transitions, 881 flow [2024-10-31 22:19:16,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1190 transitions. [2024-10-31 22:19:16,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627831715210357 [2024-10-31 22:19:16,808 INFO L175 Difference]: Start difference. First operand has 366 places, 370 transitions, 830 flow. Second operand 3 states and 1190 transitions. [2024-10-31 22:19:16,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 375 transitions, 881 flow [2024-10-31 22:19:16,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 375 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:16,815 INFO L231 Difference]: Finished difference. Result has 365 places, 370 transitions, 836 flow [2024-10-31 22:19:16,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=365, PETRI_TRANSITIONS=370} [2024-10-31 22:19:16,816 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-31 22:19:16,816 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 370 transitions, 836 flow [2024-10-31 22:19:16,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 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 22:19:16,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:16,817 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 22:19:16,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 22:19:16,817 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:16,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:16,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1355541654, now seen corresponding path program 1 times [2024-10-31 22:19:16,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:16,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468910026] [2024-10-31 22:19:16,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:16,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:16,866 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 22:19:16,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:16,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468910026] [2024-10-31 22:19:16,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468910026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:16,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:16,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:16,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575514136] [2024-10-31 22:19:16,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:16,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:16,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:16,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:16,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:16,894 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 412 [2024-10-31 22:19:16,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 370 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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 22:19:16,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:16,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 412 [2024-10-31 22:19:16,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:18,263 INFO L124 PetriNetUnfolderBase]: 456/7770 cut-off events. [2024-10-31 22:19:18,263 INFO L125 PetriNetUnfolderBase]: For 134/150 co-relation queries the response was YES. [2024-10-31 22:19:18,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8736 conditions, 7770 events. 456/7770 cut-off events. For 134/150 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 92500 event pairs, 76 based on Foata normal form. 2/7022 useless extension candidates. Maximal degree in co-relation 7734. Up to 616 conditions per place. [2024-10-31 22:19:18,385 INFO L140 encePairwiseOnDemand]: 404/412 looper letters, 19 selfloop transitions, 4 changer transitions 0/374 dead transitions. [2024-10-31 22:19:18,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 374 transitions, 894 flow [2024-10-31 22:19:18,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1179 transitions. [2024-10-31 22:19:18,389 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9538834951456311 [2024-10-31 22:19:18,389 INFO L175 Difference]: Start difference. First operand has 365 places, 370 transitions, 836 flow. Second operand 3 states and 1179 transitions. [2024-10-31 22:19:18,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 374 transitions, 894 flow [2024-10-31 22:19:18,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 374 transitions, 894 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:18,396 INFO L231 Difference]: Finished difference. Result has 364 places, 370 transitions, 856 flow [2024-10-31 22:19:18,397 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=364, PETRI_TRANSITIONS=370} [2024-10-31 22:19:18,398 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2024-10-31 22:19:18,399 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 370 transitions, 856 flow [2024-10-31 22:19:18,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.6666666666667) internal successors, (1157), 3 states have internal predecessors, (1157), 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 22:19:18,400 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:18,400 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 22:19:18,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 22:19:18,401 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:18,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:18,401 INFO L85 PathProgramCache]: Analyzing trace with hash 136961259, now seen corresponding path program 1 times [2024-10-31 22:19:18,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:18,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181653818] [2024-10-31 22:19:18,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:18,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:18,446 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 22:19:18,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:18,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181653818] [2024-10-31 22:19:18,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181653818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:18,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:18,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:18,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008823186] [2024-10-31 22:19:18,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:18,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:18,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:18,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:18,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:18,466 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-31 22:19:18,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 370 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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 22:19:18,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:18,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-31 22:19:18,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:19,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1086] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][224], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), Black: 450#true, 467#(= 0 |#race~filename_is_null_8~0|), 454#true, 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,208 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2024-10-31 22:19:19,208 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-10-31 22:19:19,208 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-10-31 22:19:19,208 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-10-31 22:19:19,271 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] 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[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,272 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2024-10-31 22:19:19,272 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 22:19:19,272 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 22:19:19,272 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 22:19:19,273 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] 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[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,273 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-10-31 22:19:19,273 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 22:19:19,273 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-31 22:19:19,273 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 22:19:19,273 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 22:19:19,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1086] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][224], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,274 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is cut-off event [2024-10-31 22:19:19,274 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 22:19:19,274 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 22:19:19,274 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 22:19:19,275 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1086] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][224], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,275 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2024-10-31 22:19:19,275 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 22:19:19,275 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 22:19:19,275 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 22:19:19,275 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-31 22:19:19,275 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1086] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][224], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,275 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2024-10-31 22:19:19,275 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 22:19:19,275 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 22:19:19,276 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 22:19:19,276 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-31 22:19:19,276 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-31 22:19:19,277 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1086] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][224], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,278 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2024-10-31 22:19:19,278 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 22:19:19,278 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 22:19:19,278 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is cut-off event [2024-10-31 22:19:19,278 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-31 22:19:19,278 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-31 22:19:19,279 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is cut-off event [2024-10-31 22:19:19,281 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] 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], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,282 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-10-31 22:19:19,282 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:19,282 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:19,282 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-31 22:19:19,283 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] 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], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,283 INFO L294 olderBase$Statistics]: this new event has 215 ancestors and is cut-off event [2024-10-31 22:19:19,283 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:19,283 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:19,283 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 22:19:19,283 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-31 22:19:19,287 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] 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], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 98#L56-42true, Black: 439#true, 46#L79true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,288 INFO L294 olderBase$Statistics]: this new event has 244 ancestors and is cut-off event [2024-10-31 22:19:19,288 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-31 22:19:19,288 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-10-31 22:19:19,288 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-31 22:19:19,289 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] 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], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 98#L56-42true, Black: 439#true, 46#L79true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,289 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2024-10-31 22:19:19,289 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-31 22:19:19,289 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-10-31 22:19:19,289 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2024-10-31 22:19:19,289 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-31 22:19:19,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] 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[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 45#L58true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,300 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2024-10-31 22:19:19,300 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-31 22:19:19,301 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-31 22:19:19,301 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-31 22:19:19,301 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] 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[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 45#L58true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,301 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2024-10-31 22:19:19,302 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-31 22:19:19,302 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is cut-off event [2024-10-31 22:19:19,302 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2024-10-31 22:19:19,302 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-10-31 22:19:19,303 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1155] 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[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 469#true, 222#L56-40true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,304 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is not cut-off event [2024-10-31 22:19:19,304 INFO L297 olderBase$Statistics]: existing Event has 206 ancestors and is not cut-off event [2024-10-31 22:19:19,304 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2024-10-31 22:19:19,304 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2024-10-31 22:19:19,304 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2024-10-31 22:19:19,304 INFO L297 olderBase$Statistics]: existing Event has 234 ancestors and is not cut-off event [2024-10-31 22:19:19,305 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1155] 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], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,305 INFO L294 olderBase$Statistics]: this new event has 207 ancestors and is cut-off event [2024-10-31 22:19:19,305 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:19,305 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:19,305 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 22:19:19,305 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is cut-off event [2024-10-31 22:19:19,306 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2024-10-31 22:19:19,308 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1155] 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], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 471#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 448#(= |#race~is_null_6~0| 0), 46#L79true, 98#L56-42true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,308 INFO L294 olderBase$Statistics]: this new event has 208 ancestors and is cut-off event [2024-10-31 22:19:19,308 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-31 22:19:19,308 INFO L297 olderBase$Statistics]: existing Event has 208 ancestors and is cut-off event [2024-10-31 22:19:19,308 INFO L297 olderBase$Statistics]: existing Event has 244 ancestors and is cut-off event [2024-10-31 22:19:19,308 INFO L297 olderBase$Statistics]: existing Event has 216 ancestors and is cut-off event [2024-10-31 22:19:19,309 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2024-10-31 22:19:19,316 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1155] 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[][305], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, 45#L58true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:19,316 INFO L294 olderBase$Statistics]: this new event has 214 ancestors and is not cut-off event [2024-10-31 22:19:19,316 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2024-10-31 22:19:19,316 INFO L297 olderBase$Statistics]: existing Event has 222 ancestors and is not cut-off event [2024-10-31 22:19:19,316 INFO L297 olderBase$Statistics]: existing Event has 214 ancestors and is not cut-off event [2024-10-31 22:19:19,316 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2024-10-31 22:19:19,316 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2024-10-31 22:19:19,335 INFO L124 PetriNetUnfolderBase]: 368/4189 cut-off events. [2024-10-31 22:19:19,335 INFO L125 PetriNetUnfolderBase]: For 239/376 co-relation queries the response was YES. [2024-10-31 22:19:19,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5318 conditions, 4189 events. 368/4189 cut-off events. For 239/376 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 43461 event pairs, 82 based on Foata normal form. 2/3815 useless extension candidates. Maximal degree in co-relation 4684. Up to 427 conditions per place. [2024-10-31 22:19:19,396 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 12 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2024-10-31 22:19:19,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 371 transitions, 888 flow [2024-10-31 22:19:19,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1185 transitions. [2024-10-31 22:19:19,399 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9587378640776699 [2024-10-31 22:19:19,399 INFO L175 Difference]: Start difference. First operand has 364 places, 370 transitions, 856 flow. Second operand 3 states and 1185 transitions. [2024-10-31 22:19:19,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 371 transitions, 888 flow [2024-10-31 22:19:19,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 371 transitions, 888 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:19,405 INFO L231 Difference]: Finished difference. Result has 365 places, 369 transitions, 858 flow [2024-10-31 22:19:19,406 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=363, 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=858, PETRI_PLACES=365, PETRI_TRANSITIONS=369} [2024-10-31 22:19:19,406 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-31 22:19:19,406 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 369 transitions, 858 flow [2024-10-31 22:19:19,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 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 22:19:19,407 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:19,407 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 22:19:19,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 22:19:19,408 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:19,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:19,408 INFO L85 PathProgramCache]: Analyzing trace with hash 239459324, now seen corresponding path program 1 times [2024-10-31 22:19:19,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:19,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962089121] [2024-10-31 22:19:19,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:19,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:19,450 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 22:19:19,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:19,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962089121] [2024-10-31 22:19:19,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962089121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:19,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:19,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:19,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288446424] [2024-10-31 22:19:19,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:19,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:19,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:19,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:19,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:19,465 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-31 22:19:19,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 369 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 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 22:19:19,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:19,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-31 22:19:19,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:20,505 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] 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], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), Black: 450#true, 104#L80true, 467#(= 0 |#race~filename_is_null_8~0|), 454#true, 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 472#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 469#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:20,505 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is not cut-off event [2024-10-31 22:19:20,506 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2024-10-31 22:19:20,506 INFO L297 olderBase$Statistics]: existing Event has 197 ancestors and is not cut-off event [2024-10-31 22:19:20,506 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2024-10-31 22:19:20,631 INFO L124 PetriNetUnfolderBase]: 240/5812 cut-off events. [2024-10-31 22:19:20,631 INFO L125 PetriNetUnfolderBase]: For 70/80 co-relation queries the response was YES. [2024-10-31 22:19:20,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6721 conditions, 5812 events. 240/5812 cut-off events. For 70/80 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 62759 event pairs, 20 based on Foata normal form. 0/5413 useless extension candidates. Maximal degree in co-relation 5910. Up to 300 conditions per place. [2024-10-31 22:19:20,703 INFO L140 encePairwiseOnDemand]: 408/412 looper letters, 15 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2024-10-31 22:19:20,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 373 transitions, 904 flow [2024-10-31 22:19:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2024-10-31 22:19:20,707 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9619741100323624 [2024-10-31 22:19:20,708 INFO L175 Difference]: Start difference. First operand has 365 places, 369 transitions, 858 flow. Second operand 3 states and 1189 transitions. [2024-10-31 22:19:20,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 373 transitions, 904 flow [2024-10-31 22:19:20,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 373 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:19:20,724 INFO L231 Difference]: Finished difference. Result has 364 places, 369 transitions, 864 flow [2024-10-31 22:19:20,725 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=364, PETRI_TRANSITIONS=369} [2024-10-31 22:19:20,726 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2024-10-31 22:19:20,726 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 369 transitions, 864 flow [2024-10-31 22:19:20,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 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 22:19:20,727 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:20,727 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 22:19:20,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-31 22:19:20,727 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:20,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1141967850, now seen corresponding path program 1 times [2024-10-31 22:19:20,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:20,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59058454] [2024-10-31 22:19:20,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:20,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:20,801 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 22:19:20,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:20,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59058454] [2024-10-31 22:19:20,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59058454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:20,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:20,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:20,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537827422] [2024-10-31 22:19:20,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:20,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:20,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:20,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:20,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:20,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 412 [2024-10-31 22:19:20,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 369 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 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 22:19:20,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:20,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 412 [2024-10-31 22:19:20,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:21,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] 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], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, 104#L80true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, Black: 472#true, 476#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:21,762 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2024-10-31 22:19:21,762 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-31 22:19:21,763 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-31 22:19:21,763 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event [2024-10-31 22:19:21,771 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1156] 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], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, 104#L80true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, Black: 472#true, 476#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:21,771 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2024-10-31 22:19:21,771 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-31 22:19:21,772 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-10-31 22:19:21,772 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-10-31 22:19:21,772 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-31 22:19:21,775 INFO L124 PetriNetUnfolderBase]: 193/5368 cut-off events. [2024-10-31 22:19:21,775 INFO L125 PetriNetUnfolderBase]: For 21/57 co-relation queries the response was YES. [2024-10-31 22:19:21,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6100 conditions, 5368 events. 193/5368 cut-off events. For 21/57 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 56682 event pairs, 6 based on Foata normal form. 0/5015 useless extension candidates. Maximal degree in co-relation 5455. Up to 147 conditions per place. [2024-10-31 22:19:21,831 INFO L140 encePairwiseOnDemand]: 410/412 looper letters, 8 selfloop transitions, 1 changer transitions 0/368 dead transitions. [2024-10-31 22:19:21,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 368 transitions, 880 flow [2024-10-31 22:19:21,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2024-10-31 22:19:21,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9619741100323624 [2024-10-31 22:19:21,835 INFO L175 Difference]: Start difference. First operand has 364 places, 369 transitions, 864 flow. Second operand 3 states and 1189 transitions. [2024-10-31 22:19:21,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 368 transitions, 880 flow [2024-10-31 22:19:21,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 368 transitions, 880 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:19:21,841 INFO L231 Difference]: Finished difference. Result has 365 places, 368 transitions, 864 flow [2024-10-31 22:19:21,842 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=365, PETRI_TRANSITIONS=368} [2024-10-31 22:19:21,842 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2024-10-31 22:19:21,842 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 368 transitions, 864 flow [2024-10-31 22:19:21,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 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 22:19:21,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:21,843 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, 1, 1] [2024-10-31 22:19:21,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-31 22:19:21,844 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:21,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1800932855, now seen corresponding path program 1 times [2024-10-31 22:19:21,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:21,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207097241] [2024-10-31 22:19:21,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:21,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:21,905 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 22:19:21,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:21,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207097241] [2024-10-31 22:19:21,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207097241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:21,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:21,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:21,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086222068] [2024-10-31 22:19:21,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:21,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:21,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:21,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:21,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-31 22:19:21,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 368 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 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 22:19:21,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:21,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-31 22:19:21,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:22,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1156] 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], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, 104#L80true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, Black: 472#true, 476#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:22,640 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is not cut-off event [2024-10-31 22:19:22,640 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-31 22:19:22,641 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is not cut-off event [2024-10-31 22:19:22,641 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is not cut-off event [2024-10-31 22:19:22,644 INFO L124 PetriNetUnfolderBase]: 199/5682 cut-off events. [2024-10-31 22:19:22,644 INFO L125 PetriNetUnfolderBase]: For 21/68 co-relation queries the response was YES. [2024-10-31 22:19:22,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6506 conditions, 5682 events. 199/5682 cut-off events. For 21/68 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 61200 event pairs, 18 based on Foata normal form. 0/5317 useless extension candidates. Maximal degree in co-relation 6206. Up to 166 conditions per place. [2024-10-31 22:19:22,743 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 10 selfloop transitions, 1 changer transitions 0/366 dead transitions. [2024-10-31 22:19:22,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 366 transitions, 882 flow [2024-10-31 22:19:22,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1183 transitions. [2024-10-31 22:19:22,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9571197411003236 [2024-10-31 22:19:22,746 INFO L175 Difference]: Start difference. First operand has 365 places, 368 transitions, 864 flow. Second operand 3 states and 1183 transitions. [2024-10-31 22:19:22,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 366 transitions, 882 flow [2024-10-31 22:19:22,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 366 transitions, 881 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:19:22,754 INFO L231 Difference]: Finished difference. Result has 364 places, 366 transitions, 861 flow [2024-10-31 22:19:22,754 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=861, PETRI_PLACES=364, PETRI_TRANSITIONS=366} [2024-10-31 22:19:22,755 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -16 predicate places. [2024-10-31 22:19:22,755 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 366 transitions, 861 flow [2024-10-31 22:19:22,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 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 22:19:22,755 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:19:22,756 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, 1, 1, 1, 1] [2024-10-31 22:19:22,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-31 22:19:22,756 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2024-10-31 22:19:22,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:19:22,756 INFO L85 PathProgramCache]: Analyzing trace with hash -326767216, now seen corresponding path program 1 times [2024-10-31 22:19:22,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:19:22,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689436967] [2024-10-31 22:19:22,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:19:22,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:19:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:19:22,825 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 22:19:22,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:19:22,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689436967] [2024-10-31 22:19:22,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689436967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:19:22,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:19:22,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:19:22,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121167326] [2024-10-31 22:19:22,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:19:22,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:19:22,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:19:22,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:19:22,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:19:22,841 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 412 [2024-10-31 22:19:22,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 366 transitions, 861 flow. Second operand has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 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 22:19:22,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:19:22,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 412 [2024-10-31 22:19:22,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:19:23,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1090] 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][231], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), Black: 450#true, 164#L56-41true, 479#true, 467#(= 0 |#race~filename_is_null_8~0|), 454#true, 461#true, Black: 431#true, Black: 465#true, Black: 435#true, 482#true, 472#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:23,407 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is not cut-off event [2024-10-31 22:19:23,407 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2024-10-31 22:19:23,407 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2024-10-31 22:19:23,407 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2024-10-31 22:19:23,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1090] 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][231], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 463#(= |#race~filename_4~0| 0), 456#(= |#race~filename_1~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:23,474 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-10-31 22:19:23,475 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:23,475 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:23,475 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 22:19:23,489 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1090] 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][231], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:23,489 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-10-31 22:19:23,490 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:23,490 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:23,490 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 22:19:23,490 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 22:19:23,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1155] 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[][302], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:23,490 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2024-10-31 22:19:23,490 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:23,490 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:23,490 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 22:19:23,491 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1090] 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][231], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:23,491 INFO L294 olderBase$Statistics]: this new event has 271 ancestors and is cut-off event [2024-10-31 22:19:23,491 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 22:19:23,491 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:23,491 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:23,491 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 22:19:23,491 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 22:19:23,493 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1155] 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[][302], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), 46#L79true, Black: 439#true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:23,493 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2024-10-31 22:19:23,494 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:23,494 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:23,494 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2024-10-31 22:19:23,494 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2024-10-31 22:19:23,498 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1090] 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][231], [437#(= |#race~is_null_3~0| 0), Black: 446#true, 452#(= 0 |#race~filename_is_null_5~0|), 433#(= |#race~is_null_0~0| 0), 456#(= |#race~filename_1~0| 0), 463#(= |#race~filename_4~0| 0), Black: 450#true, 164#L56-41true, 479#true, Black: 454#true, 467#(= 0 |#race~filename_is_null_8~0|), Black: 461#true, Black: 431#true, 474#(= |#race~filename_7~0| 0), Black: 465#true, Black: 435#true, 482#true, 448#(= |#race~is_null_6~0| 0), Black: 439#true, 46#L79true, Black: 472#true, 441#(= 0 |#race~filename_is_null_2~0|)]) [2024-10-31 22:19:23,499 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is not cut-off event [2024-10-31 22:19:23,499 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2024-10-31 22:19:23,499 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is not cut-off event [2024-10-31 22:19:23,499 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2024-10-31 22:19:23,499 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is not cut-off event [2024-10-31 22:19:23,499 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2024-10-31 22:19:23,499 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is not cut-off event [2024-10-31 22:19:23,503 INFO L124 PetriNetUnfolderBase]: 203/4061 cut-off events. [2024-10-31 22:19:23,503 INFO L125 PetriNetUnfolderBase]: For 63/114 co-relation queries the response was YES. [2024-10-31 22:19:23,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4815 conditions, 4061 events. 203/4061 cut-off events. For 63/114 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 41112 event pairs, 48 based on Foata normal form. 12/3785 useless extension candidates. Maximal degree in co-relation 4647. Up to 248 conditions per place. [2024-10-31 22:19:23,532 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 0 selfloop transitions, 0 changer transitions 364/364 dead transitions. [2024-10-31 22:19:23,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 364 transitions, 877 flow [2024-10-31 22:19:23,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:19:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:19:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2024-10-31 22:19:23,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9563106796116505 [2024-10-31 22:19:23,535 INFO L175 Difference]: Start difference. First operand has 364 places, 366 transitions, 861 flow. Second operand 3 states and 1182 transitions. [2024-10-31 22:19:23,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 364 transitions, 877 flow [2024-10-31 22:19:23,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 364 transitions, 876 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:19:23,541 INFO L231 Difference]: Finished difference. Result has 363 places, 0 transitions, 0 flow [2024-10-31 22:19:23,541 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=363, PETRI_TRANSITIONS=0} [2024-10-31 22:19:23,542 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -17 predicate places. [2024-10-31 22:19:23,542 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 0 transitions, 0 flow [2024-10-31 22:19:23,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 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 22:19:23,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2024-10-31 22:19:23,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2024-10-31 22:19:23,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2024-10-31 22:19:23,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2024-10-31 22:19:23,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2024-10-31 22:19:23,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2024-10-31 22:19:23,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2024-10-31 22:19:23,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2024-10-31 22:19:23,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2024-10-31 22:19:23,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2024-10-31 22:19:23,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2024-10-31 22:19:23,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2024-10-31 22:19:23,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2024-10-31 22:19:23,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2024-10-31 22:19:23,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2024-10-31 22:19:23,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2024-10-31 22:19:23,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2024-10-31 22:19:23,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2024-10-31 22:19:23,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2024-10-31 22:19:23,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2024-10-31 22:19:23,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2024-10-31 22:19:23,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2024-10-31 22:19:23,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2024-10-31 22:19:23,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2024-10-31 22:19:23,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2024-10-31 22:19:23,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2024-10-31 22:19:23,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2024-10-31 22:19:23,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2024-10-31 22:19:23,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2024-10-31 22:19:23,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2024-10-31 22:19:23,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2024-10-31 22:19:23,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2024-10-31 22:19:23,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2024-10-31 22:19:23,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2024-10-31 22:19:23,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2024-10-31 22:19:23,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2024-10-31 22:19:23,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2024-10-31 22:19:23,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2024-10-31 22:19:23,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2024-10-31 22:19:23,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2024-10-31 22:19:23,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (30 of 71 remaining) [2024-10-31 22:19:23,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2024-10-31 22:19:23,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 71 remaining) [2024-10-31 22:19:23,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 71 remaining) [2024-10-31 22:19:23,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2024-10-31 22:19:23,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2024-10-31 22:19:23,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2024-10-31 22:19:23,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2024-10-31 22:19:23,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2024-10-31 22:19:23,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2024-10-31 22:19:23,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2024-10-31 22:19:23,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2024-10-31 22:19:23,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2024-10-31 22:19:23,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2024-10-31 22:19:23,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2024-10-31 22:19:23,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2024-10-31 22:19:23,554 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2024-10-31 22:19:23,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2024-10-31 22:19:23,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2024-10-31 22:19:23,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2024-10-31 22:19:23,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2024-10-31 22:19:23,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2024-10-31 22:19:23,555 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2024-10-31 22:19:23,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2024-10-31 22:19:23,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2024-10-31 22:19:23,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2024-10-31 22:19:23,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2024-10-31 22:19:23,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2024-10-31 22:19:23,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2024-10-31 22:19:23,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2024-10-31 22:19:23,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2024-10-31 22:19:23,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-31 22:19:23,557 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 22:19:23,563 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 22:19:23,563 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:19:23,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:19:23 BasicIcfg [2024-10-31 22:19:23,569 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:19:23,570 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:19:23,570 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:19:23,570 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:19:23,571 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:19:07" (3/4) ... [2024-10-31 22:19:23,573 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-10-31 22:19:23,577 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-31 22:19:23,577 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-31 22:19:23,577 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-31 22:19:23,583 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-31 22:19:23,583 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-31 22:19:23,584 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-31 22:19:23,584 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-31 22:19:23,693 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e9daa1-3968-4543-b434-8e332f8349c8/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 22:19:23,693 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e9daa1-3968-4543-b434-8e332f8349c8/bin/uautomizer-verify-4GaUIPS5ZU/witness.yml [2024-10-31 22:19:23,693 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:19:23,694 INFO L158 Benchmark]: Toolchain (without parser) took 17819.70ms. Allocated memory was 157.3MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 103.7MB in the beginning and 911.3MB in the end (delta: -807.7MB). Peak memory consumption was 168.7MB. Max. memory is 16.1GB. [2024-10-31 22:19:23,694 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 119.5MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:19:23,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.62ms. Allocated memory is still 157.3MB. Free memory was 103.5MB in the beginning and 89.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-31 22:19:23,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.96ms. Allocated memory is still 157.3MB. Free memory was 89.2MB in the beginning and 86.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:19:23,696 INFO L158 Benchmark]: Boogie Preprocessor took 54.09ms. Allocated memory is still 157.3MB. Free memory was 86.6MB in the beginning and 126.8MB in the end (delta: -40.2MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-10-31 22:19:23,696 INFO L158 Benchmark]: RCFGBuilder took 900.09ms. Allocated memory is still 157.3MB. Free memory was 126.8MB in the beginning and 97.9MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-31 22:19:23,696 INFO L158 Benchmark]: TraceAbstraction took 16242.72ms. Allocated memory was 157.3MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 97.2MB in the beginning and 917.6MB in the end (delta: -820.4MB). Peak memory consumption was 702.0MB. Max. memory is 16.1GB. [2024-10-31 22:19:23,697 INFO L158 Benchmark]: Witness Printer took 123.77ms. Allocated memory is still 1.1GB. Free memory was 917.6MB in the beginning and 911.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:19:23,699 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.23ms. Allocated memory is still 119.5MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.62ms. Allocated memory is still 157.3MB. Free memory was 103.5MB in the beginning and 89.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.96ms. Allocated memory is still 157.3MB. Free memory was 89.2MB in the beginning and 86.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.09ms. Allocated memory is still 157.3MB. Free memory was 86.6MB in the beginning and 126.8MB in the end (delta: -40.2MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * RCFGBuilder took 900.09ms. Allocated memory is still 157.3MB. Free memory was 126.8MB in the beginning and 97.9MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16242.72ms. Allocated memory was 157.3MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 97.2MB in the beginning and 917.6MB in the end (delta: -820.4MB). Peak memory consumption was 702.0MB. Max. memory is 16.1GB. * Witness Printer took 123.77ms. Allocated memory is still 1.1GB. Free memory was 917.6MB in the beginning and 911.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: 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, 620 locations, 71 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.0s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 512 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 660 IncrementalHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 104 mSDtfsCounter, 660 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=864occurred in iteration=21, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2446 NumberOfCodeBlocks, 2446 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2422 ConstructedInterpolants, 0 QuantifiedInterpolants, 2470 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 41 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-31 22:19:23,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00e9daa1-3968-4543-b434-8e332f8349c8/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