./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a508120cc7913f10b79dda7ca65a8b88f829725798d520aee5d1c1d04a1fc13 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:34:56,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:34:56,620 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-27 20:34:56,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:34:56,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:34:56,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:34:56,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:34:56,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:34:56,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:34:56,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:34:56,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:34:56,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:34:56,656 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:34:56,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:34:56,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:34:56,656 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:34:56,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:34:56,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:34:56,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:34:56,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:34:56,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:34:56,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:34:56,657 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-27 20:34:56,657 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:34:56,657 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:34:56,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:34:56,657 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:34:56,658 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:34:56,658 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:34:56,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:34:56,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:34:56,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:34:56,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:34:56,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:34:56,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:34:56,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:34:56,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:34:56,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:34:56,660 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:34:56,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:34:56,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:34:56,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:34:56,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:34:56,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:34:56,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:34:56,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:34:56,661 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a508120cc7913f10b79dda7ca65a8b88f829725798d520aee5d1c1d04a1fc13 [2024-11-27 20:34:57,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:34:57,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:34:57,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:34:57,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:34:57,033 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:34:57,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2024-11-27 20:35:00,112 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB/data/e2e595cc3/5559a8366d77451cae1b3abe64dd40c7/FLAG5f1e21ea9 [2024-11-27 20:35:00,368 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:35:00,368 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2024-11-27 20:35:00,377 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB/data/e2e595cc3/5559a8366d77451cae1b3abe64dd40c7/FLAG5f1e21ea9 [2024-11-27 20:35:00,400 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB/data/e2e595cc3/5559a8366d77451cae1b3abe64dd40c7 [2024-11-27 20:35:00,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:35:00,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:35:00,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:35:00,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:35:00,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:35:00,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:35:00" (1/1) ... [2024-11-27 20:35:00,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c167ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:35:00, skipping insertion in model container [2024-11-27 20:35:00,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:35:00" (1/1) ... [2024-11-27 20:35:00,447 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:35:00,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:35:00,721 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:35:00,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:35:00,804 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:35:00,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:35:00 WrapperNode [2024-11-27 20:35:00,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:35:00,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:35:00,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:35:00,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:35:00,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:35:00" (1/1) ... [2024-11-27 20:35:00,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:35:00" (1/1) ... [2024-11-27 20:35:00,877 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 317 [2024-11-27 20:35:00,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:35:00,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:35:00,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:35:00,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:35:00,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:35:00" (1/1) ... [2024-11-27 20:35:00,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:35:00" (1/1) ... [2024-11-27 20:35:00,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:35:00" (1/1) ... [2024-11-27 20:35:00,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:35:00" (1/1) ... [2024-11-27 20:35:00,915 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:35:00" (1/1) ... [2024-11-27 20:35:00,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:35:00" (1/1) ... [2024-11-27 20:35:00,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:35:00" (1/1) ... [2024-11-27 20:35:00,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:35:00" (1/1) ... [2024-11-27 20:35:00,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:35:00" (1/1) ... [2024-11-27 20:35:00,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:35:00,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:35:00,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:35:00,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:35:00,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:35:00" (1/1) ... [2024-11-27 20:35:00,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:35:00,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:35:01,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:35:01,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:35:01,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:35:01,046 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-27 20:35:01,047 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-27 20:35:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-27 20:35:01,047 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-27 20:35:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-27 20:35:01,047 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-27 20:35:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-27 20:35:01,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:35:01,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:35:01,049 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 20:35:01,191 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:35:01,193 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:35:01,886 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 20:35:01,887 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:35:01,915 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:35:01,915 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 20:35:01,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:35:01 BoogieIcfgContainer [2024-11-27 20:35:01,916 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:35:01,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:35:01,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:35:01,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:35:01,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:35:00" (1/3) ... [2024-11-27 20:35:01,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43da33c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:35:01, skipping insertion in model container [2024-11-27 20:35:01,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:35:00" (2/3) ... [2024-11-27 20:35:01,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43da33c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:35:01, skipping insertion in model container [2024-11-27 20:35:01,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:35:01" (3/3) ... [2024-11-27 20:35:01,927 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-exp-term-subst.wvr.c [2024-11-27 20:35:01,945 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:35:01,947 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-exp-term-subst.wvr.c that has 4 procedures, 404 locations, 1 initial locations, 0 loop locations, and 44 error locations. [2024-11-27 20:35:01,947 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 20:35:02,182 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-27 20:35:02,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 413 places, 430 transitions, 881 flow [2024-11-27 20:35:02,552 INFO L124 PetriNetUnfolderBase]: 27/427 cut-off events. [2024-11-27 20:35:02,556 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-27 20:35:02,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 427 events. 27/427 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1395 event pairs, 0 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 306. Up to 2 conditions per place. [2024-11-27 20:35:02,578 INFO L82 GeneralOperation]: Start removeDead. Operand has 413 places, 430 transitions, 881 flow [2024-11-27 20:35:02,598 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 392 places, 407 transitions, 832 flow [2024-11-27 20:35:02,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:35:02,633 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;@3467f1ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:35:02,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2024-11-27 20:35:02,640 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 20:35:02,640 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-27 20:35:02,640 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:35:02,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:02,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:02,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:02,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:02,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1102699124, now seen corresponding path program 1 times [2024-11-27 20:35:02,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:02,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077966749] [2024-11-27 20:35:02,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:02,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:02,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:02,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077966749] [2024-11-27 20:35:02,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077966749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:02,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:02,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:02,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723660900] [2024-11-27 20:35:02,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:02,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:02,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:02,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:02,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:02,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 430 [2024-11-27 20:35:02,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 407 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:02,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:02,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 430 [2024-11-27 20:35:02,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:03,458 INFO L124 PetriNetUnfolderBase]: 98/1397 cut-off events. [2024-11-27 20:35:03,458 INFO L125 PetriNetUnfolderBase]: For 28/32 co-relation queries the response was YES. [2024-11-27 20:35:03,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 1397 events. 98/1397 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 9754 event pairs, 20 based on Foata normal form. 39/1169 useless extension candidates. Maximal degree in co-relation 1352. Up to 50 conditions per place. [2024-11-27 20:35:03,487 INFO L140 encePairwiseOnDemand]: 420/430 looper letters, 13 selfloop transitions, 2 changer transitions 1/399 dead transitions. [2024-11-27 20:35:03,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 399 transitions, 846 flow [2024-11-27 20:35:03,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1235 transitions. [2024-11-27 20:35:03,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9573643410852714 [2024-11-27 20:35:03,512 INFO L175 Difference]: Start difference. First operand has 392 places, 407 transitions, 832 flow. Second operand 3 states and 1235 transitions. [2024-11-27 20:35:03,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 399 transitions, 846 flow [2024-11-27 20:35:03,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 399 transitions, 834 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-27 20:35:03,538 INFO L231 Difference]: Finished difference. Result has 387 places, 398 transitions, 806 flow [2024-11-27 20:35:03,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=387, PETRI_TRANSITIONS=398} [2024-11-27 20:35:03,548 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -5 predicate places. [2024-11-27 20:35:03,551 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 398 transitions, 806 flow [2024-11-27 20:35:03,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:03,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:03,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:03,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:35:03,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:03,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash 669304532, now seen corresponding path program 1 times [2024-11-27 20:35:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:03,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631399404] [2024-11-27 20:35:03,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:03,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631399404] [2024-11-27 20:35:03,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631399404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:03,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:03,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:03,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226693165] [2024-11-27 20:35:03,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:03,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:03,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:03,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:03,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:03,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 430 [2024-11-27 20:35:03,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 398 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:03,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:03,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 430 [2024-11-27 20:35:03,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:03,974 INFO L124 PetriNetUnfolderBase]: 54/807 cut-off events. [2024-11-27 20:35:03,974 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-27 20:35:03,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 807 events. 54/807 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4622 event pairs, 12 based on Foata normal form. 0/662 useless extension candidates. Maximal degree in co-relation 824. Up to 38 conditions per place. [2024-11-27 20:35:03,994 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 13 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2024-11-27 20:35:03,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 397 transitions, 834 flow [2024-11-27 20:35:03,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1228 transitions. [2024-11-27 20:35:03,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.951937984496124 [2024-11-27 20:35:03,999 INFO L175 Difference]: Start difference. First operand has 387 places, 398 transitions, 806 flow. Second operand 3 states and 1228 transitions. [2024-11-27 20:35:03,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 397 transitions, 834 flow [2024-11-27 20:35:04,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 397 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:35:04,009 INFO L231 Difference]: Finished difference. Result has 385 places, 397 transitions, 804 flow [2024-11-27 20:35:04,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=385, PETRI_TRANSITIONS=397} [2024-11-27 20:35:04,012 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -7 predicate places. [2024-11-27 20:35:04,013 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 397 transitions, 804 flow [2024-11-27 20:35:04,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:04,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:04,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:04,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:35:04,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:04,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:04,017 INFO L85 PathProgramCache]: Analyzing trace with hash -337939069, now seen corresponding path program 1 times [2024-11-27 20:35:04,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:04,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364301551] [2024-11-27 20:35:04,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:04,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:04,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:04,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364301551] [2024-11-27 20:35:04,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364301551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:04,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:04,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:04,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694703516] [2024-11-27 20:35:04,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:04,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:04,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:04,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:04,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:04,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 430 [2024-11-27 20:35:04,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 397 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:04,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:04,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 430 [2024-11-27 20:35:04,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:04,400 INFO L124 PetriNetUnfolderBase]: 50/620 cut-off events. [2024-11-27 20:35:04,400 INFO L125 PetriNetUnfolderBase]: For 9/12 co-relation queries the response was YES. [2024-11-27 20:35:04,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 620 events. 50/620 cut-off events. For 9/12 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3102 event pairs, 20 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 639. Up to 50 conditions per place. [2024-11-27 20:35:04,416 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 13 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2024-11-27 20:35:04,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 396 transitions, 832 flow [2024-11-27 20:35:04,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1228 transitions. [2024-11-27 20:35:04,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.951937984496124 [2024-11-27 20:35:04,427 INFO L175 Difference]: Start difference. First operand has 385 places, 397 transitions, 804 flow. Second operand 3 states and 1228 transitions. [2024-11-27 20:35:04,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 396 transitions, 832 flow [2024-11-27 20:35:04,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 396 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:35:04,438 INFO L231 Difference]: Finished difference. Result has 384 places, 396 transitions, 802 flow [2024-11-27 20:35:04,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=802, PETRI_PLACES=384, PETRI_TRANSITIONS=396} [2024-11-27 20:35:04,441 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -8 predicate places. [2024-11-27 20:35:04,441 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 396 transitions, 802 flow [2024-11-27 20:35:04,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:04,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:04,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:04,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:35:04,443 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:04,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:04,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1034750040, now seen corresponding path program 1 times [2024-11-27 20:35:04,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:04,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154278048] [2024-11-27 20:35:04,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:04,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:04,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:04,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154278048] [2024-11-27 20:35:04,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154278048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:04,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:04,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:04,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079280558] [2024-11-27 20:35:04,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:04,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:04,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:04,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:04,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:04,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-27 20:35:04,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 396 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:04,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:04,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-27 20:35:04,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:04,932 INFO L124 PetriNetUnfolderBase]: 117/1364 cut-off events. [2024-11-27 20:35:04,933 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-27 20:35:04,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1364 events. 117/1364 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9907 event pairs, 39 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1426. Up to 85 conditions per place. [2024-11-27 20:35:04,959 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 15 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2024-11-27 20:35:04,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 395 transitions, 834 flow [2024-11-27 20:35:04,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:04,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2024-11-27 20:35:04,964 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488372093023256 [2024-11-27 20:35:04,964 INFO L175 Difference]: Start difference. First operand has 384 places, 396 transitions, 802 flow. Second operand 3 states and 1224 transitions. [2024-11-27 20:35:04,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 395 transitions, 834 flow [2024-11-27 20:35:04,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 395 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:35:04,971 INFO L231 Difference]: Finished difference. Result has 383 places, 395 transitions, 800 flow [2024-11-27 20:35:04,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=383, PETRI_TRANSITIONS=395} [2024-11-27 20:35:04,973 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -9 predicate places. [2024-11-27 20:35:04,973 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 395 transitions, 800 flow [2024-11-27 20:35:04,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:04,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:04,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:04,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:35:04,975 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:04,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:04,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1308583354, now seen corresponding path program 1 times [2024-11-27 20:35:04,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:04,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5731188] [2024-11-27 20:35:04,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:04,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:05,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:05,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:05,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5731188] [2024-11-27 20:35:05,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5731188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:05,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:05,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:05,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179083295] [2024-11-27 20:35:05,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:05,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:05,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:05,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:05,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:05,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-27 20:35:05,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 395 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:05,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:05,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-27 20:35:05,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:05,337 INFO L124 PetriNetUnfolderBase]: 69/871 cut-off events. [2024-11-27 20:35:05,338 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-27 20:35:05,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 871 events. 69/871 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5269 event pairs, 21 based on Foata normal form. 0/715 useless extension candidates. Maximal degree in co-relation 886. Up to 58 conditions per place. [2024-11-27 20:35:05,363 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 15 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2024-11-27 20:35:05,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 394 transitions, 832 flow [2024-11-27 20:35:05,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2024-11-27 20:35:05,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488372093023256 [2024-11-27 20:35:05,367 INFO L175 Difference]: Start difference. First operand has 383 places, 395 transitions, 800 flow. Second operand 3 states and 1224 transitions. [2024-11-27 20:35:05,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 394 transitions, 832 flow [2024-11-27 20:35:05,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 394 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:35:05,374 INFO L231 Difference]: Finished difference. Result has 382 places, 394 transitions, 798 flow [2024-11-27 20:35:05,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=382, PETRI_TRANSITIONS=394} [2024-11-27 20:35:05,379 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -10 predicate places. [2024-11-27 20:35:05,379 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 394 transitions, 798 flow [2024-11-27 20:35:05,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:05,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:05,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:05,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:35:05,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:05,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:05,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1633748031, now seen corresponding path program 1 times [2024-11-27 20:35:05,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:05,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768125032] [2024-11-27 20:35:05,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:05,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:05,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:05,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768125032] [2024-11-27 20:35:05,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768125032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:05,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:05,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:05,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971934980] [2024-11-27 20:35:05,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:05,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:05,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:05,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:05,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:05,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-27 20:35:05,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 394 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:05,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:05,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-27 20:35:05,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:05,822 INFO L124 PetriNetUnfolderBase]: 117/1332 cut-off events. [2024-11-27 20:35:05,822 INFO L125 PetriNetUnfolderBase]: For 21/26 co-relation queries the response was YES. [2024-11-27 20:35:05,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1332 events. 117/1332 cut-off events. For 21/26 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 8607 event pairs, 39 based on Foata normal form. 0/1080 useless extension candidates. Maximal degree in co-relation 1363. Up to 85 conditions per place. [2024-11-27 20:35:05,841 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 15 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2024-11-27 20:35:05,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 393 transitions, 830 flow [2024-11-27 20:35:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:05,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2024-11-27 20:35:05,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9488372093023256 [2024-11-27 20:35:05,845 INFO L175 Difference]: Start difference. First operand has 382 places, 394 transitions, 798 flow. Second operand 3 states and 1224 transitions. [2024-11-27 20:35:05,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 393 transitions, 830 flow [2024-11-27 20:35:05,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 393 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:35:05,852 INFO L231 Difference]: Finished difference. Result has 381 places, 393 transitions, 796 flow [2024-11-27 20:35:05,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=381, PETRI_TRANSITIONS=393} [2024-11-27 20:35:05,853 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2024-11-27 20:35:05,853 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 393 transitions, 796 flow [2024-11-27 20:35:05,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:05,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:05,854 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:05,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:35:05,855 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:05,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:05,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1920223402, now seen corresponding path program 1 times [2024-11-27 20:35:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:05,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060077133] [2024-11-27 20:35:05,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:05,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:05,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:05,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060077133] [2024-11-27 20:35:05,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060077133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:05,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:05,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:05,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376902593] [2024-11-27 20:35:05,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:05,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:05,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:05,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:05,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:05,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 430 [2024-11-27 20:35:05,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 393 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:05,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:05,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 430 [2024-11-27 20:35:05,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:06,499 INFO L124 PetriNetUnfolderBase]: 284/2636 cut-off events. [2024-11-27 20:35:06,499 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-27 20:35:06,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2953 conditions, 2636 events. 284/2636 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 24560 event pairs, 117 based on Foata normal form. 0/2193 useless extension candidates. Maximal degree in co-relation 2879. Up to 251 conditions per place. [2024-11-27 20:35:06,544 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 21 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2024-11-27 20:35:06,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 391 transitions, 840 flow [2024-11-27 20:35:06,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:06,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2024-11-27 20:35:06,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434108527131783 [2024-11-27 20:35:06,548 INFO L175 Difference]: Start difference. First operand has 381 places, 393 transitions, 796 flow. Second operand 3 states and 1217 transitions. [2024-11-27 20:35:06,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 391 transitions, 840 flow [2024-11-27 20:35:06,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 391 transitions, 836 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:35:06,555 INFO L231 Difference]: Finished difference. Result has 376 places, 389 transitions, 794 flow [2024-11-27 20:35:06,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=376, PETRI_TRANSITIONS=389} [2024-11-27 20:35:06,557 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -16 predicate places. [2024-11-27 20:35:06,557 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 389 transitions, 794 flow [2024-11-27 20:35:06,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:06,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:06,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:06,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:35:06,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:06,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:06,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1501280024, now seen corresponding path program 1 times [2024-11-27 20:35:06,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:06,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505394791] [2024-11-27 20:35:06,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:06,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:06,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:06,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505394791] [2024-11-27 20:35:06,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505394791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:06,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:06,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467132649] [2024-11-27 20:35:06,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:06,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:06,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:06,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:06,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:06,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 430 [2024-11-27 20:35:06,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 389 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:06,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:06,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 430 [2024-11-27 20:35:06,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:07,005 INFO L124 PetriNetUnfolderBase]: 151/1516 cut-off events. [2024-11-27 20:35:07,006 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-27 20:35:07,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 1516 events. 151/1516 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 11431 event pairs, 52 based on Foata normal form. 0/1274 useless extension candidates. Maximal degree in co-relation 1504. Up to 135 conditions per place. [2024-11-27 20:35:07,036 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 21 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2024-11-27 20:35:07,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 387 transitions, 838 flow [2024-11-27 20:35:07,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2024-11-27 20:35:07,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434108527131783 [2024-11-27 20:35:07,040 INFO L175 Difference]: Start difference. First operand has 376 places, 389 transitions, 794 flow. Second operand 3 states and 1217 transitions. [2024-11-27 20:35:07,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 387 transitions, 838 flow [2024-11-27 20:35:07,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 387 transitions, 838 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 20:35:07,047 INFO L231 Difference]: Finished difference. Result has 373 places, 385 transitions, 796 flow [2024-11-27 20:35:07,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=373, PETRI_TRANSITIONS=385} [2024-11-27 20:35:07,050 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -19 predicate places. [2024-11-27 20:35:07,051 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 385 transitions, 796 flow [2024-11-27 20:35:07,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:07,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:07,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:07,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:35:07,055 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:07,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:07,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1400118740, now seen corresponding path program 1 times [2024-11-27 20:35:07,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:07,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778464810] [2024-11-27 20:35:07,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:07,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:07,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:07,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778464810] [2024-11-27 20:35:07,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778464810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:07,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:07,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:07,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224419007] [2024-11-27 20:35:07,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:07,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:07,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:07,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:07,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:07,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 430 [2024-11-27 20:35:07,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 385 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:07,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:07,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 430 [2024-11-27 20:35:07,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:07,876 INFO L124 PetriNetUnfolderBase]: 505/4357 cut-off events. [2024-11-27 20:35:07,876 INFO L125 PetriNetUnfolderBase]: For 63/71 co-relation queries the response was YES. [2024-11-27 20:35:07,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4838 conditions, 4357 events. 505/4357 cut-off events. For 63/71 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 44552 event pairs, 126 based on Foata normal form. 0/3687 useless extension candidates. Maximal degree in co-relation 3641. Up to 445 conditions per place. [2024-11-27 20:35:07,924 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 21 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2024-11-27 20:35:07,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 383 transitions, 840 flow [2024-11-27 20:35:07,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:07,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2024-11-27 20:35:07,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434108527131783 [2024-11-27 20:35:07,928 INFO L175 Difference]: Start difference. First operand has 373 places, 385 transitions, 796 flow. Second operand 3 states and 1217 transitions. [2024-11-27 20:35:07,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 383 transitions, 840 flow [2024-11-27 20:35:07,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 383 transitions, 840 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 20:35:07,934 INFO L231 Difference]: Finished difference. Result has 370 places, 381 transitions, 798 flow [2024-11-27 20:35:07,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=370, PETRI_TRANSITIONS=381} [2024-11-27 20:35:07,937 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2024-11-27 20:35:07,938 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 381 transitions, 798 flow [2024-11-27 20:35:07,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:07,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:07,939 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:07,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:35:07,939 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:07,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:07,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1481210219, now seen corresponding path program 1 times [2024-11-27 20:35:07,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:07,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123298830] [2024-11-27 20:35:07,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:07,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:08,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:08,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123298830] [2024-11-27 20:35:08,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123298830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:08,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:08,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:35:08,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048873255] [2024-11-27 20:35:08,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:08,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:08,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:08,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:08,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:08,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-27 20:35:08,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 381 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:08,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:08,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-27 20:35:08,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:08,382 INFO L124 PetriNetUnfolderBase]: 98/1285 cut-off events. [2024-11-27 20:35:08,383 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-27 20:35:08,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1285 events. 98/1285 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 9496 event pairs, 10 based on Foata normal form. 0/1105 useless extension candidates. Maximal degree in co-relation 1124. Up to 35 conditions per place. [2024-11-27 20:35:08,402 INFO L140 encePairwiseOnDemand]: 426/430 looper letters, 14 selfloop transitions, 3 changer transitions 0/385 dead transitions. [2024-11-27 20:35:08,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 385 transitions, 842 flow [2024-11-27 20:35:08,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:08,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-11-27 20:35:08,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627906976744186 [2024-11-27 20:35:08,407 INFO L175 Difference]: Start difference. First operand has 370 places, 381 transitions, 798 flow. Second operand 3 states and 1242 transitions. [2024-11-27 20:35:08,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 385 transitions, 842 flow [2024-11-27 20:35:08,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 385 transitions, 842 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 20:35:08,415 INFO L231 Difference]: Finished difference. Result has 374 places, 383 transitions, 820 flow [2024-11-27 20:35:08,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=374, PETRI_TRANSITIONS=383} [2024-11-27 20:35:08,418 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -18 predicate places. [2024-11-27 20:35:08,418 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 383 transitions, 820 flow [2024-11-27 20:35:08,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:08,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:08,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:08,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:35:08,419 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:08,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:08,420 INFO L85 PathProgramCache]: Analyzing trace with hash 955479565, now seen corresponding path program 1 times [2024-11-27 20:35:08,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:08,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341926334] [2024-11-27 20:35:08,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:08,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:08,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:08,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341926334] [2024-11-27 20:35:08,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341926334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:08,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:08,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:08,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252816262] [2024-11-27 20:35:08,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:08,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:08,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:08,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:08,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:08,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-27 20:35:08,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 383 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:08,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:08,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-27 20:35:08,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:09,021 INFO L124 PetriNetUnfolderBase]: 206/2208 cut-off events. [2024-11-27 20:35:09,021 INFO L125 PetriNetUnfolderBase]: For 28/34 co-relation queries the response was YES. [2024-11-27 20:35:09,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 2208 events. 206/2208 cut-off events. For 28/34 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 19276 event pairs, 16 based on Foata normal form. 1/1935 useless extension candidates. Maximal degree in co-relation 2113. Up to 166 conditions per place. [2024-11-27 20:35:09,055 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 20 selfloop transitions, 4 changer transitions 0/388 dead transitions. [2024-11-27 20:35:09,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 388 transitions, 883 flow [2024-11-27 20:35:09,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1234 transitions. [2024-11-27 20:35:09,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9565891472868217 [2024-11-27 20:35:09,059 INFO L175 Difference]: Start difference. First operand has 374 places, 383 transitions, 820 flow. Second operand 3 states and 1234 transitions. [2024-11-27 20:35:09,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 388 transitions, 883 flow [2024-11-27 20:35:09,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 388 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:35:09,066 INFO L231 Difference]: Finished difference. Result has 371 places, 383 transitions, 834 flow [2024-11-27 20:35:09,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=371, PETRI_TRANSITIONS=383} [2024-11-27 20:35:09,068 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -21 predicate places. [2024-11-27 20:35:09,068 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 383 transitions, 834 flow [2024-11-27 20:35:09,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:09,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:09,070 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:09,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:35:09,070 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:09,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:09,071 INFO L85 PathProgramCache]: Analyzing trace with hash -907105805, now seen corresponding path program 1 times [2024-11-27 20:35:09,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:09,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059770490] [2024-11-27 20:35:09,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:09,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:09,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:09,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059770490] [2024-11-27 20:35:09,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059770490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:09,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:09,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:09,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318997438] [2024-11-27 20:35:09,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:09,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:09,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:09,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:09,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:09,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-27 20:35:09,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 383 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:09,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:09,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-27 20:35:09,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:09,812 INFO L124 PetriNetUnfolderBase]: 262/2943 cut-off events. [2024-11-27 20:35:09,813 INFO L125 PetriNetUnfolderBase]: For 34/65 co-relation queries the response was YES. [2024-11-27 20:35:09,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 2943 events. 262/2943 cut-off events. For 34/65 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 26403 event pairs, 36 based on Foata normal form. 2/2571 useless extension candidates. Maximal degree in co-relation 2942. Up to 198 conditions per place. [2024-11-27 20:35:09,862 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 20 selfloop transitions, 4 changer transitions 0/388 dead transitions. [2024-11-27 20:35:09,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 388 transitions, 897 flow [2024-11-27 20:35:09,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1234 transitions. [2024-11-27 20:35:09,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9565891472868217 [2024-11-27 20:35:09,866 INFO L175 Difference]: Start difference. First operand has 371 places, 383 transitions, 834 flow. Second operand 3 states and 1234 transitions. [2024-11-27 20:35:09,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 388 transitions, 897 flow [2024-11-27 20:35:09,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 388 transitions, 897 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 20:35:09,872 INFO L231 Difference]: Finished difference. Result has 370 places, 383 transitions, 854 flow [2024-11-27 20:35:09,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=370, PETRI_TRANSITIONS=383} [2024-11-27 20:35:09,874 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2024-11-27 20:35:09,874 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 383 transitions, 854 flow [2024-11-27 20:35:09,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:09,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:09,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:09,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 20:35:09,875 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:09,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:09,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1268745015, now seen corresponding path program 1 times [2024-11-27 20:35:09,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:09,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397655660] [2024-11-27 20:35:09,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:09,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:09,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:09,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397655660] [2024-11-27 20:35:09,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397655660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:09,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:09,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:09,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172139898] [2024-11-27 20:35:09,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:09,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:09,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:09,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:09,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:09,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 430 [2024-11-27 20:35:09,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 383 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:09,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:09,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 430 [2024-11-27 20:35:09,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:10,538 INFO L124 PetriNetUnfolderBase]: 236/2977 cut-off events. [2024-11-27 20:35:10,539 INFO L125 PetriNetUnfolderBase]: For 6/35 co-relation queries the response was YES. [2024-11-27 20:35:10,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3305 conditions, 2977 events. 236/2977 cut-off events. For 6/35 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 27839 event pairs, 14 based on Foata normal form. 4/2617 useless extension candidates. Maximal degree in co-relation 2968. Up to 62 conditions per place. [2024-11-27 20:35:10,593 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 11 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2024-11-27 20:35:10,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 384 transitions, 884 flow [2024-11-27 20:35:10,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:10,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1241 transitions. [2024-11-27 20:35:10,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.962015503875969 [2024-11-27 20:35:10,683 INFO L175 Difference]: Start difference. First operand has 370 places, 383 transitions, 854 flow. Second operand 3 states and 1241 transitions. [2024-11-27 20:35:10,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 384 transitions, 884 flow [2024-11-27 20:35:10,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 384 transitions, 884 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 20:35:10,690 INFO L231 Difference]: Finished difference. Result has 371 places, 382 transitions, 856 flow [2024-11-27 20:35:10,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=371, PETRI_TRANSITIONS=382} [2024-11-27 20:35:10,692 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -21 predicate places. [2024-11-27 20:35:10,692 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 382 transitions, 856 flow [2024-11-27 20:35:10,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:10,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:10,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:10,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 20:35:10,693 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:10,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:10,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1959498791, now seen corresponding path program 1 times [2024-11-27 20:35:10,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:10,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489506730] [2024-11-27 20:35:10,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:10,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:10,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489506730] [2024-11-27 20:35:10,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489506730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:10,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:10,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:35:10,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455650931] [2024-11-27 20:35:10,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:10,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:10,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:10,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:10,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:10,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-27 20:35:10,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 382 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:10,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:10,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-27 20:35:10,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:11,553 INFO L124 PetriNetUnfolderBase]: 260/2958 cut-off events. [2024-11-27 20:35:11,553 INFO L125 PetriNetUnfolderBase]: For 27/76 co-relation queries the response was YES. [2024-11-27 20:35:11,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3377 conditions, 2958 events. 260/2958 cut-off events. For 27/76 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 27904 event pairs, 42 based on Foata normal form. 0/2586 useless extension candidates. Maximal degree in co-relation 2920. Up to 136 conditions per place. [2024-11-27 20:35:11,611 INFO L140 encePairwiseOnDemand]: 426/430 looper letters, 14 selfloop transitions, 3 changer transitions 0/386 dead transitions. [2024-11-27 20:35:11,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 386 transitions, 900 flow [2024-11-27 20:35:11,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-11-27 20:35:11,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627906976744186 [2024-11-27 20:35:11,615 INFO L175 Difference]: Start difference. First operand has 371 places, 382 transitions, 856 flow. Second operand 3 states and 1242 transitions. [2024-11-27 20:35:11,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 386 transitions, 900 flow [2024-11-27 20:35:11,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 386 transitions, 896 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:35:11,623 INFO L231 Difference]: Finished difference. Result has 373 places, 384 transitions, 874 flow [2024-11-27 20:35:11,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=373, PETRI_TRANSITIONS=384} [2024-11-27 20:35:11,625 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -19 predicate places. [2024-11-27 20:35:11,625 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 384 transitions, 874 flow [2024-11-27 20:35:11,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:11,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:11,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:11,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 20:35:11,627 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:11,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:11,628 INFO L85 PathProgramCache]: Analyzing trace with hash -804587533, now seen corresponding path program 1 times [2024-11-27 20:35:11,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:11,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989424456] [2024-11-27 20:35:11,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:11,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:11,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:11,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989424456] [2024-11-27 20:35:11,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989424456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:11,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:11,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:11,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254623024] [2024-11-27 20:35:11,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:11,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:11,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:11,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:11,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:11,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-27 20:35:11,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 384 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:11,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:11,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-27 20:35:11,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:12,404 INFO L124 PetriNetUnfolderBase]: 390/4199 cut-off events. [2024-11-27 20:35:12,404 INFO L125 PetriNetUnfolderBase]: For 60/116 co-relation queries the response was YES. [2024-11-27 20:35:12,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4849 conditions, 4199 events. 390/4199 cut-off events. For 60/116 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 42591 event pairs, 32 based on Foata normal form. 2/3712 useless extension candidates. Maximal degree in co-relation 3856. Up to 132 conditions per place. [2024-11-27 20:35:12,453 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 12 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2024-11-27 20:35:12,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 385 transitions, 906 flow [2024-11-27 20:35:12,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2024-11-27 20:35:12,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9604651162790697 [2024-11-27 20:35:12,457 INFO L175 Difference]: Start difference. First operand has 373 places, 384 transitions, 874 flow. Second operand 3 states and 1239 transitions. [2024-11-27 20:35:12,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 385 transitions, 906 flow [2024-11-27 20:35:12,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 385 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:35:12,465 INFO L231 Difference]: Finished difference. Result has 372 places, 383 transitions, 870 flow [2024-11-27 20:35:12,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=372, PETRI_TRANSITIONS=383} [2024-11-27 20:35:12,466 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -20 predicate places. [2024-11-27 20:35:12,466 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 383 transitions, 870 flow [2024-11-27 20:35:12,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:12,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:12,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:12,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 20:35:12,468 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:12,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:12,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1314528943, now seen corresponding path program 1 times [2024-11-27 20:35:12,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:12,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143101013] [2024-11-27 20:35:12,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:12,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:12,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:12,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143101013] [2024-11-27 20:35:12,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143101013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:12,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:12,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:12,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639605560] [2024-11-27 20:35:12,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:12,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:12,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:12,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:12,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:12,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-11-27 20:35:12,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 383 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:12,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:12,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-11-27 20:35:12,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:13,573 INFO L124 PetriNetUnfolderBase]: 648/5839 cut-off events. [2024-11-27 20:35:13,574 INFO L125 PetriNetUnfolderBase]: For 74/82 co-relation queries the response was YES. [2024-11-27 20:35:13,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6872 conditions, 5839 events. 648/5839 cut-off events. For 74/82 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 64362 event pairs, 68 based on Foata normal form. 1/5262 useless extension candidates. Maximal degree in co-relation 5944. Up to 585 conditions per place. [2024-11-27 20:35:13,635 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 19 selfloop transitions, 4 changer transitions 0/387 dead transitions. [2024-11-27 20:35:13,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 387 transitions, 928 flow [2024-11-27 20:35:13,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:13,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1233 transitions. [2024-11-27 20:35:13,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9558139534883721 [2024-11-27 20:35:13,639 INFO L175 Difference]: Start difference. First operand has 372 places, 383 transitions, 870 flow. Second operand 3 states and 1233 transitions. [2024-11-27 20:35:13,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 387 transitions, 928 flow [2024-11-27 20:35:13,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 387 transitions, 924 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:35:13,649 INFO L231 Difference]: Finished difference. Result has 369 places, 383 transitions, 886 flow [2024-11-27 20:35:13,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=369, PETRI_TRANSITIONS=383} [2024-11-27 20:35:13,651 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -23 predicate places. [2024-11-27 20:35:13,651 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 383 transitions, 886 flow [2024-11-27 20:35:13,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:13,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:13,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:13,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 20:35:13,652 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:13,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:13,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1473838492, now seen corresponding path program 1 times [2024-11-27 20:35:13,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:13,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167193828] [2024-11-27 20:35:13,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:13,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:13,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:13,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167193828] [2024-11-27 20:35:13,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167193828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:13,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:13,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:35:13,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812945669] [2024-11-27 20:35:13,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:13,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:13,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:13,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:13,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:13,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-27 20:35:13,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 383 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:13,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:13,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-27 20:35:13,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:14,492 INFO L124 PetriNetUnfolderBase]: 413/3953 cut-off events. [2024-11-27 20:35:14,492 INFO L125 PetriNetUnfolderBase]: For 107/136 co-relation queries the response was YES. [2024-11-27 20:35:14,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4768 conditions, 3953 events. 413/3953 cut-off events. For 107/136 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 39234 event pairs, 64 based on Foata normal form. 2/3510 useless extension candidates. Maximal degree in co-relation 4191. Up to 287 conditions per place. [2024-11-27 20:35:14,525 INFO L140 encePairwiseOnDemand]: 426/430 looper letters, 14 selfloop transitions, 3 changer transitions 0/387 dead transitions. [2024-11-27 20:35:14,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 387 transitions, 930 flow [2024-11-27 20:35:14,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-11-27 20:35:14,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9627906976744186 [2024-11-27 20:35:14,529 INFO L175 Difference]: Start difference. First operand has 369 places, 383 transitions, 886 flow. Second operand 3 states and 1242 transitions. [2024-11-27 20:35:14,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 387 transitions, 930 flow [2024-11-27 20:35:14,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 387 transitions, 930 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-27 20:35:14,537 INFO L231 Difference]: Finished difference. Result has 373 places, 385 transitions, 908 flow [2024-11-27 20:35:14,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=373, PETRI_TRANSITIONS=385} [2024-11-27 20:35:14,538 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -19 predicate places. [2024-11-27 20:35:14,538 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 385 transitions, 908 flow [2024-11-27 20:35:14,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:14,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:14,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:14,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 20:35:14,540 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:14,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:14,541 INFO L85 PathProgramCache]: Analyzing trace with hash 853128936, now seen corresponding path program 1 times [2024-11-27 20:35:14,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:14,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038436142] [2024-11-27 20:35:14,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:14,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:14,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:14,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038436142] [2024-11-27 20:35:14,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038436142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:14,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:14,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:14,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833921423] [2024-11-27 20:35:14,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:14,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:14,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:14,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:14,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:14,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-27 20:35:14,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 385 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:14,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:14,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-27 20:35:14,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:15,516 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1183] L56-51-->L56-52: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet24#1][257], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), Black: 451#true, 457#(= |#race~sort_label_2~0| 0), 302#L56-52true, 479#true, Black: 455#true, 254#L76true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork1_#t~short11#1|), 474#true, Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 470#true, Black: 438#true, Black: 442#true, Black: 476#(not |thread3Thread1of1ForFork2_#t~short19#1|), 453#(= |#race~sort_label_0~0| 0)]) [2024-11-27 20:35:15,518 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2024-11-27 20:35:15,518 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-27 20:35:15,518 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-11-27 20:35:15,518 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-11-27 20:35:15,569 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1183] L56-51-->L56-52: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet24#1][257], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), Black: 451#true, 457#(= |#race~sort_label_2~0| 0), 302#L56-52true, 479#true, Black: 455#true, 254#L76true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 470#true, Black: 438#true, Black: 442#true, Black: 474#true, 476#(not |thread3Thread1of1ForFork2_#t~short19#1|), 453#(= |#race~sort_label_0~0| 0)]) [2024-11-27 20:35:15,570 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is not cut-off event [2024-11-27 20:35:15,570 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2024-11-27 20:35:15,570 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2024-11-27 20:35:15,570 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is not cut-off event [2024-11-27 20:35:15,594 INFO L124 PetriNetUnfolderBase]: 392/3250 cut-off events. [2024-11-27 20:35:15,594 INFO L125 PetriNetUnfolderBase]: For 208/236 co-relation queries the response was YES. [2024-11-27 20:35:15,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4302 conditions, 3250 events. 392/3250 cut-off events. For 208/236 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 31507 event pairs, 48 based on Foata normal form. 2/2986 useless extension candidates. Maximal degree in co-relation 3700. Up to 248 conditions per place. [2024-11-27 20:35:15,666 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 12 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2024-11-27 20:35:15,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 386 transitions, 940 flow [2024-11-27 20:35:15,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2024-11-27 20:35:15,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9604651162790697 [2024-11-27 20:35:15,669 INFO L175 Difference]: Start difference. First operand has 373 places, 385 transitions, 908 flow. Second operand 3 states and 1239 transitions. [2024-11-27 20:35:15,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 386 transitions, 940 flow [2024-11-27 20:35:15,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 386 transitions, 934 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:35:15,680 INFO L231 Difference]: Finished difference. Result has 372 places, 384 transitions, 904 flow [2024-11-27 20:35:15,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=372, PETRI_TRANSITIONS=384} [2024-11-27 20:35:15,681 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -20 predicate places. [2024-11-27 20:35:15,681 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 384 transitions, 904 flow [2024-11-27 20:35:15,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:15,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:15,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:15,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 20:35:15,682 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:15,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2052204957, now seen corresponding path program 1 times [2024-11-27 20:35:15,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:15,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322611] [2024-11-27 20:35:15,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:15,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:15,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322611] [2024-11-27 20:35:15,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:15,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:15,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:15,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637215610] [2024-11-27 20:35:15,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:15,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:15,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:15,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:15,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:15,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 430 [2024-11-27 20:35:15,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 384 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:15,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:15,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 430 [2024-11-27 20:35:15,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:16,770 INFO L124 PetriNetUnfolderBase]: 388/4741 cut-off events. [2024-11-27 20:35:16,770 INFO L125 PetriNetUnfolderBase]: For 7/17 co-relation queries the response was YES. [2024-11-27 20:35:16,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5737 conditions, 4741 events. 388/4741 cut-off events. For 7/17 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 50231 event pairs, 11 based on Foata normal form. 0/4355 useless extension candidates. Maximal degree in co-relation 5160. Up to 210 conditions per place. [2024-11-27 20:35:16,814 INFO L140 encePairwiseOnDemand]: 428/430 looper letters, 8 selfloop transitions, 1 changer transitions 0/383 dead transitions. [2024-11-27 20:35:16,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 383 transitions, 920 flow [2024-11-27 20:35:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1243 transitions. [2024-11-27 20:35:16,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9635658914728682 [2024-11-27 20:35:16,817 INFO L175 Difference]: Start difference. First operand has 372 places, 384 transitions, 904 flow. Second operand 3 states and 1243 transitions. [2024-11-27 20:35:16,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 383 transitions, 920 flow [2024-11-27 20:35:16,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 383 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:35:16,827 INFO L231 Difference]: Finished difference. Result has 371 places, 383 transitions, 900 flow [2024-11-27 20:35:16,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=371, PETRI_TRANSITIONS=383} [2024-11-27 20:35:16,828 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -21 predicate places. [2024-11-27 20:35:16,828 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 383 transitions, 900 flow [2024-11-27 20:35:16,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:16,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:16,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:16,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 20:35:16,830 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:16,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:16,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2069889432, now seen corresponding path program 1 times [2024-11-27 20:35:16,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:16,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586590098] [2024-11-27 20:35:16,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:16,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:16,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:16,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586590098] [2024-11-27 20:35:16,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586590098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:16,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:16,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:16,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047809627] [2024-11-27 20:35:16,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:16,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:16,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:16,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:16,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:16,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-27 20:35:16,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 383 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:16,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:16,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-27 20:35:16,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:17,800 INFO L124 PetriNetUnfolderBase]: 447/5342 cut-off events. [2024-11-27 20:35:17,800 INFO L125 PetriNetUnfolderBase]: For 11/35 co-relation queries the response was YES. [2024-11-27 20:35:17,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6362 conditions, 5342 events. 447/5342 cut-off events. For 11/35 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 58440 event pairs, 25 based on Foata normal form. 0/4912 useless extension candidates. Maximal degree in co-relation 6230. Up to 193 conditions per place. [2024-11-27 20:35:17,870 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 10 selfloop transitions, 1 changer transitions 0/381 dead transitions. [2024-11-27 20:35:17,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 381 transitions, 918 flow [2024-11-27 20:35:17,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2024-11-27 20:35:17,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9589147286821705 [2024-11-27 20:35:17,873 INFO L175 Difference]: Start difference. First operand has 371 places, 383 transitions, 900 flow. Second operand 3 states and 1237 transitions. [2024-11-27 20:35:17,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 381 transitions, 918 flow [2024-11-27 20:35:17,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 381 transitions, 917 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:35:17,880 INFO L231 Difference]: Finished difference. Result has 370 places, 381 transitions, 897 flow [2024-11-27 20:35:17,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=370, PETRI_TRANSITIONS=381} [2024-11-27 20:35:17,881 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2024-11-27 20:35:17,881 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 381 transitions, 897 flow [2024-11-27 20:35:17,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:17,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:35:17,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:17,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 20:35:17,883 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-11-27 20:35:17,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:35:17,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1388669785, now seen corresponding path program 1 times [2024-11-27 20:35:17,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:35:17,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753110255] [2024-11-27 20:35:17,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:35:17,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:35:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:35:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:35:17,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:35:17,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753110255] [2024-11-27 20:35:17,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753110255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:35:17,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:35:17,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:35:17,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809361997] [2024-11-27 20:35:17,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:35:17,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:35:17,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:35:17,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:35:17,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:35:17,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-11-27 20:35:17,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 381 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:17,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:35:17,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-11-27 20:35:17,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:35:18,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1188] L56-52-->L56-53: Formula: (= |v_#race~result_8~0_1| |v_thread3Thread1of1ForFork2_#t~nondet24#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_3|, #race~result_8~0=|v_#race~result_8~0_1|} AuxVars[] AssignedVars[#race~result_8~0][269], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), 485#true, Black: 451#true, 457#(= |#race~sort_label_2~0| 0), Black: 455#true, 254#L76true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork1_#t~short11#1|), 488#true, Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 470#true, Black: 438#true, Black: 442#true, 393#L56-53true, Black: 476#(not |thread3Thread1of1ForFork2_#t~short19#1|), 453#(= |#race~sort_label_0~0| 0)]) [2024-11-27 20:35:18,383 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2024-11-27 20:35:18,383 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2024-11-27 20:35:18,383 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-11-27 20:35:18,383 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2024-11-27 20:35:18,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1188] L56-52-->L56-53: Formula: (= |v_#race~result_8~0_1| |v_thread3Thread1of1ForFork2_#t~nondet24#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_3|, #race~result_8~0=|v_#race~result_8~0_1|} AuxVars[] AssignedVars[#race~result_8~0][269], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), 485#true, Black: 451#true, 457#(= |#race~sort_label_2~0| 0), Black: 455#true, 254#L76true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork1_#t~short11#1|), 488#true, Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 438#true, Black: 470#true, Black: 474#true, Black: 442#true, 393#L56-53true, 453#(= |#race~sort_label_0~0| 0)]) [2024-11-27 20:35:18,389 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is not cut-off event [2024-11-27 20:35:18,389 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-11-27 20:35:18,389 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-11-27 20:35:18,389 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-11-27 20:35:18,401 INFO L124 PetriNetUnfolderBase]: 285/2989 cut-off events. [2024-11-27 20:35:18,402 INFO L125 PetriNetUnfolderBase]: For 38/52 co-relation queries the response was YES. [2024-11-27 20:35:18,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3652 conditions, 2989 events. 285/2989 cut-off events. For 38/52 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 27973 event pairs, 33 based on Foata normal form. 5/2739 useless extension candidates. Maximal degree in co-relation 3575. Up to 150 conditions per place. [2024-11-27 20:35:18,438 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 0 selfloop transitions, 0 changer transitions 379/379 dead transitions. [2024-11-27 20:35:18,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 379 transitions, 913 flow [2024-11-27 20:35:18,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:35:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:35:18,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1236 transitions. [2024-11-27 20:35:18,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.958139534883721 [2024-11-27 20:35:18,440 INFO L175 Difference]: Start difference. First operand has 370 places, 381 transitions, 897 flow. Second operand 3 states and 1236 transitions. [2024-11-27 20:35:18,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 379 transitions, 913 flow [2024-11-27 20:35:18,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 379 transitions, 912 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:35:18,444 INFO L231 Difference]: Finished difference. Result has 369 places, 0 transitions, 0 flow [2024-11-27 20:35:18,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=369, PETRI_TRANSITIONS=0} [2024-11-27 20:35:18,444 INFO L279 CegarLoopForPetriNet]: 392 programPoint places, -23 predicate places. [2024-11-27 20:35:18,445 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 0 transitions, 0 flow [2024-11-27 20:35:18,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:35:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (79 of 80 remaining) [2024-11-27 20:35:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (78 of 80 remaining) [2024-11-27 20:35:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (77 of 80 remaining) [2024-11-27 20:35:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (76 of 80 remaining) [2024-11-27 20:35:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 80 remaining) [2024-11-27 20:35:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (74 of 80 remaining) [2024-11-27 20:35:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (73 of 80 remaining) [2024-11-27 20:35:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (72 of 80 remaining) [2024-11-27 20:35:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (71 of 80 remaining) [2024-11-27 20:35:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (70 of 80 remaining) [2024-11-27 20:35:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 80 remaining) [2024-11-27 20:35:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (68 of 80 remaining) [2024-11-27 20:35:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (67 of 80 remaining) [2024-11-27 20:35:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (66 of 80 remaining) [2024-11-27 20:35:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (65 of 80 remaining) [2024-11-27 20:35:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (64 of 80 remaining) [2024-11-27 20:35:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (63 of 80 remaining) [2024-11-27 20:35:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 80 remaining) [2024-11-27 20:35:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (61 of 80 remaining) [2024-11-27 20:35:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (60 of 80 remaining) [2024-11-27 20:35:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (59 of 80 remaining) [2024-11-27 20:35:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (58 of 80 remaining) [2024-11-27 20:35:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (57 of 80 remaining) [2024-11-27 20:35:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (56 of 80 remaining) [2024-11-27 20:35:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (55 of 80 remaining) [2024-11-27 20:35:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (54 of 80 remaining) [2024-11-27 20:35:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (53 of 80 remaining) [2024-11-27 20:35:18,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (52 of 80 remaining) [2024-11-27 20:35:18,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (51 of 80 remaining) [2024-11-27 20:35:18,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (50 of 80 remaining) [2024-11-27 20:35:18,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (49 of 80 remaining) [2024-11-27 20:35:18,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (48 of 80 remaining) [2024-11-27 20:35:18,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (47 of 80 remaining) [2024-11-27 20:35:18,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (46 of 80 remaining) [2024-11-27 20:35:18,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 80 remaining) [2024-11-27 20:35:18,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 80 remaining) [2024-11-27 20:35:18,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 80 remaining) [2024-11-27 20:35:18,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 80 remaining) [2024-11-27 20:35:18,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 80 remaining) [2024-11-27 20:35:18,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (40 of 80 remaining) [2024-11-27 20:35:18,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 80 remaining) [2024-11-27 20:35:18,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 80 remaining) [2024-11-27 20:35:18,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (37 of 80 remaining) [2024-11-27 20:35:18,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (36 of 80 remaining) [2024-11-27 20:35:18,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 80 remaining) [2024-11-27 20:35:18,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 80 remaining) [2024-11-27 20:35:18,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 80 remaining) [2024-11-27 20:35:18,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (32 of 80 remaining) [2024-11-27 20:35:18,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (31 of 80 remaining) [2024-11-27 20:35:18,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 80 remaining) [2024-11-27 20:35:18,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (29 of 80 remaining) [2024-11-27 20:35:18,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 80 remaining) [2024-11-27 20:35:18,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (27 of 80 remaining) [2024-11-27 20:35:18,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (26 of 80 remaining) [2024-11-27 20:35:18,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 80 remaining) [2024-11-27 20:35:18,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 80 remaining) [2024-11-27 20:35:18,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 80 remaining) [2024-11-27 20:35:18,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (22 of 80 remaining) [2024-11-27 20:35:18,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 80 remaining) [2024-11-27 20:35:18,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 80 remaining) [2024-11-27 20:35:18,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 80 remaining) [2024-11-27 20:35:18,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 80 remaining) [2024-11-27 20:35:18,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 80 remaining) [2024-11-27 20:35:18,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (16 of 80 remaining) [2024-11-27 20:35:18,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 80 remaining) [2024-11-27 20:35:18,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (14 of 80 remaining) [2024-11-27 20:35:18,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 80 remaining) [2024-11-27 20:35:18,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (12 of 80 remaining) [2024-11-27 20:35:18,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (11 of 80 remaining) [2024-11-27 20:35:18,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (10 of 80 remaining) [2024-11-27 20:35:18,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (9 of 80 remaining) [2024-11-27 20:35:18,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (8 of 80 remaining) [2024-11-27 20:35:18,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (7 of 80 remaining) [2024-11-27 20:35:18,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (6 of 80 remaining) [2024-11-27 20:35:18,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (5 of 80 remaining) [2024-11-27 20:35:18,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 80 remaining) [2024-11-27 20:35:18,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 80 remaining) [2024-11-27 20:35:18,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (2 of 80 remaining) [2024-11-27 20:35:18,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 80 remaining) [2024-11-27 20:35:18,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (0 of 80 remaining) [2024-11-27 20:35:18,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-27 20:35:18,456 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:35:18,463 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-27 20:35:18,463 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:35:18,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:35:18 BasicIcfg [2024-11-27 20:35:18,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:35:18,470 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:35:18,470 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:35:18,470 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:35:18,471 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:35:01" (3/4) ... [2024-11-27 20:35:18,473 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-27 20:35:18,476 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-27 20:35:18,477 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-27 20:35:18,477 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-27 20:35:18,482 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-27 20:35:18,482 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-27 20:35:18,482 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-27 20:35:18,482 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-27 20:35:18,568 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 20:35:18,568 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 20:35:18,568 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:35:18,570 INFO L158 Benchmark]: Toolchain (without parser) took 18162.09ms. Allocated memory was 117.4MB in the beginning and 947.9MB in the end (delta: 830.5MB). Free memory was 92.6MB in the beginning and 630.2MB in the end (delta: -537.6MB). Peak memory consumption was 288.3MB. Max. memory is 16.1GB. [2024-11-27 20:35:18,570 INFO L158 Benchmark]: CDTParser took 1.78ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:35:18,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.81ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 80.3MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:35:18,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.43ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 77.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:35:18,572 INFO L158 Benchmark]: Boogie Preprocessor took 59.19ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 76.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:35:18,572 INFO L158 Benchmark]: RCFGBuilder took 977.42ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 48.8MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 20:35:18,573 INFO L158 Benchmark]: TraceAbstraction took 16551.55ms. Allocated memory was 117.4MB in the beginning and 947.9MB in the end (delta: 830.5MB). Free memory was 48.3MB in the beginning and 634.4MB in the end (delta: -586.2MB). Peak memory consumption was 615.4MB. Max. memory is 16.1GB. [2024-11-27 20:35:18,574 INFO L158 Benchmark]: Witness Printer took 98.46ms. Allocated memory is still 947.9MB. Free memory was 634.4MB in the beginning and 630.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:35:18,575 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.78ms. Allocated memory is still 117.4MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.81ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 80.3MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.43ms. Allocated memory is still 117.4MB. Free memory was 80.3MB in the beginning and 77.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.19ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 76.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 977.42ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 48.8MB in the end (delta: 27.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16551.55ms. Allocated memory was 117.4MB in the beginning and 947.9MB in the end (delta: 830.5MB). Free memory was 48.3MB in the beginning and 634.4MB in the end (delta: -586.2MB). Peak memory consumption was 615.4MB. Max. memory is 16.1GB. * Witness Printer took 98.46ms. Allocated memory is still 947.9MB. Free memory was 634.4MB in the beginning and 630.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: 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, 674 locations, 80 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.2s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 550 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 648 IncrementalHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 131 mSDtfsCounter, 648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=908occurred in iteration=17, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1874 NumberOfCodeBlocks, 1874 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1853 ConstructedInterpolants, 0 QuantifiedInterpolants, 1892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 44 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-27 20:35:18,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8329d9f9-5f1b-4ea2-9bae-1e720a7be8fe/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE