./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX --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 cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:03:55,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:03:55,861 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-08 18:03:55,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:03:55,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:03:55,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:03:55,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:03:55,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:03:55,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:03:55,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:03:55,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:03:55,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:03:55,916 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:03:55,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:03:55,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:03:55,917 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:03:55,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:03:55,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:03:55,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:03:55,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:03:55,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:03:55,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:03:55,928 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-08 18:03:55,928 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:03:55,928 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 18:03:55,929 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:03:55,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:03:55,929 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:03:55,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:03:55,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:03:55,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:03:55,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:03:55,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:03:55,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:03:55,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:03:55,931 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:03:55,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:03:55,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:03:55,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:03:55,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:03:55,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:03:55,935 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_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX/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_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX 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 -> cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e [2024-11-08 18:03:56,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:03:56,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:03:56,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:03:56,237 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:03:56,237 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:03:56,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c Unable to find full path for "g++" [2024-11-08 18:03:58,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:03:58,482 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:03:58,483 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2024-11-08 18:03:58,491 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX/data/380b7233f/1f01aaa3ce81452aac7772f65f9e95b5/FLAG2028d0497 [2024-11-08 18:03:58,503 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX/data/380b7233f/1f01aaa3ce81452aac7772f65f9e95b5 [2024-11-08 18:03:58,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:03:58,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:03:58,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:03:58,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:03:58,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:03:58,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:03:58" (1/1) ... [2024-11-08 18:03:58,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@117b7096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:03:58, skipping insertion in model container [2024-11-08 18:03:58,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:03:58" (1/1) ... [2024-11-08 18:03:58,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:03:58,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:03:58,795 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:03:58,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:03:58,864 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:03:58,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:03:58 WrapperNode [2024-11-08 18:03:58,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:03:58,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:03:58,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:03:58,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:03:58,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:03:58" (1/1) ... [2024-11-08 18:03:58,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:03:58" (1/1) ... [2024-11-08 18:03:58,931 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 14, calls inlined = 20, statements flattened = 350 [2024-11-08 18:03:58,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:03:58,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:03:58,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:03:58,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:03:58,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:03:58" (1/1) ... [2024-11-08 18:03:58,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:03:58" (1/1) ... [2024-11-08 18:03:58,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:03:58" (1/1) ... [2024-11-08 18:03:58,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:03:58" (1/1) ... [2024-11-08 18:03:58,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:03:58" (1/1) ... [2024-11-08 18:03:58,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:03:58" (1/1) ... [2024-11-08 18:03:58,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:03:58" (1/1) ... [2024-11-08 18:03:58,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:03:58" (1/1) ... [2024-11-08 18:03:58,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:03:58,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:03:58,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:03:58,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:03:58,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:03:58" (1/1) ... [2024-11-08 18:03:59,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:03:59,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:03:59,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:03:59,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:03:59,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:03:59,071 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-08 18:03:59,072 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-08 18:03:59,072 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-08 18:03:59,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-08 18:03:59,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-08 18:03:59,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-08 18:03:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 18:03:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 18:03:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 18:03:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 18:03:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 18:03:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:03:59,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:03:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 18:03:59,078 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 18:03:59,266 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:03:59,273 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:04:00,050 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 18:04:00,051 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:04:00,516 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:04:00,518 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 18:04:00,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:04:00 BoogieIcfgContainer [2024-11-08 18:04:00,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:04:00,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:04:00,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:04:00,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:04:00,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:03:58" (1/3) ... [2024-11-08 18:04:00,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e76c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:04:00, skipping insertion in model container [2024-11-08 18:04:00,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:03:58" (2/3) ... [2024-11-08 18:04:00,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e76c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:04:00, skipping insertion in model container [2024-11-08 18:04:00,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:04:00" (3/3) ... [2024-11-08 18:04:00,532 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2024-11-08 18:04:00,554 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:04:00,555 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-08 18:04:00,555 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 18:04:00,724 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-08 18:04:00,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 361 places, 371 transitions, 763 flow [2024-11-08 18:04:00,978 INFO L124 PetriNetUnfolderBase]: 20/368 cut-off events. [2024-11-08 18:04:00,979 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-08 18:04:00,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 368 events. 20/368 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 882 event pairs, 0 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 295. Up to 2 conditions per place. [2024-11-08 18:04:00,994 INFO L82 GeneralOperation]: Start removeDead. Operand has 361 places, 371 transitions, 763 flow [2024-11-08 18:04:01,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 339 places, 347 transitions, 712 flow [2024-11-08 18:04:01,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:04:01,031 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;@12e0ad3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:04:01,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2024-11-08 18:04:01,042 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 18:04:01,042 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-11-08 18:04:01,042 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 18:04:01,042 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:01,043 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] [2024-11-08 18:04:01,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:01,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:01,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1263949041, now seen corresponding path program 1 times [2024-11-08 18:04:01,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:01,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238651582] [2024-11-08 18:04:01,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:01,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:01,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:04:01,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:01,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238651582] [2024-11-08 18:04:01,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238651582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:01,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:01,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:04:01,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691894705] [2024-11-08 18:04:01,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:01,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:04:01,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:01,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:04:01,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:04:01,443 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 371 [2024-11-08 18:04:01,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 347 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:01,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:01,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 371 [2024-11-08 18:04:01,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:01,692 INFO L124 PetriNetUnfolderBase]: 33/691 cut-off events. [2024-11-08 18:04:01,692 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-08 18:04:01,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 691 events. 33/691 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3101 event pairs, 12 based on Foata normal form. 29/611 useless extension candidates. Maximal degree in co-relation 567. Up to 43 conditions per place. [2024-11-08 18:04:01,712 INFO L140 encePairwiseOnDemand]: 347/371 looper letters, 14 selfloop transitions, 2 changer transitions 3/325 dead transitions. [2024-11-08 18:04:01,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 325 transitions, 700 flow [2024-11-08 18:04:01,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:04:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:04:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1028 transitions. [2024-11-08 18:04:01,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9236298292902066 [2024-11-08 18:04:01,741 INFO L175 Difference]: Start difference. First operand has 339 places, 347 transitions, 712 flow. Second operand 3 states and 1028 transitions. [2024-11-08 18:04:01,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 325 transitions, 700 flow [2024-11-08 18:04:01,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 325 transitions, 688 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-08 18:04:01,758 INFO L231 Difference]: Finished difference. Result has 323 places, 322 transitions, 654 flow [2024-11-08 18:04:01,760 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=323, PETRI_TRANSITIONS=322} [2024-11-08 18:04:01,764 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -16 predicate places. [2024-11-08 18:04:01,765 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 322 transitions, 654 flow [2024-11-08 18:04:01,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:01,768 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:01,768 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] [2024-11-08 18:04:01,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:04:01,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:01,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:01,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1060760919, now seen corresponding path program 1 times [2024-11-08 18:04:01,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:01,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699973285] [2024-11-08 18:04:01,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:01,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:04:01,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:01,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699973285] [2024-11-08 18:04:01,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699973285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:01,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:01,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:04:01,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552201543] [2024-11-08 18:04:01,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:01,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:04:01,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:01,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:04:01,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:04:01,896 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 371 [2024-11-08 18:04:01,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 322 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:01,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:01,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 371 [2024-11-08 18:04:01,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:02,059 INFO L124 PetriNetUnfolderBase]: 24/637 cut-off events. [2024-11-08 18:04:02,059 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-08 18:04:02,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 637 events. 24/637 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2748 event pairs, 8 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 651. Up to 35 conditions per place. [2024-11-08 18:04:02,070 INFO L140 encePairwiseOnDemand]: 368/371 looper letters, 14 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2024-11-08 18:04:02,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 321 transitions, 684 flow [2024-11-08 18:04:02,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:04:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:04:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1007 transitions. [2024-11-08 18:04:02,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-08 18:04:02,075 INFO L175 Difference]: Start difference. First operand has 323 places, 322 transitions, 654 flow. Second operand 3 states and 1007 transitions. [2024-11-08 18:04:02,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 321 transitions, 684 flow [2024-11-08 18:04:02,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 321 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:04:02,108 INFO L231 Difference]: Finished difference. Result has 319 places, 321 transitions, 652 flow [2024-11-08 18:04:02,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=319, PETRI_TRANSITIONS=321} [2024-11-08 18:04:02,109 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -20 predicate places. [2024-11-08 18:04:02,109 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 321 transitions, 652 flow [2024-11-08 18:04:02,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:02,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:02,113 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] [2024-11-08 18:04:02,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:04:02,113 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:02,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:02,114 INFO L85 PathProgramCache]: Analyzing trace with hash 218715041, now seen corresponding path program 1 times [2024-11-08 18:04:02,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:02,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476866291] [2024-11-08 18:04:02,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:02,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:02,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:04:02,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:02,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476866291] [2024-11-08 18:04:02,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476866291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:02,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:02,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:04:02,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460627508] [2024-11-08 18:04:02,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:02,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:04:02,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:02,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:04:02,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:04:02,195 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 371 [2024-11-08 18:04:02,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 321 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:02,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:02,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 371 [2024-11-08 18:04:02,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:02,360 INFO L124 PetriNetUnfolderBase]: 36/598 cut-off events. [2024-11-08 18:04:02,360 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-08 18:04:02,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 598 events. 36/598 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2516 event pairs, 16 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 627. Up to 56 conditions per place. [2024-11-08 18:04:02,370 INFO L140 encePairwiseOnDemand]: 366/371 looper letters, 15 selfloop transitions, 1 changer transitions 0/317 dead transitions. [2024-11-08 18:04:02,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 317 transitions, 676 flow [2024-11-08 18:04:02,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:04:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:04:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1004 transitions. [2024-11-08 18:04:02,374 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9020664869721473 [2024-11-08 18:04:02,374 INFO L175 Difference]: Start difference. First operand has 319 places, 321 transitions, 652 flow. Second operand 3 states and 1004 transitions. [2024-11-08 18:04:02,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 317 transitions, 676 flow [2024-11-08 18:04:02,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 317 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:04:02,381 INFO L231 Difference]: Finished difference. Result has 315 places, 317 transitions, 642 flow [2024-11-08 18:04:02,382 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=315, PETRI_TRANSITIONS=317} [2024-11-08 18:04:02,383 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -24 predicate places. [2024-11-08 18:04:02,383 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 317 transitions, 642 flow [2024-11-08 18:04:02,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:02,384 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:02,384 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] [2024-11-08 18:04:02,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:04:02,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:02,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:02,385 INFO L85 PathProgramCache]: Analyzing trace with hash -511456340, now seen corresponding path program 1 times [2024-11-08 18:04:02,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:02,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791623259] [2024-11-08 18:04:02,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:02,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:04:02,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:02,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791623259] [2024-11-08 18:04:02,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791623259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:02,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:02,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:04:02,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626446946] [2024-11-08 18:04:02,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:02,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:04:02,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:02,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:04:02,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:04:02,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 371 [2024-11-08 18:04:02,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 317 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:02,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:02,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 371 [2024-11-08 18:04:02,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:02,689 INFO L124 PetriNetUnfolderBase]: 58/678 cut-off events. [2024-11-08 18:04:02,690 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-08 18:04:02,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 678 events. 58/678 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3246 event pairs, 38 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 737. Up to 81 conditions per place. [2024-11-08 18:04:02,698 INFO L140 encePairwiseOnDemand]: 368/371 looper letters, 14 selfloop transitions, 2 changer transitions 0/316 dead transitions. [2024-11-08 18:04:02,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 316 transitions, 672 flow [2024-11-08 18:04:02,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:04:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:04:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1007 transitions. [2024-11-08 18:04:02,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-08 18:04:02,702 INFO L175 Difference]: Start difference. First operand has 315 places, 317 transitions, 642 flow. Second operand 3 states and 1007 transitions. [2024-11-08 18:04:02,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 316 transitions, 672 flow [2024-11-08 18:04:02,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 316 transitions, 671 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:04:02,708 INFO L231 Difference]: Finished difference. Result has 315 places, 316 transitions, 643 flow [2024-11-08 18:04:02,709 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=643, PETRI_PLACES=315, PETRI_TRANSITIONS=316} [2024-11-08 18:04:02,710 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -24 predicate places. [2024-11-08 18:04:02,710 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 316 transitions, 643 flow [2024-11-08 18:04:02,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:02,711 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:02,711 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] [2024-11-08 18:04:02,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:04:02,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:02,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:02,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1865904293, now seen corresponding path program 1 times [2024-11-08 18:04:02,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:02,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904846244] [2024-11-08 18:04:02,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:02,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:04:03,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:03,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904846244] [2024-11-08 18:04:03,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904846244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:03,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:03,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:04:03,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704951443] [2024-11-08 18:04:03,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:03,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:04:03,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:03,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:04:03,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:04:03,668 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 371 [2024-11-08 18:04:03,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 316 transitions, 643 flow. Second operand has 6 states, 6 states have (on average 312.5) internal successors, (1875), 6 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:03,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:03,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 371 [2024-11-08 18:04:03,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:04,509 INFO L124 PetriNetUnfolderBase]: 541/3435 cut-off events. [2024-11-08 18:04:04,510 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-11-08 18:04:04,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4322 conditions, 3435 events. 541/3435 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 28286 event pairs, 386 based on Foata normal form. 0/2874 useless extension candidates. Maximal degree in co-relation 4283. Up to 786 conditions per place. [2024-11-08 18:04:04,544 INFO L140 encePairwiseOnDemand]: 365/371 looper letters, 31 selfloop transitions, 5 changer transitions 0/315 dead transitions. [2024-11-08 18:04:04,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 315 transitions, 713 flow [2024-11-08 18:04:04,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:04:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 18:04:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1903 transitions. [2024-11-08 18:04:04,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8548966756513926 [2024-11-08 18:04:04,549 INFO L175 Difference]: Start difference. First operand has 315 places, 316 transitions, 643 flow. Second operand 6 states and 1903 transitions. [2024-11-08 18:04:04,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 315 transitions, 713 flow [2024-11-08 18:04:04,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 315 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:04:04,555 INFO L231 Difference]: Finished difference. Result has 317 places, 315 transitions, 647 flow [2024-11-08 18:04:04,556 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=647, PETRI_PLACES=317, PETRI_TRANSITIONS=315} [2024-11-08 18:04:04,558 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -22 predicate places. [2024-11-08 18:04:04,558 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 315 transitions, 647 flow [2024-11-08 18:04:04,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 312.5) internal successors, (1875), 6 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:04,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:04,560 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] [2024-11-08 18:04:04,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:04:04,560 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:04,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:04,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1610655486, now seen corresponding path program 1 times [2024-11-08 18:04:04,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:04,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864311074] [2024-11-08 18:04:04,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:04,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:04:04,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:04,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864311074] [2024-11-08 18:04:04,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864311074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:04,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:04,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:04:04,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916211461] [2024-11-08 18:04:04,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:04,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:04:04,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:04,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:04:04,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:04:04,652 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 371 [2024-11-08 18:04:04,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 315 transitions, 647 flow. Second operand has 3 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:04,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:04,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 371 [2024-11-08 18:04:04,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:04,789 INFO L124 PetriNetUnfolderBase]: 53/651 cut-off events. [2024-11-08 18:04:04,789 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-08 18:04:04,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 651 events. 53/651 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2889 event pairs, 28 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 721. Up to 73 conditions per place. [2024-11-08 18:04:04,799 INFO L140 encePairwiseOnDemand]: 366/371 looper letters, 15 selfloop transitions, 1 changer transitions 0/311 dead transitions. [2024-11-08 18:04:04,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 311 transitions, 671 flow [2024-11-08 18:04:04,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:04:04,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:04:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1004 transitions. [2024-11-08 18:04:04,802 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9020664869721473 [2024-11-08 18:04:04,802 INFO L175 Difference]: Start difference. First operand has 317 places, 315 transitions, 647 flow. Second operand 3 states and 1004 transitions. [2024-11-08 18:04:04,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 311 transitions, 671 flow [2024-11-08 18:04:04,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 311 transitions, 661 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-08 18:04:04,808 INFO L231 Difference]: Finished difference. Result has 310 places, 311 transitions, 631 flow [2024-11-08 18:04:04,809 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=310, PETRI_TRANSITIONS=311} [2024-11-08 18:04:04,809 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -29 predicate places. [2024-11-08 18:04:04,810 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 311 transitions, 631 flow [2024-11-08 18:04:04,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.0) internal successors, (987), 3 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:04,811 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:04,811 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] [2024-11-08 18:04:04,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:04:04,811 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:04,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:04,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1176034970, now seen corresponding path program 1 times [2024-11-08 18:04:04,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:04,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005538573] [2024-11-08 18:04:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:04,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:04:04,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:04,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005538573] [2024-11-08 18:04:04,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005538573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:04,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:04,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:04:04,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630163306] [2024-11-08 18:04:04,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:04,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:04:04,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:04,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:04:04,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:04:04,897 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 371 [2024-11-08 18:04:04,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 311 transitions, 631 flow. Second operand has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:04,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:04,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 371 [2024-11-08 18:04:04,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:05,063 INFO L124 PetriNetUnfolderBase]: 33/548 cut-off events. [2024-11-08 18:04:05,063 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-08 18:04:05,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 548 events. 33/548 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2185 event pairs, 5 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 580. Up to 33 conditions per place. [2024-11-08 18:04:05,071 INFO L140 encePairwiseOnDemand]: 365/371 looper letters, 14 selfloop transitions, 3 changer transitions 0/311 dead transitions. [2024-11-08 18:04:05,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 311 transitions, 667 flow [2024-11-08 18:04:05,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:04:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:04:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1013 transitions. [2024-11-08 18:04:05,074 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9101527403414196 [2024-11-08 18:04:05,074 INFO L175 Difference]: Start difference. First operand has 310 places, 311 transitions, 631 flow. Second operand 3 states and 1013 transitions. [2024-11-08 18:04:05,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 311 transitions, 667 flow [2024-11-08 18:04:05,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 311 transitions, 666 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:04:05,080 INFO L231 Difference]: Finished difference. Result has 308 places, 308 transitions, 630 flow [2024-11-08 18:04:05,081 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=308, PETRI_TRANSITIONS=308} [2024-11-08 18:04:05,081 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -31 predicate places. [2024-11-08 18:04:05,082 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 308 transitions, 630 flow [2024-11-08 18:04:05,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:05,083 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:05,083 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] [2024-11-08 18:04:05,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:04:05,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:05,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:05,084 INFO L85 PathProgramCache]: Analyzing trace with hash -593170392, now seen corresponding path program 1 times [2024-11-08 18:04:05,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:05,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782269426] [2024-11-08 18:04:05,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:05,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:04:05,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:05,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782269426] [2024-11-08 18:04:05,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782269426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:05,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:05,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:04:05,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405761242] [2024-11-08 18:04:05,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:05,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:04:05,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:05,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:04:05,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:04:05,164 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 371 [2024-11-08 18:04:05,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 308 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:05,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:05,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 371 [2024-11-08 18:04:05,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:05,588 INFO L124 PetriNetUnfolderBase]: 237/2177 cut-off events. [2024-11-08 18:04:05,588 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-08 18:04:05,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2554 conditions, 2177 events. 237/2177 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 15622 event pairs, 61 based on Foata normal form. 0/1917 useless extension candidates. Maximal degree in co-relation 2515. Up to 305 conditions per place. [2024-11-08 18:04:05,610 INFO L140 encePairwiseOnDemand]: 364/371 looper letters, 21 selfloop transitions, 3 changer transitions 0/312 dead transitions. [2024-11-08 18:04:05,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 312 transitions, 691 flow [2024-11-08 18:04:05,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:04:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:04:05,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2024-11-08 18:04:05,613 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9092542677448338 [2024-11-08 18:04:05,613 INFO L175 Difference]: Start difference. First operand has 308 places, 308 transitions, 630 flow. Second operand 3 states and 1012 transitions. [2024-11-08 18:04:05,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 312 transitions, 691 flow [2024-11-08 18:04:05,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 312 transitions, 685 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:04:05,619 INFO L231 Difference]: Finished difference. Result has 305 places, 307 transitions, 637 flow [2024-11-08 18:04:05,620 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=637, PETRI_PLACES=305, PETRI_TRANSITIONS=307} [2024-11-08 18:04:05,621 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -34 predicate places. [2024-11-08 18:04:05,621 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 307 transitions, 637 flow [2024-11-08 18:04:05,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:05,622 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:05,622 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] [2024-11-08 18:04:05,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:04:05,622 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:05,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:05,623 INFO L85 PathProgramCache]: Analyzing trace with hash 11901153, now seen corresponding path program 1 times [2024-11-08 18:04:05,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:05,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693260950] [2024-11-08 18:04:05,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:05,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:05,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:04:05,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:05,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693260950] [2024-11-08 18:04:05,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693260950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:05,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:05,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:04:05,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588298106] [2024-11-08 18:04:05,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:05,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:04:05,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:05,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:04:05,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:04:05,689 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 371 [2024-11-08 18:04:05,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 307 transitions, 637 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:05,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:05,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 371 [2024-11-08 18:04:05,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:05,888 INFO L124 PetriNetUnfolderBase]: 122/968 cut-off events. [2024-11-08 18:04:05,888 INFO L125 PetriNetUnfolderBase]: For 81/91 co-relation queries the response was YES. [2024-11-08 18:04:05,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 968 events. 122/968 cut-off events. For 81/91 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5393 event pairs, 12 based on Foata normal form. 0/873 useless extension candidates. Maximal degree in co-relation 1198. Up to 116 conditions per place. [2024-11-08 18:04:05,901 INFO L140 encePairwiseOnDemand]: 364/371 looper letters, 18 selfloop transitions, 3 changer transitions 0/307 dead transitions. [2024-11-08 18:04:05,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 307 transitions, 686 flow [2024-11-08 18:04:05,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:04:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:04:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1007 transitions. [2024-11-08 18:04:05,904 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-08 18:04:05,904 INFO L175 Difference]: Start difference. First operand has 305 places, 307 transitions, 637 flow. Second operand 3 states and 1007 transitions. [2024-11-08 18:04:05,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 307 transitions, 686 flow [2024-11-08 18:04:05,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 307 transitions, 686 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 18:04:05,910 INFO L231 Difference]: Finished difference. Result has 303 places, 303 transitions, 635 flow [2024-11-08 18:04:05,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=635, PETRI_PLACES=303, PETRI_TRANSITIONS=303} [2024-11-08 18:04:05,911 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -36 predicate places. [2024-11-08 18:04:05,911 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 303 transitions, 635 flow [2024-11-08 18:04:05,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:05,912 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:05,913 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] [2024-11-08 18:04:05,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:04:05,913 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:05,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:05,913 INFO L85 PathProgramCache]: Analyzing trace with hash -446695412, now seen corresponding path program 1 times [2024-11-08 18:04:05,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:05,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35770411] [2024-11-08 18:04:05,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:05,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:04:06,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:06,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35770411] [2024-11-08 18:04:06,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35770411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:06,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:06,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:04:06,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891883813] [2024-11-08 18:04:06,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:06,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:04:06,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:06,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:04:06,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:04:06,359 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 371 [2024-11-08 18:04:06,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 303 transitions, 635 flow. Second operand has 7 states, 7 states have (on average 326.85714285714283) internal successors, (2288), 7 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:06,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:06,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 371 [2024-11-08 18:04:06,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:06,773 INFO L124 PetriNetUnfolderBase]: 111/1118 cut-off events. [2024-11-08 18:04:06,773 INFO L125 PetriNetUnfolderBase]: For 68/114 co-relation queries the response was YES. [2024-11-08 18:04:06,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 1118 events. 111/1118 cut-off events. For 68/114 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6217 event pairs, 34 based on Foata normal form. 6/1023 useless extension candidates. Maximal degree in co-relation 1384. Up to 106 conditions per place. [2024-11-08 18:04:06,790 INFO L140 encePairwiseOnDemand]: 357/371 looper letters, 29 selfloop transitions, 15 changer transitions 0/323 dead transitions. [2024-11-08 18:04:06,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 323 transitions, 781 flow [2024-11-08 18:04:06,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:04:06,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-08 18:04:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3292 transitions. [2024-11-08 18:04:06,797 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8873315363881401 [2024-11-08 18:04:06,797 INFO L175 Difference]: Start difference. First operand has 303 places, 303 transitions, 635 flow. Second operand 10 states and 3292 transitions. [2024-11-08 18:04:06,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 323 transitions, 781 flow [2024-11-08 18:04:06,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 323 transitions, 775 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:04:06,805 INFO L231 Difference]: Finished difference. Result has 314 places, 311 transitions, 703 flow [2024-11-08 18:04:06,806 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=703, PETRI_PLACES=314, PETRI_TRANSITIONS=311} [2024-11-08 18:04:06,806 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -25 predicate places. [2024-11-08 18:04:06,807 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 311 transitions, 703 flow [2024-11-08 18:04:06,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 326.85714285714283) internal successors, (2288), 7 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:06,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:06,810 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] [2024-11-08 18:04:06,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:04:06,810 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:06,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:06,811 INFO L85 PathProgramCache]: Analyzing trace with hash 369749127, now seen corresponding path program 1 times [2024-11-08 18:04:06,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:06,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521838592] [2024-11-08 18:04:06,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:06,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:06,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:04:06,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:06,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521838592] [2024-11-08 18:04:06,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521838592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:06,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:06,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:04:06,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429386939] [2024-11-08 18:04:06,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:06,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:04:06,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:06,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:04:06,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:04:07,063 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 371 [2024-11-08 18:04:07,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 311 transitions, 703 flow. Second operand has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:07,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:07,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 371 [2024-11-08 18:04:07,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:07,491 INFO L124 PetriNetUnfolderBase]: 223/2088 cut-off events. [2024-11-08 18:04:07,491 INFO L125 PetriNetUnfolderBase]: For 185/201 co-relation queries the response was YES. [2024-11-08 18:04:07,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2699 conditions, 2088 events. 223/2088 cut-off events. For 185/201 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 14627 event pairs, 68 based on Foata normal form. 11/1915 useless extension candidates. Maximal degree in co-relation 2649. Up to 218 conditions per place. [2024-11-08 18:04:07,517 INFO L140 encePairwiseOnDemand]: 365/371 looper letters, 30 selfloop transitions, 5 changer transitions 0/326 dead transitions. [2024-11-08 18:04:07,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 326 transitions, 821 flow [2024-11-08 18:04:07,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:04:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 18:04:07,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1673 transitions. [2024-11-08 18:04:07,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9018867924528302 [2024-11-08 18:04:07,522 INFO L175 Difference]: Start difference. First operand has 314 places, 311 transitions, 703 flow. Second operand 5 states and 1673 transitions. [2024-11-08 18:04:07,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 326 transitions, 821 flow [2024-11-08 18:04:07,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 326 transitions, 817 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:04:07,528 INFO L231 Difference]: Finished difference. Result has 319 places, 313 transitions, 724 flow [2024-11-08 18:04:07,529 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=724, PETRI_PLACES=319, PETRI_TRANSITIONS=313} [2024-11-08 18:04:07,530 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -20 predicate places. [2024-11-08 18:04:07,530 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 313 transitions, 724 flow [2024-11-08 18:04:07,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:07,531 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:07,531 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] [2024-11-08 18:04:07,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:04:07,532 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:07,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:07,532 INFO L85 PathProgramCache]: Analyzing trace with hash -419327691, now seen corresponding path program 1 times [2024-11-08 18:04:07,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:07,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696381523] [2024-11-08 18:04:07,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:07,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:04:08,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:08,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696381523] [2024-11-08 18:04:08,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696381523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:08,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:08,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:04:08,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103619333] [2024-11-08 18:04:08,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:08,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:04:08,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:08,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:04:08,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:04:08,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 371 [2024-11-08 18:04:08,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 313 transitions, 724 flow. Second operand has 6 states, 6 states have (on average 321.6666666666667) internal successors, (1930), 6 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:08,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:08,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 371 [2024-11-08 18:04:08,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:08,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1295] L64-->L67: Formula: (let ((.cse13 (* |v_thread3Thread1of1ForFork1_~i~2#1_15| 4))) (let ((.cse9 (+ .cse13 v_~A~0.offset_222))) (let ((.cse10 (select (select |v_#memory_int_124| v_~A~0.base_222) .cse9))) (let ((.cse3 (+ v_~mts3~0_159 .cse10))) (let ((.cse12 (<= .cse3 2147483647)) (.cse6 (select |v_#race_453| v_~A~0.base_222)) (.cse8 (+ .cse13 v_~A~0.offset_222 1)) (.cse7 (+ .cse13 v_~A~0.offset_222 2)) (.cse1 (+ .cse13 v_~A~0.offset_222 3)) (.cse11 (<= 0 (+ v_~mts3~0_159 2147483648 .cse10))) (.cse0 (select |v_#race_441| v_~A~0.base_222))) (and (= (select .cse0 .cse1) 0) (let ((.cse2 (= |v_#race~A~0_277| 0)) (.cse4 (= |v_#race_453| (store |v_#race_442| v_~A~0.base_222 (store (store (store (store (select |v_#race_442| v_~A~0.base_222) .cse9 0) .cse8 0) .cse7 0) .cse1 0)))) (.cse5 (= |v_#race~mts3~0_254| 0))) (or (and .cse2 (= v_~mts3~0_158 0) (< .cse3 0) .cse4 (= |v_thread3Thread1of1ForFork1_#t~mem15#1_13| |v_thread3_#t~mem15#1_180|) .cse5) (and (= (select .cse6 .cse7) 0) (<= 0 .cse3) .cse2 (= (select .cse6 .cse8) 0) .cse4 (= (select .cse6 .cse1) 0) (= (+ |v_thread3_#t~mem15#1_180| v_~mts3~0_159) v_~mts3~0_158) .cse5 (= (select .cse6 .cse9) 0) (= |v_thread3_#t~mem15#1_180| .cse10)))) (<= 0 (+ v_~sum~0_93 2147483648)) (= (select .cse0 .cse8) 0) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483648)) (<= v_~sum~0_94 |v_thread3Thread1of1ForFork1_plus_#res#1_17|)) 1 0) 0)) .cse11 (<= v_~sum~0_93 2147483647) (= v_~sum~0_93 |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (not (= (ite (or (<= .cse10 0) .cse12) 1 0) 0)) (= (select .cse0 .cse7) 0) .cse12 (= (+ v_~sum~0_94 .cse10) |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (= (store |v_#race_453| v_~A~0.base_222 (store (store (store (store .cse6 .cse9 0) .cse8 0) .cse7 0) .cse1 0)) |v_#race_441|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| v_~sum~0_94)) 1 0) 0)) (not (= (ite (or .cse11 (<= 0 .cse10)) 1 0) 0)) (= (select .cse0 .cse9) 0) (= |v_#race~A~0_267| 0))))))) InVars {~sum~0=v_~sum~0_94, #race=|v_#race_442|, ~A~0.base=v_~A~0.base_222, ~mts3~0=v_~mts3~0_159, ~A~0.offset=v_~A~0.offset_222, #memory_int=|v_#memory_int_124|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, thread3Thread1of1ForFork1_#t~mem15#1=|v_thread3Thread1of1ForFork1_#t~mem15#1_13|} OutVars{~A~0.base=v_~A~0.base_222, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_17|, thread3Thread1of1ForFork1_#t~ite16#1=|v_thread3Thread1of1ForFork1_#t~ite16#1_11|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, ~sum~0=v_~sum~0_93, #race~mts3~0=|v_#race~mts3~0_243|, ~mts3~0=v_~mts3~0_158, thread3Thread1of1ForFork1_#t~nondet17#1=|v_thread3Thread1of1ForFork1_#t~nondet17#1_11|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_17|, #race~sum~0=|v_#race~sum~0_123|, #race=|v_#race_441|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_17|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_19|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_17|, ~A~0.offset=v_~A~0.offset_222, thread3Thread1of1ForFork1_#t~ret19#1=|v_thread3Thread1of1ForFork1_#t~ret19#1_3|, #memory_int=|v_#memory_int_124|, thread3Thread1of1ForFork1_#t~mem18#1=|v_thread3Thread1of1ForFork1_#t~mem18#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_17|, thread3Thread1of1ForFork1_#t~nondet20#1=|v_thread3Thread1of1ForFork1_#t~nondet20#1_3|, #race~A~0=|v_#race~A~0_267|} AuxVars[|v_thread3_#t~mem15#1_180|, |v_#race_453|, |v_#race~mts3~0_254|, |v_#race~A~0_277|] AssignedVars[#race, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ite16#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem15#1, ~sum~0, #race~mts3~0, ~mts3~0, thread3Thread1of1ForFork1_#t~nondet17#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_#t~ret19#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem18#1, #race~sum~0, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~nondet20#1, #race~A~0][181], [83#L59true, Black: 420#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 419#(<= (+ ~M~0 1) 0), Black: 388#true, 208#L48-3true, 194#L67true, 390#(= |#race~A~0| 0), 372#(= |#race~N~0| 0), 423#true, 206#L86-4true, 416#true, 384#(= |#race~M~0| 0), Black: 400#(<= ~N~0 0), Black: 407#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 405#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 401#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0))]) [2024-11-08 18:04:08,899 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2024-11-08 18:04:08,899 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-11-08 18:04:08,899 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-08 18:04:08,899 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-08 18:04:08,975 INFO L124 PetriNetUnfolderBase]: 408/2437 cut-off events. [2024-11-08 18:04:08,976 INFO L125 PetriNetUnfolderBase]: For 451/465 co-relation queries the response was YES. [2024-11-08 18:04:08,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3524 conditions, 2437 events. 408/2437 cut-off events. For 451/465 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 18123 event pairs, 71 based on Foata normal form. 0/2212 useless extension candidates. Maximal degree in co-relation 3475. Up to 281 conditions per place. [2024-11-08 18:04:09,002 INFO L140 encePairwiseOnDemand]: 364/371 looper letters, 36 selfloop transitions, 5 changer transitions 0/323 dead transitions. [2024-11-08 18:04:09,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 323 transitions, 842 flow [2024-11-08 18:04:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:04:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 18:04:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1960 transitions. [2024-11-08 18:04:09,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8805031446540881 [2024-11-08 18:04:09,007 INFO L175 Difference]: Start difference. First operand has 319 places, 313 transitions, 724 flow. Second operand 6 states and 1960 transitions. [2024-11-08 18:04:09,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 323 transitions, 842 flow [2024-11-08 18:04:09,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 323 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 18:04:09,014 INFO L231 Difference]: Finished difference. Result has 320 places, 311 transitions, 725 flow [2024-11-08 18:04:09,014 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=725, PETRI_PLACES=320, PETRI_TRANSITIONS=311} [2024-11-08 18:04:09,015 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -19 predicate places. [2024-11-08 18:04:09,015 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 311 transitions, 725 flow [2024-11-08 18:04:09,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 321.6666666666667) internal successors, (1930), 6 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:09,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:09,016 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-11-08 18:04:09,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:04:09,017 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:09,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:09,017 INFO L85 PathProgramCache]: Analyzing trace with hash 458433111, now seen corresponding path program 1 times [2024-11-08 18:04:09,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:09,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888013817] [2024-11-08 18:04:09,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:09,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 18:04:09,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:09,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888013817] [2024-11-08 18:04:09,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888013817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:09,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:09,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:04:09,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800451025] [2024-11-08 18:04:09,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:09,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:04:09,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:09,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:04:09,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:04:09,745 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 371 [2024-11-08 18:04:09,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 311 transitions, 725 flow. Second operand has 6 states, 6 states have (on average 322.1666666666667) internal successors, (1933), 6 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:09,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:09,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 371 [2024-11-08 18:04:09,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:10,296 INFO L124 PetriNetUnfolderBase]: 253/1805 cut-off events. [2024-11-08 18:04:10,296 INFO L125 PetriNetUnfolderBase]: For 240/320 co-relation queries the response was YES. [2024-11-08 18:04:10,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2673 conditions, 1805 events. 253/1805 cut-off events. For 240/320 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12892 event pairs, 50 based on Foata normal form. 4/1684 useless extension candidates. Maximal degree in co-relation 2624. Up to 221 conditions per place. [2024-11-08 18:04:10,322 INFO L140 encePairwiseOnDemand]: 364/371 looper letters, 36 selfloop transitions, 5 changer transitions 0/321 dead transitions. [2024-11-08 18:04:10,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 321 transitions, 843 flow [2024-11-08 18:04:10,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:04:10,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 18:04:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1960 transitions. [2024-11-08 18:04:10,327 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8805031446540881 [2024-11-08 18:04:10,327 INFO L175 Difference]: Start difference. First operand has 320 places, 311 transitions, 725 flow. Second operand 6 states and 1960 transitions. [2024-11-08 18:04:10,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 321 transitions, 843 flow [2024-11-08 18:04:10,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 321 transitions, 833 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-08 18:04:10,334 INFO L231 Difference]: Finished difference. Result has 318 places, 309 transitions, 721 flow [2024-11-08 18:04:10,335 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=721, PETRI_PLACES=318, PETRI_TRANSITIONS=309} [2024-11-08 18:04:10,335 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -21 predicate places. [2024-11-08 18:04:10,336 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 309 transitions, 721 flow [2024-11-08 18:04:10,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 322.1666666666667) internal successors, (1933), 6 states have internal predecessors, (1933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:10,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:10,337 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] [2024-11-08 18:04:10,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:04:10,338 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:10,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:10,338 INFO L85 PathProgramCache]: Analyzing trace with hash -499558676, now seen corresponding path program 1 times [2024-11-08 18:04:10,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:10,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588503920] [2024-11-08 18:04:10,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:10,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:04:10,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:10,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588503920] [2024-11-08 18:04:10,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588503920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:10,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:10,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:04:10,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34831224] [2024-11-08 18:04:10,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:10,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:04:10,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:10,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:04:10,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:04:10,395 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 371 [2024-11-08 18:04:10,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 309 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 337.6666666666667) internal successors, (1013), 3 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:10,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:10,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 371 [2024-11-08 18:04:10,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:10,650 INFO L124 PetriNetUnfolderBase]: 75/1187 cut-off events. [2024-11-08 18:04:10,650 INFO L125 PetriNetUnfolderBase]: For 74/96 co-relation queries the response was YES. [2024-11-08 18:04:10,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 1187 events. 75/1187 cut-off events. For 74/96 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6802 event pairs, 11 based on Foata normal form. 8/1130 useless extension candidates. Maximal degree in co-relation 1466. Up to 99 conditions per place. [2024-11-08 18:04:10,661 INFO L140 encePairwiseOnDemand]: 368/371 looper letters, 9 selfloop transitions, 1 changer transitions 2/307 dead transitions. [2024-11-08 18:04:10,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 307 transitions, 739 flow [2024-11-08 18:04:10,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:04:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:04:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1017 transitions. [2024-11-08 18:04:10,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9137466307277629 [2024-11-08 18:04:10,664 INFO L175 Difference]: Start difference. First operand has 318 places, 309 transitions, 721 flow. Second operand 3 states and 1017 transitions. [2024-11-08 18:04:10,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 307 transitions, 739 flow [2024-11-08 18:04:10,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 307 transitions, 729 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-08 18:04:10,670 INFO L231 Difference]: Finished difference. Result has 313 places, 305 transitions, 705 flow [2024-11-08 18:04:10,671 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=313, PETRI_TRANSITIONS=305} [2024-11-08 18:04:10,671 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -26 predicate places. [2024-11-08 18:04:10,671 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 305 transitions, 705 flow [2024-11-08 18:04:10,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 337.6666666666667) internal successors, (1013), 3 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:10,672 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:10,672 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] [2024-11-08 18:04:10,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 18:04:10,672 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:10,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:10,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1859300217, now seen corresponding path program 1 times [2024-11-08 18:04:10,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:10,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704647684] [2024-11-08 18:04:10,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:10,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:04:10,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:10,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704647684] [2024-11-08 18:04:10,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704647684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:10,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:10,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:04:10,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025277509] [2024-11-08 18:04:10,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:10,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:04:10,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:10,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:04:10,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:04:10,723 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 371 [2024-11-08 18:04:10,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 305 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 337.6666666666667) internal successors, (1013), 3 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:10,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:10,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 371 [2024-11-08 18:04:10,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:10,939 INFO L124 PetriNetUnfolderBase]: 75/1155 cut-off events. [2024-11-08 18:04:10,939 INFO L125 PetriNetUnfolderBase]: For 74/96 co-relation queries the response was YES. [2024-11-08 18:04:10,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1460 conditions, 1155 events. 75/1155 cut-off events. For 74/96 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6514 event pairs, 11 based on Foata normal form. 8/1114 useless extension candidates. Maximal degree in co-relation 1412. Up to 99 conditions per place. [2024-11-08 18:04:10,951 INFO L140 encePairwiseOnDemand]: 368/371 looper letters, 6 selfloop transitions, 0 changer transitions 14/303 dead transitions. [2024-11-08 18:04:10,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 303 transitions, 723 flow [2024-11-08 18:04:10,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:04:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:04:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1017 transitions. [2024-11-08 18:04:10,954 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9137466307277629 [2024-11-08 18:04:10,955 INFO L175 Difference]: Start difference. First operand has 313 places, 305 transitions, 705 flow. Second operand 3 states and 1017 transitions. [2024-11-08 18:04:10,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 303 transitions, 723 flow [2024-11-08 18:04:10,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 303 transitions, 722 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 18:04:10,960 INFO L231 Difference]: Finished difference. Result has 310 places, 289 transitions, 669 flow [2024-11-08 18:04:10,961 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=310, PETRI_TRANSITIONS=289} [2024-11-08 18:04:10,962 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -29 predicate places. [2024-11-08 18:04:10,962 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 289 transitions, 669 flow [2024-11-08 18:04:10,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 337.6666666666667) internal successors, (1013), 3 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:10,963 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:10,963 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] [2024-11-08 18:04:10,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:04:10,963 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:10,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:10,963 INFO L85 PathProgramCache]: Analyzing trace with hash 582484203, now seen corresponding path program 1 times [2024-11-08 18:04:10,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:10,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209250169] [2024-11-08 18:04:10,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:10,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:04:11,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:11,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209250169] [2024-11-08 18:04:11,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209250169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:11,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:11,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:04:11,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893577417] [2024-11-08 18:04:11,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:11,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:04:11,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:11,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:04:11,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:04:11,036 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 371 [2024-11-08 18:04:11,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 289 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:11,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:11,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 371 [2024-11-08 18:04:11,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:11,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1295] L64-->L67: Formula: (let ((.cse13 (* |v_thread3Thread1of1ForFork1_~i~2#1_15| 4))) (let ((.cse9 (+ .cse13 v_~A~0.offset_222))) (let ((.cse10 (select (select |v_#memory_int_124| v_~A~0.base_222) .cse9))) (let ((.cse3 (+ v_~mts3~0_159 .cse10))) (let ((.cse12 (<= .cse3 2147483647)) (.cse6 (select |v_#race_453| v_~A~0.base_222)) (.cse8 (+ .cse13 v_~A~0.offset_222 1)) (.cse7 (+ .cse13 v_~A~0.offset_222 2)) (.cse1 (+ .cse13 v_~A~0.offset_222 3)) (.cse11 (<= 0 (+ v_~mts3~0_159 2147483648 .cse10))) (.cse0 (select |v_#race_441| v_~A~0.base_222))) (and (= (select .cse0 .cse1) 0) (let ((.cse2 (= |v_#race~A~0_277| 0)) (.cse4 (= |v_#race_453| (store |v_#race_442| v_~A~0.base_222 (store (store (store (store (select |v_#race_442| v_~A~0.base_222) .cse9 0) .cse8 0) .cse7 0) .cse1 0)))) (.cse5 (= |v_#race~mts3~0_254| 0))) (or (and .cse2 (= v_~mts3~0_158 0) (< .cse3 0) .cse4 (= |v_thread3Thread1of1ForFork1_#t~mem15#1_13| |v_thread3_#t~mem15#1_180|) .cse5) (and (= (select .cse6 .cse7) 0) (<= 0 .cse3) .cse2 (= (select .cse6 .cse8) 0) .cse4 (= (select .cse6 .cse1) 0) (= (+ |v_thread3_#t~mem15#1_180| v_~mts3~0_159) v_~mts3~0_158) .cse5 (= (select .cse6 .cse9) 0) (= |v_thread3_#t~mem15#1_180| .cse10)))) (<= 0 (+ v_~sum~0_93 2147483648)) (= (select .cse0 .cse8) 0) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483648)) (<= v_~sum~0_94 |v_thread3Thread1of1ForFork1_plus_#res#1_17|)) 1 0) 0)) .cse11 (<= v_~sum~0_93 2147483647) (= v_~sum~0_93 |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (not (= (ite (or (<= .cse10 0) .cse12) 1 0) 0)) (= (select .cse0 .cse7) 0) .cse12 (= (+ v_~sum~0_94 .cse10) |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (= (store |v_#race_453| v_~A~0.base_222 (store (store (store (store .cse6 .cse9 0) .cse8 0) .cse7 0) .cse1 0)) |v_#race_441|) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| v_~sum~0_94)) 1 0) 0)) (not (= (ite (or .cse11 (<= 0 .cse10)) 1 0) 0)) (= (select .cse0 .cse9) 0) (= |v_#race~A~0_267| 0))))))) InVars {~sum~0=v_~sum~0_94, #race=|v_#race_442|, ~A~0.base=v_~A~0.base_222, ~mts3~0=v_~mts3~0_159, ~A~0.offset=v_~A~0.offset_222, #memory_int=|v_#memory_int_124|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, thread3Thread1of1ForFork1_#t~mem15#1=|v_thread3Thread1of1ForFork1_#t~mem15#1_13|} OutVars{~A~0.base=v_~A~0.base_222, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_17|, thread3Thread1of1ForFork1_#t~ite16#1=|v_thread3Thread1of1ForFork1_#t~ite16#1_11|, thread3Thread1of1ForFork1_#t~ret14#1=|v_thread3Thread1of1ForFork1_#t~ret14#1_17|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, ~sum~0=v_~sum~0_93, #race~mts3~0=|v_#race~mts3~0_243|, ~mts3~0=v_~mts3~0_158, thread3Thread1of1ForFork1_#t~nondet17#1=|v_thread3Thread1of1ForFork1_#t~nondet17#1_11|, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_17|, #race~sum~0=|v_#race~sum~0_123|, #race=|v_#race_441|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_17|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork1_#t~mem13#1=|v_thread3Thread1of1ForFork1_#t~mem13#1_19|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_17|, ~A~0.offset=v_~A~0.offset_222, thread3Thread1of1ForFork1_#t~ret19#1=|v_thread3Thread1of1ForFork1_#t~ret19#1_3|, #memory_int=|v_#memory_int_124|, thread3Thread1of1ForFork1_#t~mem18#1=|v_thread3Thread1of1ForFork1_#t~mem18#1_5|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_17|, thread3Thread1of1ForFork1_#t~nondet20#1=|v_thread3Thread1of1ForFork1_#t~nondet20#1_3|, #race~A~0=|v_#race~A~0_267|} AuxVars[|v_thread3_#t~mem15#1_180|, |v_#race_453|, |v_#race~mts3~0_254|, |v_#race~A~0_277|] AssignedVars[#race, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~mem13#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ite16#1, thread3Thread1of1ForFork1_#t~ret14#1, thread3Thread1of1ForFork1_#t~mem15#1, ~sum~0, #race~mts3~0, ~mts3~0, thread3Thread1of1ForFork1_#t~nondet17#1, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_#t~ret19#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~mem18#1, #race~sum~0, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~nondet20#1, #race~A~0][178], [Black: 420#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 419#(<= (+ ~M~0 1) 0), Black: 388#true, 438#true, 208#L48-3true, 194#L67true, 390#(= |#race~A~0| 0), 372#(= |#race~N~0| 0), 206#L86-4true, 384#(= |#race~M~0| 0), Black: 400#(<= ~N~0 0), Black: 407#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 405#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 270#L56-1true, 441#true, Black: 401#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0))]) [2024-11-08 18:04:11,334 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2024-11-08 18:04:11,334 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-08 18:04:11,334 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-08 18:04:11,334 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-11-08 18:04:11,445 INFO L124 PetriNetUnfolderBase]: 207/1870 cut-off events. [2024-11-08 18:04:11,445 INFO L125 PetriNetUnfolderBase]: For 170/175 co-relation queries the response was YES. [2024-11-08 18:04:11,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2422 conditions, 1870 events. 207/1870 cut-off events. For 170/175 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 12100 event pairs, 54 based on Foata normal form. 0/1748 useless extension candidates. Maximal degree in co-relation 2412. Up to 200 conditions per place. [2024-11-08 18:04:11,461 INFO L140 encePairwiseOnDemand]: 368/371 looper letters, 12 selfloop transitions, 2 changer transitions 8/291 dead transitions. [2024-11-08 18:04:11,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 291 transitions, 707 flow [2024-11-08 18:04:11,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:04:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:04:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2024-11-08 18:04:11,464 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9083557951482479 [2024-11-08 18:04:11,465 INFO L175 Difference]: Start difference. First operand has 310 places, 289 transitions, 669 flow. Second operand 3 states and 1011 transitions. [2024-11-08 18:04:11,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 291 transitions, 707 flow [2024-11-08 18:04:11,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 291 transitions, 707 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 18:04:11,470 INFO L231 Difference]: Finished difference. Result has 295 places, 281 transitions, 633 flow [2024-11-08 18:04:11,471 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=295, PETRI_TRANSITIONS=281} [2024-11-08 18:04:11,471 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -44 predicate places. [2024-11-08 18:04:11,471 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 281 transitions, 633 flow [2024-11-08 18:04:11,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:11,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 18:04:11,472 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] [2024-11-08 18:04:11,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 18:04:11,473 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 72 more)] === [2024-11-08 18:04:11,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:04:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1203592973, now seen corresponding path program 1 times [2024-11-08 18:04:11,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:04:11,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838837108] [2024-11-08 18:04:11,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:04:11,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:04:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:04:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 18:04:11,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:04:11,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838837108] [2024-11-08 18:04:11,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838837108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:04:11,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:04:11,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:04:11,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689908653] [2024-11-08 18:04:11,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:04:11,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:04:11,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:04:11,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:04:11,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:04:11,553 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 371 [2024-11-08 18:04:11,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 281 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:11,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 18:04:11,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 371 [2024-11-08 18:04:11,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 18:04:11,814 INFO L124 PetriNetUnfolderBase]: 129/1329 cut-off events. [2024-11-08 18:04:11,814 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-11-08 18:04:11,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1721 conditions, 1329 events. 129/1329 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7523 event pairs, 36 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 1710. Up to 129 conditions per place. [2024-11-08 18:04:11,827 INFO L140 encePairwiseOnDemand]: 368/371 looper letters, 0 selfloop transitions, 0 changer transitions 283/283 dead transitions. [2024-11-08 18:04:11,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 283 transitions, 671 flow [2024-11-08 18:04:11,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:04:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 18:04:11,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2024-11-08 18:04:11,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9110512129380054 [2024-11-08 18:04:11,830 INFO L175 Difference]: Start difference. First operand has 295 places, 281 transitions, 633 flow. Second operand 3 states and 1014 transitions. [2024-11-08 18:04:11,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 283 transitions, 671 flow [2024-11-08 18:04:11,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 283 transitions, 647 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-11-08 18:04:11,835 INFO L231 Difference]: Finished difference. Result has 284 places, 0 transitions, 0 flow [2024-11-08 18:04:11,836 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=284, PETRI_TRANSITIONS=0} [2024-11-08 18:04:11,836 INFO L277 CegarLoopForPetriNet]: 339 programPoint places, -55 predicate places. [2024-11-08 18:04:11,836 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 0 transitions, 0 flow [2024-11-08 18:04:11,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:04:11,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (75 of 76 remaining) [2024-11-08 18:04:11,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (74 of 76 remaining) [2024-11-08 18:04:11,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (73 of 76 remaining) [2024-11-08 18:04:11,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (72 of 76 remaining) [2024-11-08 18:04:11,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (71 of 76 remaining) [2024-11-08 18:04:11,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (70 of 76 remaining) [2024-11-08 18:04:11,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (69 of 76 remaining) [2024-11-08 18:04:11,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (68 of 76 remaining) [2024-11-08 18:04:11,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (67 of 76 remaining) [2024-11-08 18:04:11,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (66 of 76 remaining) [2024-11-08 18:04:11,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (65 of 76 remaining) [2024-11-08 18:04:11,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (64 of 76 remaining) [2024-11-08 18:04:11,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (63 of 76 remaining) [2024-11-08 18:04:11,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (62 of 76 remaining) [2024-11-08 18:04:11,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (61 of 76 remaining) [2024-11-08 18:04:11,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (60 of 76 remaining) [2024-11-08 18:04:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (59 of 76 remaining) [2024-11-08 18:04:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (58 of 76 remaining) [2024-11-08 18:04:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (57 of 76 remaining) [2024-11-08 18:04:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (56 of 76 remaining) [2024-11-08 18:04:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (55 of 76 remaining) [2024-11-08 18:04:11,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (54 of 76 remaining) [2024-11-08 18:04:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (53 of 76 remaining) [2024-11-08 18:04:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (52 of 76 remaining) [2024-11-08 18:04:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (51 of 76 remaining) [2024-11-08 18:04:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (50 of 76 remaining) [2024-11-08 18:04:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (49 of 76 remaining) [2024-11-08 18:04:11,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (48 of 76 remaining) [2024-11-08 18:04:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (47 of 76 remaining) [2024-11-08 18:04:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (46 of 76 remaining) [2024-11-08 18:04:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 76 remaining) [2024-11-08 18:04:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 76 remaining) [2024-11-08 18:04:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (43 of 76 remaining) [2024-11-08 18:04:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (42 of 76 remaining) [2024-11-08 18:04:11,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 76 remaining) [2024-11-08 18:04:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (40 of 76 remaining) [2024-11-08 18:04:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 76 remaining) [2024-11-08 18:04:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 76 remaining) [2024-11-08 18:04:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (37 of 76 remaining) [2024-11-08 18:04:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (36 of 76 remaining) [2024-11-08 18:04:11,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (35 of 76 remaining) [2024-11-08 18:04:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (34 of 76 remaining) [2024-11-08 18:04:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (33 of 76 remaining) [2024-11-08 18:04:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (32 of 76 remaining) [2024-11-08 18:04:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 76 remaining) [2024-11-08 18:04:11,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 76 remaining) [2024-11-08 18:04:11,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 76 remaining) [2024-11-08 18:04:11,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 76 remaining) [2024-11-08 18:04:11,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (27 of 76 remaining) [2024-11-08 18:04:11,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 76 remaining) [2024-11-08 18:04:11,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (25 of 76 remaining) [2024-11-08 18:04:11,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 76 remaining) [2024-11-08 18:04:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 76 remaining) [2024-11-08 18:04:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (22 of 76 remaining) [2024-11-08 18:04:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (21 of 76 remaining) [2024-11-08 18:04:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 76 remaining) [2024-11-08 18:04:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (19 of 76 remaining) [2024-11-08 18:04:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (18 of 76 remaining) [2024-11-08 18:04:11,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 76 remaining) [2024-11-08 18:04:11,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 76 remaining) [2024-11-08 18:04:11,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (15 of 76 remaining) [2024-11-08 18:04:11,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (14 of 76 remaining) [2024-11-08 18:04:11,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (13 of 76 remaining) [2024-11-08 18:04:11,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (12 of 76 remaining) [2024-11-08 18:04:11,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (11 of 76 remaining) [2024-11-08 18:04:11,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (10 of 76 remaining) [2024-11-08 18:04:11,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (9 of 76 remaining) [2024-11-08 18:04:11,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (8 of 76 remaining) [2024-11-08 18:04:11,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (7 of 76 remaining) [2024-11-08 18:04:11,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 76 remaining) [2024-11-08 18:04:11,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (5 of 76 remaining) [2024-11-08 18:04:11,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 76 remaining) [2024-11-08 18:04:11,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (3 of 76 remaining) [2024-11-08 18:04:11,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (2 of 76 remaining) [2024-11-08 18:04:11,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (1 of 76 remaining) [2024-11-08 18:04:11,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (0 of 76 remaining) [2024-11-08 18:04:11,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 18:04:11,853 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:04:11,861 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-08 18:04:11,861 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:04:11,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:04:11 BasicIcfg [2024-11-08 18:04:11,867 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:04:11,868 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:04:11,868 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:04:11,868 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:04:11,869 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:04:00" (3/4) ... [2024-11-08 18:04:11,870 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 18:04:11,873 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-08 18:04:11,873 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-08 18:04:11,873 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-08 18:04:11,880 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-08 18:04:11,880 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-08 18:04:11,880 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 18:04:11,881 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 18:04:11,987 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX/witness.graphml [2024-11-08 18:04:11,988 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX/witness.yml [2024-11-08 18:04:11,988 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:04:11,988 INFO L158 Benchmark]: Toolchain (without parser) took 13481.07ms. Allocated memory was 163.6MB in the beginning and 453.0MB in the end (delta: 289.4MB). Free memory was 118.7MB in the beginning and 236.4MB in the end (delta: -117.6MB). Peak memory consumption was 174.9MB. Max. memory is 16.1GB. [2024-11-08 18:04:11,989 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 163.6MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:04:11,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.12ms. Allocated memory is still 163.6MB. Free memory was 118.7MB in the beginning and 104.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 18:04:11,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.58ms. Allocated memory is still 163.6MB. Free memory was 104.1MB in the beginning and 100.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:04:11,990 INFO L158 Benchmark]: Boogie Preprocessor took 57.37ms. Allocated memory is still 163.6MB. Free memory was 100.6MB in the beginning and 97.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:04:11,990 INFO L158 Benchmark]: RCFGBuilder took 1528.74ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 97.8MB in the beginning and 149.6MB in the end (delta: -51.9MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2024-11-08 18:04:11,990 INFO L158 Benchmark]: TraceAbstraction took 11345.60ms. Allocated memory was 222.3MB in the beginning and 453.0MB in the end (delta: 230.7MB). Free memory was 148.6MB in the beginning and 241.6MB in the end (delta: -93.0MB). Peak memory consumption was 137.7MB. Max. memory is 16.1GB. [2024-11-08 18:04:11,991 INFO L158 Benchmark]: Witness Printer took 119.99ms. Allocated memory is still 453.0MB. Free memory was 241.6MB in the beginning and 236.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 18:04:11,992 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.29ms. Allocated memory is still 163.6MB. Free memory is still 132.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.12ms. Allocated memory is still 163.6MB. Free memory was 118.7MB in the beginning and 104.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.58ms. Allocated memory is still 163.6MB. Free memory was 104.1MB in the beginning and 100.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.37ms. Allocated memory is still 163.6MB. Free memory was 100.6MB in the beginning and 97.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1528.74ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 97.8MB in the beginning and 149.6MB in the end (delta: -51.9MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11345.60ms. Allocated memory was 222.3MB in the beginning and 453.0MB in the end (delta: 230.7MB). Free memory was 148.6MB in the beginning and 241.6MB in the end (delta: -93.0MB). Peak memory consumption was 137.7MB. Max. memory is 16.1GB. * Witness Printer took 119.99ms. Allocated memory is still 453.0MB. Free memory was 241.6MB in the beginning and 236.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: 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: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: 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: 65]: 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: 65]: 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: 65]: 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: 66]: 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: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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, 535 locations, 76 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: 11.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1039 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 576 mSDsluCounter, 527 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 439 mSDsCounter, 197 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1419 IncrementalHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 197 mSolverCounterUnsat, 88 mSDtfsCounter, 1419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=725occurred in iteration=12, InterpolantAutomatonStates: 69, 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, 2.4s InterpolantComputationTime, 1541 NumberOfCodeBlocks, 1541 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1524 ConstructedInterpolants, 0 QuantifiedInterpolants, 2115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 2/2 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 44 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-08 18:04:12,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46ee8147-a66a-48f3-b9f1-d8d94bfc9db9/bin/uautomizer-verify-jihMAELWvX/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