./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 7850c8f92b7e0b0b866687e8f3ea719169cacbc5985a977f15b280bf9bb53b5b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:46:33,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:46:33,378 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-06 22:46:33,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:46:33,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:46:33,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:46:33,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:46:33,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:46:33,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:46:33,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:46:33,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:46:33,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:46:33,444 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:46:33,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:46:33,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:46:33,447 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:46:33,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:46:33,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:46:33,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:46:33,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:46:33,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:46:33,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:46:33,451 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-06 22:46:33,451 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:46:33,452 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:46:33,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:46:33,453 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:46:33,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:46:33,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:46:33,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:46:33,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:33,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:46:33,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:46:33,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:46:33,458 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:46:33,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:46:33,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:46:33,459 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:46:33,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:46:33,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:46:33,460 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:46:33,461 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 7850c8f92b7e0b0b866687e8f3ea719169cacbc5985a977f15b280bf9bb53b5b [2023-11-06 22:46:33,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:46:33,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:46:33,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:46:33,842 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:46:33,843 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:46:33,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2023-11-06 22:46:36,949 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:46:37,161 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:46:37,161 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2023-11-06 22:46:37,170 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP/data/fe0e11d97/42cc1930408447318175686857d9378f/FLAGfe7644ffb [2023-11-06 22:46:37,188 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP/data/fe0e11d97/42cc1930408447318175686857d9378f [2023-11-06 22:46:37,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:46:37,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:46:37,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:46:37,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:46:37,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:46:37,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bda53c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37, skipping insertion in model container [2023-11-06 22:46:37,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,233 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:46:37,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:46:37,491 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:46:37,534 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:46:37,553 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:46:37,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37 WrapperNode [2023-11-06 22:46:37,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:46:37,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:46:37,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:46:37,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:46:37,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,625 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 328 [2023-11-06 22:46:37,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:46:37,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:46:37,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:46:37,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:46:37,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,648 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:46:37,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:46:37,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:46:37,679 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:46:37,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (1/1) ... [2023-11-06 22:46:37,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:37,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:46:37,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:46:37,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:46:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:46:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-06 22:46:37,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-06 22:46:37,794 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-06 22:46:37,794 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-06 22:46:37,794 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-06 22:46:37,794 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-06 22:46:37,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:46:37,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:46:37,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:46:37,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:46:37,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:46:37,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:46:37,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:46:37,800 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:46:37,982 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:46:37,985 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:46:38,617 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:46:38,635 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:46:38,637 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:46:38,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:38 BoogieIcfgContainer [2023-11-06 22:46:38,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:46:38,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:46:38,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:46:38,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:46:38,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:46:37" (1/3) ... [2023-11-06 22:46:38,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d9d311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:38, skipping insertion in model container [2023-11-06 22:46:38,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:37" (2/3) ... [2023-11-06 22:46:38,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d9d311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:38, skipping insertion in model container [2023-11-06 22:46:38,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:38" (3/3) ... [2023-11-06 22:46:38,686 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2023-11-06 22:46:38,713 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:46:38,724 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:46:38,724 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-11-06 22:46:38,724 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:46:38,964 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-06 22:46:39,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 413 places, 424 transitions, 869 flow [2023-11-06 22:46:39,237 INFO L124 PetriNetUnfolderBase]: 21/421 cut-off events. [2023-11-06 22:46:39,237 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 22:46:39,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 421 events. 21/421 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1117 event pairs, 0 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 275. Up to 2 conditions per place. [2023-11-06 22:46:39,252 INFO L82 GeneralOperation]: Start removeDead. Operand has 413 places, 424 transitions, 869 flow [2023-11-06 22:46:39,277 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 385 places, 394 transitions, 806 flow [2023-11-06 22:46:39,281 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:46:39,297 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 385 places, 394 transitions, 806 flow [2023-11-06 22:46:39,302 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 385 places, 394 transitions, 806 flow [2023-11-06 22:46:39,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 385 places, 394 transitions, 806 flow [2023-11-06 22:46:39,472 INFO L124 PetriNetUnfolderBase]: 19/394 cut-off events. [2023-11-06 22:46:39,473 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 22:46:39,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 394 events. 19/394 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1102 event pairs, 0 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 275. Up to 2 conditions per place. [2023-11-06 22:46:39,514 INFO L119 LiptonReduction]: Number of co-enabled transitions 48822 [2023-11-06 22:46:51,746 INFO L134 LiptonReduction]: Checked pairs total: 167397 [2023-11-06 22:46:51,746 INFO L136 LiptonReduction]: Total number of compositions: 393 [2023-11-06 22:46:51,763 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:46:51,771 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@415f028b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:46:51,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2023-11-06 22:46:51,773 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:46:51,773 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:46:51,773 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:46:51,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:51,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:46:51,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-06 22:46:51,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1586, now seen corresponding path program 1 times [2023-11-06 22:46:51,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:51,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789700245] [2023-11-06 22:46:51,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:51,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:51,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:51,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:51,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789700245] [2023-11-06 22:46:51,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789700245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:51,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:51,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:46:51,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944843594] [2023-11-06 22:46:51,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:51,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:46:51,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:51,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:46:51,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:46:51,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 817 [2023-11-06 22:46:51,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 115 transitions, 248 flow. Second operand has 2 states, 2 states have (on average 410.5) internal successors, (821), 2 states have internal predecessors, (821), 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) [2023-11-06 22:46:51,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:51,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 817 [2023-11-06 22:46:51,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:53,513 INFO L124 PetriNetUnfolderBase]: 6016/10937 cut-off events. [2023-11-06 22:46:53,514 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2023-11-06 22:46:53,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19051 conditions, 10937 events. 6016/10937 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 88540 event pairs, 3768 based on Foata normal form. 311/8411 useless extension candidates. Maximal degree in co-relation 17675. Up to 7837 conditions per place. [2023-11-06 22:46:53,661 INFO L140 encePairwiseOnDemand]: 799/817 looper letters, 47 selfloop transitions, 0 changer transitions 1/97 dead transitions. [2023-11-06 22:46:53,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 308 flow [2023-11-06 22:46:53,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:46:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:46:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 886 transitions. [2023-11-06 22:46:53,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5422276621787026 [2023-11-06 22:46:53,690 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 886 transitions. [2023-11-06 22:46:53,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 886 transitions. [2023-11-06 22:46:53,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:53,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 886 transitions. [2023-11-06 22:46:53,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 443.0) internal successors, (886), 2 states have internal predecessors, (886), 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) [2023-11-06 22:46:53,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 817.0) internal successors, (2451), 3 states have internal predecessors, (2451), 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) [2023-11-06 22:46:53,725 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 817.0) internal successors, (2451), 3 states have internal predecessors, (2451), 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) [2023-11-06 22:46:53,729 INFO L175 Difference]: Start difference. First operand has 111 places, 115 transitions, 248 flow. Second operand 2 states and 886 transitions. [2023-11-06 22:46:53,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 308 flow [2023-11-06 22:46:53,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 97 transitions, 296 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-06 22:46:53,751 INFO L231 Difference]: Finished difference. Result has 90 places, 96 transitions, 197 flow [2023-11-06 22:46:53,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=817, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=197, PETRI_PLACES=90, PETRI_TRANSITIONS=96} [2023-11-06 22:46:53,760 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -21 predicate places. [2023-11-06 22:46:53,760 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 197 flow [2023-11-06 22:46:53,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 410.5) internal successors, (821), 2 states have internal predecessors, (821), 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) [2023-11-06 22:46:53,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:53,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 22:46:53,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:46:53,763 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-06 22:46:53,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:53,764 INFO L85 PathProgramCache]: Analyzing trace with hash 48823639, now seen corresponding path program 1 times [2023-11-06 22:46:53,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:53,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565166979] [2023-11-06 22:46:53,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:53,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:53,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:53,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565166979] [2023-11-06 22:46:53,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565166979] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:53,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:53,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:46:53,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183548222] [2023-11-06 22:46:53,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:53,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:53,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:53,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:53,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:53,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 817 [2023-11-06 22:46:53,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 96 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 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) [2023-11-06 22:46:53,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:53,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 817 [2023-11-06 22:46:53,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:55,587 INFO L124 PetriNetUnfolderBase]: 7789/14365 cut-off events. [2023-11-06 22:46:55,587 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-06 22:46:55,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24659 conditions, 14365 events. 7789/14365 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 120762 event pairs, 3680 based on Foata normal form. 0/11096 useless extension candidates. Maximal degree in co-relation 24656. Up to 10111 conditions per place. [2023-11-06 22:46:55,714 INFO L140 encePairwiseOnDemand]: 813/817 looper letters, 67 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2023-11-06 22:46:55,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 113 transitions, 371 flow [2023-11-06 22:46:55,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1280 transitions. [2023-11-06 22:46:55,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222358221134231 [2023-11-06 22:46:55,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1280 transitions. [2023-11-06 22:46:55,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1280 transitions. [2023-11-06 22:46:55,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:55,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1280 transitions. [2023-11-06 22:46:55,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.6666666666667) internal successors, (1280), 3 states have internal predecessors, (1280), 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) [2023-11-06 22:46:55,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:46:55,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:46:55,744 INFO L175 Difference]: Start difference. First operand has 90 places, 96 transitions, 197 flow. Second operand 3 states and 1280 transitions. [2023-11-06 22:46:55,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 113 transitions, 371 flow [2023-11-06 22:46:55,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 113 transitions, 371 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:46:55,751 INFO L231 Difference]: Finished difference. Result has 90 places, 96 transitions, 207 flow [2023-11-06 22:46:55,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=817, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=90, PETRI_TRANSITIONS=96} [2023-11-06 22:46:55,754 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -21 predicate places. [2023-11-06 22:46:55,755 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 207 flow [2023-11-06 22:46:55,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 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) [2023-11-06 22:46:55,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:55,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:46:55,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:46:55,765 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-06 22:46:55,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:55,768 INFO L85 PathProgramCache]: Analyzing trace with hash -309222792, now seen corresponding path program 1 times [2023-11-06 22:46:55,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:55,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746337598] [2023-11-06 22:46:55,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:55,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:55,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:55,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:55,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746337598] [2023-11-06 22:46:55,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746337598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:55,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:55,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:46:55,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993178326] [2023-11-06 22:46:55,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:55,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:55,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:55,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:55,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:55,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 817 [2023-11-06 22:46:55,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 96 transitions, 207 flow. Second operand has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 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) [2023-11-06 22:46:55,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:55,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 817 [2023-11-06 22:46:55,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:57,634 INFO L124 PetriNetUnfolderBase]: 8945/16183 cut-off events. [2023-11-06 22:46:57,634 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-06 22:46:57,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28107 conditions, 16183 events. 8945/16183 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 843. Compared 137652 event pairs, 1676 based on Foata normal form. 0/12758 useless extension candidates. Maximal degree in co-relation 28103. Up to 11590 conditions per place. [2023-11-06 22:46:57,770 INFO L140 encePairwiseOnDemand]: 811/817 looper letters, 70 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2023-11-06 22:46:57,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 115 transitions, 393 flow [2023-11-06 22:46:57,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:57,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1276 transitions. [2023-11-06 22:46:57,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5206038351693186 [2023-11-06 22:46:57,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1276 transitions. [2023-11-06 22:46:57,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1276 transitions. [2023-11-06 22:46:57,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:57,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1276 transitions. [2023-11-06 22:46:57,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 425.3333333333333) internal successors, (1276), 3 states have internal predecessors, (1276), 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) [2023-11-06 22:46:57,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:46:57,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:46:57,796 INFO L175 Difference]: Start difference. First operand has 90 places, 96 transitions, 207 flow. Second operand 3 states and 1276 transitions. [2023-11-06 22:46:57,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 115 transitions, 393 flow [2023-11-06 22:46:57,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 115 transitions, 393 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:46:57,805 INFO L231 Difference]: Finished difference. Result has 90 places, 96 transitions, 222 flow [2023-11-06 22:46:57,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=817, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=90, PETRI_TRANSITIONS=96} [2023-11-06 22:46:57,808 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -21 predicate places. [2023-11-06 22:46:57,809 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 222 flow [2023-11-06 22:46:57,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 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) [2023-11-06 22:46:57,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:57,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:57,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:46:57,815 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-06 22:46:57,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:57,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1477092926, now seen corresponding path program 1 times [2023-11-06 22:46:57,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:57,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343453602] [2023-11-06 22:46:57,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:57,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:57,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:57,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343453602] [2023-11-06 22:46:57,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343453602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:57,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:57,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:46:57,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614920088] [2023-11-06 22:46:57,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:57,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:57,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:57,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:57,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:57,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 817 [2023-11-06 22:46:57,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 96 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 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) [2023-11-06 22:46:57,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:57,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 817 [2023-11-06 22:46:57,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:46:59,533 INFO L124 PetriNetUnfolderBase]: 6676/12304 cut-off events. [2023-11-06 22:46:59,534 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-06 22:46:59,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21225 conditions, 12304 events. 6676/12304 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 102565 event pairs, 3714 based on Foata normal form. 0/9162 useless extension candidates. Maximal degree in co-relation 21220. Up to 7166 conditions per place. [2023-11-06 22:46:59,631 INFO L140 encePairwiseOnDemand]: 810/817 looper letters, 70 selfloop transitions, 6 changer transitions 0/124 dead transitions. [2023-11-06 22:46:59,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 124 transitions, 432 flow [2023-11-06 22:46:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:46:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:46:59,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1289 transitions. [2023-11-06 22:46:59,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5259077927376581 [2023-11-06 22:46:59,637 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1289 transitions. [2023-11-06 22:46:59,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1289 transitions. [2023-11-06 22:46:59,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:46:59,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1289 transitions. [2023-11-06 22:46:59,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.6666666666667) internal successors, (1289), 3 states have internal predecessors, (1289), 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) [2023-11-06 22:46:59,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:46:59,654 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:46:59,655 INFO L175 Difference]: Start difference. First operand has 90 places, 96 transitions, 222 flow. Second operand 3 states and 1289 transitions. [2023-11-06 22:46:59,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 124 transitions, 432 flow [2023-11-06 22:46:59,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 124 transitions, 432 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:46:59,659 INFO L231 Difference]: Finished difference. Result has 91 places, 95 transitions, 232 flow [2023-11-06 22:46:59,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=817, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=91, PETRI_TRANSITIONS=95} [2023-11-06 22:46:59,661 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -20 predicate places. [2023-11-06 22:46:59,662 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 95 transitions, 232 flow [2023-11-06 22:46:59,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 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) [2023-11-06 22:46:59,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:46:59,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:46:59,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:46:59,664 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-06 22:46:59,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash -810319794, now seen corresponding path program 1 times [2023-11-06 22:46:59,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:59,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838568590] [2023-11-06 22:46:59,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:59,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:59,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:46:59,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:46:59,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838568590] [2023-11-06 22:46:59,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838568590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:46:59,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:46:59,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:46:59,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787319002] [2023-11-06 22:46:59,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:46:59,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:46:59,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:46:59,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:46:59,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:46:59,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 817 [2023-11-06 22:46:59,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 95 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 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) [2023-11-06 22:46:59,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:46:59,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 817 [2023-11-06 22:46:59,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:01,347 INFO L124 PetriNetUnfolderBase]: 7302/13228 cut-off events. [2023-11-06 22:47:01,347 INFO L125 PetriNetUnfolderBase]: For 1431/1431 co-relation queries the response was YES. [2023-11-06 22:47:01,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24316 conditions, 13228 events. 7302/13228 cut-off events. For 1431/1431 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 108649 event pairs, 1306 based on Foata normal form. 0/10204 useless extension candidates. Maximal degree in co-relation 24310. Up to 9429 conditions per place. [2023-11-06 22:47:01,465 INFO L140 encePairwiseOnDemand]: 809/817 looper letters, 65 selfloop transitions, 4 changer transitions 0/112 dead transitions. [2023-11-06 22:47:01,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 112 transitions, 418 flow [2023-11-06 22:47:01,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1264 transitions. [2023-11-06 22:47:01,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157078743370053 [2023-11-06 22:47:01,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1264 transitions. [2023-11-06 22:47:01,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1264 transitions. [2023-11-06 22:47:01,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:01,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1264 transitions. [2023-11-06 22:47:01,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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) [2023-11-06 22:47:01,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:47:01,492 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:47:01,492 INFO L175 Difference]: Start difference. First operand has 91 places, 95 transitions, 232 flow. Second operand 3 states and 1264 transitions. [2023-11-06 22:47:01,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 112 transitions, 418 flow [2023-11-06 22:47:01,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:01,512 INFO L231 Difference]: Finished difference. Result has 88 places, 95 transitions, 240 flow [2023-11-06 22:47:01,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=817, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=88, PETRI_TRANSITIONS=95} [2023-11-06 22:47:01,516 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -23 predicate places. [2023-11-06 22:47:01,516 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 240 flow [2023-11-06 22:47:01,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 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) [2023-11-06 22:47:01,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:01,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:01,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:47:01,519 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-06 22:47:01,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:01,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1455494457, now seen corresponding path program 1 times [2023-11-06 22:47:01,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:01,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766889550] [2023-11-06 22:47:01,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:01,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:01,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:01,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766889550] [2023-11-06 22:47:01,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766889550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:01,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:01,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:47:01,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039374585] [2023-11-06 22:47:01,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:01,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:01,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:01,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:01,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:01,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 817 [2023-11-06 22:47:01,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 95 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 405.0) internal successors, (1215), 3 states have internal predecessors, (1215), 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) [2023-11-06 22:47:01,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:01,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 817 [2023-11-06 22:47:01,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:03,341 INFO L124 PetriNetUnfolderBase]: 10718/17726 cut-off events. [2023-11-06 22:47:03,341 INFO L125 PetriNetUnfolderBase]: For 794/814 co-relation queries the response was YES. [2023-11-06 22:47:03,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33830 conditions, 17726 events. 10718/17726 cut-off events. For 794/814 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 136366 event pairs, 2154 based on Foata normal form. 1/14115 useless extension candidates. Maximal degree in co-relation 33824. Up to 10656 conditions per place. [2023-11-06 22:47:03,446 INFO L140 encePairwiseOnDemand]: 813/817 looper letters, 92 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2023-11-06 22:47:03,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 132 transitions, 526 flow [2023-11-06 22:47:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1297 transitions. [2023-11-06 22:47:03,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.529171766625867 [2023-11-06 22:47:03,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1297 transitions. [2023-11-06 22:47:03,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1297 transitions. [2023-11-06 22:47:03,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:03,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1297 transitions. [2023-11-06 22:47:03,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 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) [2023-11-06 22:47:03,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:47:03,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:47:03,468 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 240 flow. Second operand 3 states and 1297 transitions. [2023-11-06 22:47:03,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 132 transitions, 526 flow [2023-11-06 22:47:03,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 132 transitions, 526 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:47:03,477 INFO L231 Difference]: Finished difference. Result has 89 places, 95 transitions, 250 flow [2023-11-06 22:47:03,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=817, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=89, PETRI_TRANSITIONS=95} [2023-11-06 22:47:03,480 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -22 predicate places. [2023-11-06 22:47:03,480 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 95 transitions, 250 flow [2023-11-06 22:47:03,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.0) internal successors, (1215), 3 states have internal predecessors, (1215), 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) [2023-11-06 22:47:03,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:03,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:03,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:47:03,482 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-06 22:47:03,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash 649905736, now seen corresponding path program 1 times [2023-11-06 22:47:03,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:03,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905439391] [2023-11-06 22:47:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:03,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:03,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905439391] [2023-11-06 22:47:03,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905439391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:03,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:03,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:47:03,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476023726] [2023-11-06 22:47:03,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:03,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:03,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:03,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:03,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:03,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 817 [2023-11-06 22:47:03,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 95 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 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) [2023-11-06 22:47:03,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:03,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 817 [2023-11-06 22:47:03,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:04,960 INFO L124 PetriNetUnfolderBase]: 8362/13952 cut-off events. [2023-11-06 22:47:04,960 INFO L125 PetriNetUnfolderBase]: For 661/699 co-relation queries the response was YES. [2023-11-06 22:47:04,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26851 conditions, 13952 events. 8362/13952 cut-off events. For 661/699 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 106881 event pairs, 4114 based on Foata normal form. 0/10700 useless extension candidates. Maximal degree in co-relation 26844. Up to 8918 conditions per place. [2023-11-06 22:47:05,042 INFO L140 encePairwiseOnDemand]: 810/817 looper letters, 74 selfloop transitions, 6 changer transitions 0/123 dead transitions. [2023-11-06 22:47:05,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 123 transitions, 472 flow [2023-11-06 22:47:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1289 transitions. [2023-11-06 22:47:05,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5259077927376581 [2023-11-06 22:47:05,055 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1289 transitions. [2023-11-06 22:47:05,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1289 transitions. [2023-11-06 22:47:05,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:05,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1289 transitions. [2023-11-06 22:47:05,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.6666666666667) internal successors, (1289), 3 states have internal predecessors, (1289), 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) [2023-11-06 22:47:05,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:47:05,072 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:47:05,072 INFO L175 Difference]: Start difference. First operand has 89 places, 95 transitions, 250 flow. Second operand 3 states and 1289 transitions. [2023-11-06 22:47:05,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 123 transitions, 472 flow [2023-11-06 22:47:05,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 123 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:47:05,077 INFO L231 Difference]: Finished difference. Result has 90 places, 94 transitions, 260 flow [2023-11-06 22:47:05,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=817, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=90, PETRI_TRANSITIONS=94} [2023-11-06 22:47:05,078 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -21 predicate places. [2023-11-06 22:47:05,078 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 94 transitions, 260 flow [2023-11-06 22:47:05,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 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) [2023-11-06 22:47:05,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:05,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:05,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:47:05,079 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-06 22:47:05,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:05,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1328202298, now seen corresponding path program 1 times [2023-11-06 22:47:05,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:05,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691209152] [2023-11-06 22:47:05,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:05,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:05,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:05,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691209152] [2023-11-06 22:47:05,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691209152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:05,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:05,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:47:05,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143527245] [2023-11-06 22:47:05,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:05,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:05,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:05,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:05,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:05,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 817 [2023-11-06 22:47:05,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 94 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 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) [2023-11-06 22:47:05,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:05,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 817 [2023-11-06 22:47:05,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:06,536 INFO L124 PetriNetUnfolderBase]: 9563/16522 cut-off events. [2023-11-06 22:47:06,537 INFO L125 PetriNetUnfolderBase]: For 2438/2456 co-relation queries the response was YES. [2023-11-06 22:47:06,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33160 conditions, 16522 events. 9563/16522 cut-off events. For 2438/2456 co-relation queries the response was YES. Maximal size of possible extension queue 944. Compared 134622 event pairs, 1908 based on Foata normal form. 0/12960 useless extension candidates. Maximal degree in co-relation 33152. Up to 9140 conditions per place. [2023-11-06 22:47:06,628 INFO L140 encePairwiseOnDemand]: 811/817 looper letters, 87 selfloop transitions, 3 changer transitions 0/130 dead transitions. [2023-11-06 22:47:06,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 130 transitions, 542 flow [2023-11-06 22:47:06,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1285 transitions. [2023-11-06 22:47:06,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5242758057935537 [2023-11-06 22:47:06,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1285 transitions. [2023-11-06 22:47:06,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1285 transitions. [2023-11-06 22:47:06,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:06,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1285 transitions. [2023-11-06 22:47:06,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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) [2023-11-06 22:47:06,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:47:06,645 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:47:06,645 INFO L175 Difference]: Start difference. First operand has 90 places, 94 transitions, 260 flow. Second operand 3 states and 1285 transitions. [2023-11-06 22:47:06,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 130 transitions, 542 flow [2023-11-06 22:47:06,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 130 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:06,800 INFO L231 Difference]: Finished difference. Result has 88 places, 94 transitions, 263 flow [2023-11-06 22:47:06,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=817, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=88, PETRI_TRANSITIONS=94} [2023-11-06 22:47:06,802 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -23 predicate places. [2023-11-06 22:47:06,802 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 94 transitions, 263 flow [2023-11-06 22:47:06,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 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) [2023-11-06 22:47:06,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:06,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:06,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:47:06,803 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-06 22:47:06,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash -796863405, now seen corresponding path program 1 times [2023-11-06 22:47:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:06,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073901732] [2023-11-06 22:47:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:06,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:06,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073901732] [2023-11-06 22:47:06,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073901732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:06,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:06,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:47:06,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133225555] [2023-11-06 22:47:06,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:06,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:06,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:06,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:06,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:06,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 817 [2023-11-06 22:47:06,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 94 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 400.0) internal successors, (1200), 3 states have internal predecessors, (1200), 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) [2023-11-06 22:47:06,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:06,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 817 [2023-11-06 22:47:06,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:08,796 INFO L124 PetriNetUnfolderBase]: 13631/21656 cut-off events. [2023-11-06 22:47:08,796 INFO L125 PetriNetUnfolderBase]: For 1773/1811 co-relation queries the response was YES. [2023-11-06 22:47:08,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44122 conditions, 21656 events. 13631/21656 cut-off events. For 1773/1811 co-relation queries the response was YES. Maximal size of possible extension queue 1032. Compared 162044 event pairs, 3323 based on Foata normal form. 0/16518 useless extension candidates. Maximal degree in co-relation 44114. Up to 12802 conditions per place. [2023-11-06 22:47:08,918 INFO L140 encePairwiseOnDemand]: 809/817 looper letters, 94 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2023-11-06 22:47:08,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 130 transitions, 557 flow [2023-11-06 22:47:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:08,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2023-11-06 22:47:08,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234598123215014 [2023-11-06 22:47:08,925 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1283 transitions. [2023-11-06 22:47:08,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1283 transitions. [2023-11-06 22:47:08,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:08,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1283 transitions. [2023-11-06 22:47:08,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 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) [2023-11-06 22:47:08,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:47:08,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:47:08,938 INFO L175 Difference]: Start difference. First operand has 88 places, 94 transitions, 263 flow. Second operand 3 states and 1283 transitions. [2023-11-06 22:47:08,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 130 transitions, 557 flow [2023-11-06 22:47:08,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 130 transitions, 557 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:47:08,942 INFO L231 Difference]: Finished difference. Result has 87 places, 94 transitions, 283 flow [2023-11-06 22:47:08,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=817, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=283, PETRI_PLACES=87, PETRI_TRANSITIONS=94} [2023-11-06 22:47:08,943 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -24 predicate places. [2023-11-06 22:47:08,944 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 94 transitions, 283 flow [2023-11-06 22:47:08,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 400.0) internal successors, (1200), 3 states have internal predecessors, (1200), 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) [2023-11-06 22:47:08,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:08,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:08,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:47:08,945 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-06 22:47:08,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:08,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1002190808, now seen corresponding path program 1 times [2023-11-06 22:47:08,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:08,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887209865] [2023-11-06 22:47:08,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:08,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:08,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:08,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887209865] [2023-11-06 22:47:08,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887209865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:08,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:08,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:47:08,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476427924] [2023-11-06 22:47:08,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:08,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:08,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:08,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:08,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:08,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 817 [2023-11-06 22:47:08,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 94 transitions, 283 flow. Second operand has 3 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 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) [2023-11-06 22:47:08,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:08,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 817 [2023-11-06 22:47:08,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:11,334 INFO L124 PetriNetUnfolderBase]: 16248/24777 cut-off events. [2023-11-06 22:47:11,334 INFO L125 PetriNetUnfolderBase]: For 2691/2761 co-relation queries the response was YES. [2023-11-06 22:47:11,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53998 conditions, 24777 events. 16248/24777 cut-off events. For 2691/2761 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 177586 event pairs, 6272 based on Foata normal form. 0/20399 useless extension candidates. Maximal degree in co-relation 53989. Up to 12924 conditions per place. [2023-11-06 22:47:11,498 INFO L140 encePairwiseOnDemand]: 813/817 looper letters, 110 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2023-11-06 22:47:11,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 145 transitions, 658 flow [2023-11-06 22:47:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1305 transitions. [2023-11-06 22:47:11,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5324357405140759 [2023-11-06 22:47:11,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1305 transitions. [2023-11-06 22:47:11,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1305 transitions. [2023-11-06 22:47:11,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:11,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1305 transitions. [2023-11-06 22:47:11,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 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) [2023-11-06 22:47:11,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:47:11,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:47:11,520 INFO L175 Difference]: Start difference. First operand has 87 places, 94 transitions, 283 flow. Second operand 3 states and 1305 transitions. [2023-11-06 22:47:11,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 145 transitions, 658 flow [2023-11-06 22:47:11,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 145 transitions, 658 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:47:11,527 INFO L231 Difference]: Finished difference. Result has 88 places, 94 transitions, 293 flow [2023-11-06 22:47:11,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=817, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=293, PETRI_PLACES=88, PETRI_TRANSITIONS=94} [2023-11-06 22:47:11,528 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -23 predicate places. [2023-11-06 22:47:11,528 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 94 transitions, 293 flow [2023-11-06 22:47:11,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 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) [2023-11-06 22:47:11,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:11,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:11,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:47:11,530 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-06 22:47:11,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:11,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1280556960, now seen corresponding path program 1 times [2023-11-06 22:47:11,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:11,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971505409] [2023-11-06 22:47:11,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:11,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:11,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971505409] [2023-11-06 22:47:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971505409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:11,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:11,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:47:11,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360325436] [2023-11-06 22:47:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:11,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:11,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:11,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:11,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:11,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 817 [2023-11-06 22:47:11,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 94 transitions, 293 flow. Second operand has 3 states, 3 states have (on average 406.0) internal successors, (1218), 3 states have internal predecessors, (1218), 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) [2023-11-06 22:47:11,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:11,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 817 [2023-11-06 22:47:11,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:14,144 INFO L124 PetriNetUnfolderBase]: 17520/26919 cut-off events. [2023-11-06 22:47:14,144 INFO L125 PetriNetUnfolderBase]: For 3400/3470 co-relation queries the response was YES. [2023-11-06 22:47:14,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59594 conditions, 26919 events. 17520/26919 cut-off events. For 3400/3470 co-relation queries the response was YES. Maximal size of possible extension queue 1165. Compared 196831 event pairs, 7389 based on Foata normal form. 0/22091 useless extension candidates. Maximal degree in co-relation 59584. Up to 15039 conditions per place. [2023-11-06 22:47:14,294 INFO L140 encePairwiseOnDemand]: 813/817 looper letters, 108 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2023-11-06 22:47:14,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 143 transitions, 656 flow [2023-11-06 22:47:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1304 transitions. [2023-11-06 22:47:14,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5320277437780497 [2023-11-06 22:47:14,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1304 transitions. [2023-11-06 22:47:14,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1304 transitions. [2023-11-06 22:47:14,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:14,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1304 transitions. [2023-11-06 22:47:14,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 434.6666666666667) internal successors, (1304), 3 states have internal predecessors, (1304), 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) [2023-11-06 22:47:14,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:47:14,312 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:47:14,312 INFO L175 Difference]: Start difference. First operand has 88 places, 94 transitions, 293 flow. Second operand 3 states and 1304 transitions. [2023-11-06 22:47:14,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 143 transitions, 656 flow [2023-11-06 22:47:14,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 143 transitions, 656 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:47:14,321 INFO L231 Difference]: Finished difference. Result has 89 places, 94 transitions, 303 flow [2023-11-06 22:47:14,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=817, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=303, PETRI_PLACES=89, PETRI_TRANSITIONS=94} [2023-11-06 22:47:14,322 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -22 predicate places. [2023-11-06 22:47:14,322 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 303 flow [2023-11-06 22:47:14,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.0) internal successors, (1218), 3 states have internal predecessors, (1218), 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) [2023-11-06 22:47:14,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:14,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:14,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:47:14,324 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2023-11-06 22:47:14,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:14,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2040410179, now seen corresponding path program 1 times [2023-11-06 22:47:14,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:14,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071057416] [2023-11-06 22:47:14,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:14,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:47:14,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:14,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071057416] [2023-11-06 22:47:14,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071057416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:14,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:14,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:47:14,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529727531] [2023-11-06 22:47:14,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:14,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:14,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:14,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:14,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:14,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 817 [2023-11-06 22:47:14,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 94 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 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) [2023-11-06 22:47:14,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:14,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 817 [2023-11-06 22:47:14,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:17,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1554] L44-26-->L44-40: Formula: (and (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_41| 2147483647) (= |v_thread1Thread1of1ForFork2_minus_#res#1_31| |v_thread1Thread1of1ForFork2_#t~ret1#1_41|) (= v_~filename_1~0_51 (+ |v_thread1Thread1of1ForFork2_minus_#res#1_31| v_~filename_4~0_49)) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ite3#1_41|) (= |v_thread1Thread1of1ForFork2_#t~nondet6#1_43| |v_#race~result_9~0_45|) (= |v_#race~filename_4~0_38| 0) (= v_~result_9~0_46 |v_thread1Thread1of1ForFork2_#t~ite5#1_37|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_45| |v_thread1Thread1of1ForFork2_#t~ite5#1_37|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ret1#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_41| |v_thread1Thread1of1ForFork2_#t~ite4#1_45|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_41| 2147483648))) InVars {~filename_1~0=v_~filename_1~0_51, ~filename_4~0=v_~filename_4~0_49, #race~filename_4~0=|v_#race~filename_4~0_38|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_41|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_35|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_29|, ~filename_1~0=v_~filename_1~0_51, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_37|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_31|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_46, ~filename_4~0=v_~filename_4~0_49, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_29|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_65|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_41|, #race~result_9~0=|v_#race~result_9~0_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_45|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_65|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|, #race~filename_4~0=|v_#race~filename_4~0_38|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, #race~result_9~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][126], [Black: 447#true, 32#L56-39true, Black: 419#true, Black: 452#true, 274#L50-40true, 286#L77-4true, 426#(= |#race~isNull_3~0| 0), 454#(= |#race~filename_8~0| 0), Black: 424#true, 459#(= |#race~filename_1~0| 0), Black: 457#true, 440#(= |#race~filename_2~0| 0), 435#(= |#race~isNull_6~0| 0), Black: 462#true, Black: 433#true, 449#(= |#race~filename_5~0| 0), 431#(= |#race~result_9~0| |thread1Thread1of1ForFork2_#t~nondet6#1|), 421#(= |#race~isNull_0~0| 0), 464#(= |#race~filename_4~0| 0), 416#true, Black: 438#true, 469#(= |#race~filename_7~0| 0)]) [2023-11-06 22:47:17,176 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-06 22:47:17,176 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:47:17,176 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 22:47:17,177 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:47:17,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1554] L44-26-->L44-40: Formula: (and (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_41| 2147483647) (= |v_thread1Thread1of1ForFork2_minus_#res#1_31| |v_thread1Thread1of1ForFork2_#t~ret1#1_41|) (= v_~filename_1~0_51 (+ |v_thread1Thread1of1ForFork2_minus_#res#1_31| v_~filename_4~0_49)) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ite3#1_41|) (= |v_thread1Thread1of1ForFork2_#t~nondet6#1_43| |v_#race~result_9~0_45|) (= |v_#race~filename_4~0_38| 0) (= v_~result_9~0_46 |v_thread1Thread1of1ForFork2_#t~ite5#1_37|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_45| |v_thread1Thread1of1ForFork2_#t~ite5#1_37|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ret1#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_41| |v_thread1Thread1of1ForFork2_#t~ite4#1_45|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_41| 2147483648))) InVars {~filename_1~0=v_~filename_1~0_51, ~filename_4~0=v_~filename_4~0_49, #race~filename_4~0=|v_#race~filename_4~0_38|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_41|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_35|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_29|, ~filename_1~0=v_~filename_1~0_51, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_37|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_31|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_46, ~filename_4~0=v_~filename_4~0_49, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_29|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_65|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_41|, #race~result_9~0=|v_#race~result_9~0_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_45|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_65|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|, #race~filename_4~0=|v_#race~filename_4~0_38|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, #race~result_9~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][126], [Black: 447#true, 32#L56-39true, Black: 419#true, Black: 452#true, 274#L50-40true, 426#(= |#race~isNull_3~0| 0), 459#(= |#race~filename_1~0| 0), 454#(= |#race~filename_8~0| 0), Black: 424#true, Black: 457#true, 440#(= |#race~filename_2~0| 0), 435#(= |#race~isNull_6~0| 0), Black: 462#true, 297#L78-6true, Black: 433#true, 449#(= |#race~filename_5~0| 0), 431#(= |#race~result_9~0| |thread1Thread1of1ForFork2_#t~nondet6#1|), 421#(= |#race~isNull_0~0| 0), 464#(= |#race~filename_4~0| 0), 416#true, Black: 438#true, 469#(= |#race~filename_7~0| 0)]) [2023-11-06 22:47:17,179 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-06 22:47:17,179 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:47:17,179 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:47:17,179 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:47:17,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1554] L44-26-->L44-40: Formula: (and (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_41| 2147483647) (= |v_thread1Thread1of1ForFork2_minus_#res#1_31| |v_thread1Thread1of1ForFork2_#t~ret1#1_41|) (= v_~filename_1~0_51 (+ |v_thread1Thread1of1ForFork2_minus_#res#1_31| v_~filename_4~0_49)) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ite3#1_41|) (= |v_thread1Thread1of1ForFork2_#t~nondet6#1_43| |v_#race~result_9~0_45|) (= |v_#race~filename_4~0_38| 0) (= v_~result_9~0_46 |v_thread1Thread1of1ForFork2_#t~ite5#1_37|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_45| |v_thread1Thread1of1ForFork2_#t~ite5#1_37|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ret1#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_41| |v_thread1Thread1of1ForFork2_#t~ite4#1_45|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_41| 2147483648))) InVars {~filename_1~0=v_~filename_1~0_51, ~filename_4~0=v_~filename_4~0_49, #race~filename_4~0=|v_#race~filename_4~0_38|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_41|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_35|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_29|, ~filename_1~0=v_~filename_1~0_51, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_37|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_31|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_46, ~filename_4~0=v_~filename_4~0_49, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_29|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_65|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_41|, #race~result_9~0=|v_#race~result_9~0_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_45|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_65|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|, #race~filename_4~0=|v_#race~filename_4~0_38|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, #race~result_9~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][126], [Black: 447#true, 32#L56-39true, Black: 419#true, Black: 452#true, 286#L77-4true, 426#(= |#race~isNull_3~0| 0), 454#(= |#race~filename_8~0| 0), Black: 424#true, 459#(= |#race~filename_1~0| 0), Black: 457#true, 440#(= |#race~filename_2~0| 0), 435#(= |#race~isNull_6~0| 0), Black: 462#true, Black: 433#true, 449#(= |#race~filename_5~0| 0), 431#(= |#race~result_9~0| |thread1Thread1of1ForFork2_#t~nondet6#1|), 242#thread2EXITtrue, 421#(= |#race~isNull_0~0| 0), 464#(= |#race~filename_4~0| 0), 416#true, Black: 438#true, 469#(= |#race~filename_7~0| 0)]) [2023-11-06 22:47:17,180 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-06 22:47:17,180 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:47:17,181 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:47:17,181 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:47:17,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1554] L44-26-->L44-40: Formula: (and (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_41| 2147483647) (= |v_thread1Thread1of1ForFork2_minus_#res#1_31| |v_thread1Thread1of1ForFork2_#t~ret1#1_41|) (= v_~filename_1~0_51 (+ |v_thread1Thread1of1ForFork2_minus_#res#1_31| v_~filename_4~0_49)) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ite3#1_41|) (= |v_thread1Thread1of1ForFork2_#t~nondet6#1_43| |v_#race~result_9~0_45|) (= |v_#race~filename_4~0_38| 0) (= v_~result_9~0_46 |v_thread1Thread1of1ForFork2_#t~ite5#1_37|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_45| |v_thread1Thread1of1ForFork2_#t~ite5#1_37|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ret1#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_41| |v_thread1Thread1of1ForFork2_#t~ite4#1_45|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_41| 2147483648))) InVars {~filename_1~0=v_~filename_1~0_51, ~filename_4~0=v_~filename_4~0_49, #race~filename_4~0=|v_#race~filename_4~0_38|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_41|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_35|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_29|, ~filename_1~0=v_~filename_1~0_51, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_37|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_31|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_46, ~filename_4~0=v_~filename_4~0_49, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_29|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_65|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_41|, #race~result_9~0=|v_#race~result_9~0_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_45|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_65|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|, #race~filename_4~0=|v_#race~filename_4~0_38|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, #race~result_9~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][126], [72#thread3EXITtrue, Black: 447#true, Black: 419#true, Black: 452#true, 274#L50-40true, 286#L77-4true, 426#(= |#race~isNull_3~0| 0), 454#(= |#race~filename_8~0| 0), Black: 424#true, 459#(= |#race~filename_1~0| 0), Black: 457#true, 440#(= |#race~filename_2~0| 0), 435#(= |#race~isNull_6~0| 0), Black: 462#true, Black: 433#true, 449#(= |#race~filename_5~0| 0), 431#(= |#race~result_9~0| |thread1Thread1of1ForFork2_#t~nondet6#1|), 421#(= |#race~isNull_0~0| 0), 464#(= |#race~filename_4~0| 0), 416#true, Black: 438#true, 469#(= |#race~filename_7~0| 0)]) [2023-11-06 22:47:17,182 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-06 22:47:17,182 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 22:47:17,182 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:47:17,182 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:47:17,184 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1554] L44-26-->L44-40: Formula: (and (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_41| 2147483647) (= |v_thread1Thread1of1ForFork2_minus_#res#1_31| |v_thread1Thread1of1ForFork2_#t~ret1#1_41|) (= v_~filename_1~0_51 (+ |v_thread1Thread1of1ForFork2_minus_#res#1_31| v_~filename_4~0_49)) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ite3#1_41|) (= |v_thread1Thread1of1ForFork2_#t~nondet6#1_43| |v_#race~result_9~0_45|) (= |v_#race~filename_4~0_38| 0) (= v_~result_9~0_46 |v_thread1Thread1of1ForFork2_#t~ite5#1_37|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_45| |v_thread1Thread1of1ForFork2_#t~ite5#1_37|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ret1#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_41| |v_thread1Thread1of1ForFork2_#t~ite4#1_45|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_41| 2147483648))) InVars {~filename_1~0=v_~filename_1~0_51, ~filename_4~0=v_~filename_4~0_49, #race~filename_4~0=|v_#race~filename_4~0_38|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_41|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_35|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_29|, ~filename_1~0=v_~filename_1~0_51, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_37|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_31|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_46, ~filename_4~0=v_~filename_4~0_49, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_29|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_65|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_41|, #race~result_9~0=|v_#race~result_9~0_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_45|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_65|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|, #race~filename_4~0=|v_#race~filename_4~0_38|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, #race~result_9~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][126], [Black: 447#true, 32#L56-39true, Black: 419#true, Black: 452#true, 426#(= |#race~isNull_3~0| 0), 459#(= |#race~filename_1~0| 0), 454#(= |#race~filename_8~0| 0), Black: 424#true, Black: 457#true, 440#(= |#race~filename_2~0| 0), 435#(= |#race~isNull_6~0| 0), Black: 462#true, 297#L78-6true, Black: 433#true, 449#(= |#race~filename_5~0| 0), 431#(= |#race~result_9~0| |thread1Thread1of1ForFork2_#t~nondet6#1|), 421#(= |#race~isNull_0~0| 0), 242#thread2EXITtrue, 464#(= |#race~filename_4~0| 0), 416#true, Black: 438#true, 469#(= |#race~filename_7~0| 0)]) [2023-11-06 22:47:17,184 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 22:47:17,184 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 22:47:17,184 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:47:17,184 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:47:17,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1554] L44-26-->L44-40: Formula: (and (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_41| 2147483647) (= |v_thread1Thread1of1ForFork2_minus_#res#1_31| |v_thread1Thread1of1ForFork2_#t~ret1#1_41|) (= v_~filename_1~0_51 (+ |v_thread1Thread1of1ForFork2_minus_#res#1_31| v_~filename_4~0_49)) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ite3#1_41|) (= |v_thread1Thread1of1ForFork2_#t~nondet6#1_43| |v_#race~result_9~0_45|) (= |v_#race~filename_4~0_38| 0) (= v_~result_9~0_46 |v_thread1Thread1of1ForFork2_#t~ite5#1_37|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_45| |v_thread1Thread1of1ForFork2_#t~ite5#1_37|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ret1#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_41| |v_thread1Thread1of1ForFork2_#t~ite4#1_45|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_41| 2147483648))) InVars {~filename_1~0=v_~filename_1~0_51, ~filename_4~0=v_~filename_4~0_49, #race~filename_4~0=|v_#race~filename_4~0_38|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_41|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_35|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_29|, ~filename_1~0=v_~filename_1~0_51, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_37|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_31|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_46, ~filename_4~0=v_~filename_4~0_49, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_29|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_65|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_41|, #race~result_9~0=|v_#race~result_9~0_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_45|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_65|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|, #race~filename_4~0=|v_#race~filename_4~0_38|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, #race~result_9~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][126], [72#thread3EXITtrue, Black: 447#true, Black: 419#true, Black: 452#true, 274#L50-40true, 426#(= |#race~isNull_3~0| 0), 459#(= |#race~filename_1~0| 0), 454#(= |#race~filename_8~0| 0), Black: 424#true, Black: 457#true, 440#(= |#race~filename_2~0| 0), 435#(= |#race~isNull_6~0| 0), Black: 462#true, 297#L78-6true, Black: 433#true, 449#(= |#race~filename_5~0| 0), 431#(= |#race~result_9~0| |thread1Thread1of1ForFork2_#t~nondet6#1|), 421#(= |#race~isNull_0~0| 0), 464#(= |#race~filename_4~0| 0), 416#true, Black: 438#true, 469#(= |#race~filename_7~0| 0)]) [2023-11-06 22:47:17,185 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 22:47:17,185 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:47:17,186 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 22:47:17,186 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:47:17,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1554] L44-26-->L44-40: Formula: (and (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_41| 2147483647) (= |v_thread1Thread1of1ForFork2_minus_#res#1_31| |v_thread1Thread1of1ForFork2_#t~ret1#1_41|) (= v_~filename_1~0_51 (+ |v_thread1Thread1of1ForFork2_minus_#res#1_31| v_~filename_4~0_49)) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ite3#1_41|) (= |v_thread1Thread1of1ForFork2_#t~nondet6#1_43| |v_#race~result_9~0_45|) (= |v_#race~filename_4~0_38| 0) (= v_~result_9~0_46 |v_thread1Thread1of1ForFork2_#t~ite5#1_37|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_45| |v_thread1Thread1of1ForFork2_#t~ite5#1_37|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ret1#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_41| |v_thread1Thread1of1ForFork2_#t~ite4#1_45|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_41| 2147483648))) InVars {~filename_1~0=v_~filename_1~0_51, ~filename_4~0=v_~filename_4~0_49, #race~filename_4~0=|v_#race~filename_4~0_38|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_41|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_35|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_29|, ~filename_1~0=v_~filename_1~0_51, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_37|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_31|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_46, ~filename_4~0=v_~filename_4~0_49, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_29|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_65|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_41|, #race~result_9~0=|v_#race~result_9~0_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_45|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_65|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|, #race~filename_4~0=|v_#race~filename_4~0_38|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, #race~result_9~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][126], [72#thread3EXITtrue, Black: 447#true, Black: 419#true, Black: 452#true, 286#L77-4true, 426#(= |#race~isNull_3~0| 0), 454#(= |#race~filename_8~0| 0), Black: 424#true, 459#(= |#race~filename_1~0| 0), Black: 457#true, 440#(= |#race~filename_2~0| 0), 435#(= |#race~isNull_6~0| 0), Black: 462#true, Black: 433#true, 449#(= |#race~filename_5~0| 0), 431#(= |#race~result_9~0| |thread1Thread1of1ForFork2_#t~nondet6#1|), 242#thread2EXITtrue, 421#(= |#race~isNull_0~0| 0), 464#(= |#race~filename_4~0| 0), 416#true, Black: 438#true, 469#(= |#race~filename_7~0| 0)]) [2023-11-06 22:47:17,187 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 22:47:17,187 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 22:47:17,187 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:47:17,187 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:47:17,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1554] L44-26-->L44-40: Formula: (and (<= |v_thread1Thread1of1ForFork2_#t~ret1#1_41| 2147483647) (= |v_thread1Thread1of1ForFork2_minus_#res#1_31| |v_thread1Thread1of1ForFork2_#t~ret1#1_41|) (= v_~filename_1~0_51 (+ |v_thread1Thread1of1ForFork2_minus_#res#1_31| v_~filename_4~0_49)) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ite3#1_41|) (= |v_thread1Thread1of1ForFork2_#t~nondet6#1_43| |v_#race~result_9~0_45|) (= |v_#race~filename_4~0_38| 0) (= v_~result_9~0_46 |v_thread1Thread1of1ForFork2_#t~ite5#1_37|) (= |v_thread1Thread1of1ForFork2_#t~ite4#1_45| |v_thread1Thread1of1ForFork2_#t~ite5#1_37|) (= |v_thread1Thread1of1ForFork2_#t~ite2#1_35| |v_thread1Thread1of1ForFork2_#t~ret1#1_41|) (= |v_thread1Thread1of1ForFork2_#t~ite3#1_41| |v_thread1Thread1of1ForFork2_#t~ite4#1_45|) (<= 0 (+ |v_thread1Thread1of1ForFork2_#t~ret1#1_41| 2147483648))) InVars {~filename_1~0=v_~filename_1~0_51, ~filename_4~0=v_~filename_4~0_49, #race~filename_4~0=|v_#race~filename_4~0_38|} OutVars{thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_41|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_35|, thread1Thread1of1ForFork2_minus_#in~a#1=|v_thread1Thread1of1ForFork2_minus_#in~a#1_29|, ~filename_1~0=v_~filename_1~0_51, thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_37|, thread1Thread1of1ForFork2_minus_#res#1=|v_thread1Thread1of1ForFork2_minus_#res#1_31|, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_43|, ~result_9~0=v_~result_9~0_46, ~filename_4~0=v_~filename_4~0_49, thread1Thread1of1ForFork2_minus_#in~b#1=|v_thread1Thread1of1ForFork2_minus_#in~b#1_29|, thread1Thread1of1ForFork2_minus_~b#1=|v_thread1Thread1of1ForFork2_minus_~b#1_65|, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_41|, #race~result_9~0=|v_#race~result_9~0_45|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_71|, thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_45|, thread1Thread1of1ForFork2_minus_~a#1=|v_thread1Thread1of1ForFork2_minus_~a#1_65|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_83|, #race~filename_4~0=|v_#race~filename_4~0_38|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_minus_#in~a#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_minus_#res#1, thread1Thread1of1ForFork2_#t~nondet6#1, ~result_9~0, thread1Thread1of1ForFork2_minus_#in~b#1, thread1Thread1of1ForFork2_minus_~b#1, thread1Thread1of1ForFork2_#t~ite3#1, #race~result_9~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~ite4#1, thread1Thread1of1ForFork2_minus_~a#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][126], [72#thread3EXITtrue, Black: 447#true, Black: 419#true, Black: 452#true, 426#(= |#race~isNull_3~0| 0), 459#(= |#race~filename_1~0| 0), 454#(= |#race~filename_8~0| 0), Black: 424#true, Black: 457#true, 440#(= |#race~filename_2~0| 0), 435#(= |#race~isNull_6~0| 0), Black: 462#true, 297#L78-6true, Black: 433#true, 449#(= |#race~filename_5~0| 0), 431#(= |#race~result_9~0| |thread1Thread1of1ForFork2_#t~nondet6#1|), 421#(= |#race~isNull_0~0| 0), 242#thread2EXITtrue, 464#(= |#race~filename_4~0| 0), 416#true, Black: 438#true, 469#(= |#race~filename_7~0| 0)]) [2023-11-06 22:47:17,189 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-06 22:47:17,189 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-06 22:47:17,189 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:47:17,189 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-06 22:47:17,189 INFO L124 PetriNetUnfolderBase]: 18363/27480 cut-off events. [2023-11-06 22:47:17,189 INFO L125 PetriNetUnfolderBase]: For 4088/4158 co-relation queries the response was YES. [2023-11-06 22:47:17,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62853 conditions, 27480 events. 18363/27480 cut-off events. For 4088/4158 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 191810 event pairs, 8373 based on Foata normal form. 0/22533 useless extension candidates. Maximal degree in co-relation 62842. Up to 16739 conditions per place. [2023-11-06 22:47:17,303 INFO L140 encePairwiseOnDemand]: 813/817 looper letters, 0 selfloop transitions, 0 changer transitions 140/140 dead transitions. [2023-11-06 22:47:17,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 140 transitions, 651 flow [2023-11-06 22:47:17,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:17,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2023-11-06 22:47:17,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5316197470420236 [2023-11-06 22:47:17,309 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1303 transitions. [2023-11-06 22:47:17,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1303 transitions. [2023-11-06 22:47:17,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:17,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1303 transitions. [2023-11-06 22:47:17,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 434.3333333333333) internal successors, (1303), 3 states have internal predecessors, (1303), 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) [2023-11-06 22:47:17,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:47:17,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 817.0) internal successors, (3268), 4 states have internal predecessors, (3268), 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) [2023-11-06 22:47:17,321 INFO L175 Difference]: Start difference. First operand has 89 places, 94 transitions, 303 flow. Second operand 3 states and 1303 transitions. [2023-11-06 22:47:17,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 140 transitions, 651 flow [2023-11-06 22:47:17,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 140 transitions, 651 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:47:17,331 INFO L231 Difference]: Finished difference. Result has 89 places, 0 transitions, 0 flow [2023-11-06 22:47:17,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=817, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=89, PETRI_TRANSITIONS=0} [2023-11-06 22:47:17,332 INFO L281 CegarLoopForPetriNet]: 111 programPoint places, -22 predicate places. [2023-11-06 22:47:17,333 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 0 transitions, 0 flow [2023-11-06 22:47:17,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 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) [2023-11-06 22:47:17,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (71 of 72 remaining) [2023-11-06 22:47:17,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 72 remaining) [2023-11-06 22:47:17,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (69 of 72 remaining) [2023-11-06 22:47:17,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (68 of 72 remaining) [2023-11-06 22:47:17,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (67 of 72 remaining) [2023-11-06 22:47:17,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (66 of 72 remaining) [2023-11-06 22:47:17,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (65 of 72 remaining) [2023-11-06 22:47:17,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (64 of 72 remaining) [2023-11-06 22:47:17,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 72 remaining) [2023-11-06 22:47:17,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (62 of 72 remaining) [2023-11-06 22:47:17,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (61 of 72 remaining) [2023-11-06 22:47:17,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (60 of 72 remaining) [2023-11-06 22:47:17,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (59 of 72 remaining) [2023-11-06 22:47:17,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (58 of 72 remaining) [2023-11-06 22:47:17,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (57 of 72 remaining) [2023-11-06 22:47:17,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (56 of 72 remaining) [2023-11-06 22:47:17,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (55 of 72 remaining) [2023-11-06 22:47:17,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (54 of 72 remaining) [2023-11-06 22:47:17,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (53 of 72 remaining) [2023-11-06 22:47:17,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (52 of 72 remaining) [2023-11-06 22:47:17,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (51 of 72 remaining) [2023-11-06 22:47:17,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (50 of 72 remaining) [2023-11-06 22:47:17,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (49 of 72 remaining) [2023-11-06 22:47:17,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (48 of 72 remaining) [2023-11-06 22:47:17,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (47 of 72 remaining) [2023-11-06 22:47:17,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (46 of 72 remaining) [2023-11-06 22:47:17,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (45 of 72 remaining) [2023-11-06 22:47:17,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 72 remaining) [2023-11-06 22:47:17,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 72 remaining) [2023-11-06 22:47:17,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 72 remaining) [2023-11-06 22:47:17,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 72 remaining) [2023-11-06 22:47:17,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 72 remaining) [2023-11-06 22:47:17,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (39 of 72 remaining) [2023-11-06 22:47:17,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (38 of 72 remaining) [2023-11-06 22:47:17,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 72 remaining) [2023-11-06 22:47:17,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (36 of 72 remaining) [2023-11-06 22:47:17,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (35 of 72 remaining) [2023-11-06 22:47:17,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (34 of 72 remaining) [2023-11-06 22:47:17,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (33 of 72 remaining) [2023-11-06 22:47:17,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (32 of 72 remaining) [2023-11-06 22:47:17,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (31 of 72 remaining) [2023-11-06 22:47:17,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (30 of 72 remaining) [2023-11-06 22:47:17,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 72 remaining) [2023-11-06 22:47:17,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 72 remaining) [2023-11-06 22:47:17,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 72 remaining) [2023-11-06 22:47:17,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 72 remaining) [2023-11-06 22:47:17,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 72 remaining) [2023-11-06 22:47:17,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 72 remaining) [2023-11-06 22:47:17,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 72 remaining) [2023-11-06 22:47:17,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 72 remaining) [2023-11-06 22:47:17,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (21 of 72 remaining) [2023-11-06 22:47:17,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 72 remaining) [2023-11-06 22:47:17,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 72 remaining) [2023-11-06 22:47:17,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 72 remaining) [2023-11-06 22:47:17,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 72 remaining) [2023-11-06 22:47:17,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 72 remaining) [2023-11-06 22:47:17,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 72 remaining) [2023-11-06 22:47:17,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 72 remaining) [2023-11-06 22:47:17,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 72 remaining) [2023-11-06 22:47:17,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 72 remaining) [2023-11-06 22:47:17,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 72 remaining) [2023-11-06 22:47:17,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 72 remaining) [2023-11-06 22:47:17,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 72 remaining) [2023-11-06 22:47:17,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 72 remaining) [2023-11-06 22:47:17,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 72 remaining) [2023-11-06 22:47:17,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 72 remaining) [2023-11-06 22:47:17,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 72 remaining) [2023-11-06 22:47:17,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 72 remaining) [2023-11-06 22:47:17,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 72 remaining) [2023-11-06 22:47:17,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 72 remaining) [2023-11-06 22:47:17,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 72 remaining) [2023-11-06 22:47:17,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 72 remaining) [2023-11-06 22:47:17,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:47:17,355 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:17,362 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:47:17,362 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:47:17,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:47:17 BasicIcfg [2023-11-06 22:47:17,368 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:47:17,369 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:47:17,369 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:47:17,369 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:47:17,370 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:38" (3/4) ... [2023-11-06 22:47:17,372 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:47:17,378 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-06 22:47:17,378 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-06 22:47:17,378 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-11-06 22:47:17,389 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2023-11-06 22:47:17,389 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:47:17,390 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:47:17,391 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:47:17,449 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:47:17,450 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:47:17,450 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:47:17,451 INFO L158 Benchmark]: Toolchain (without parser) took 40258.39ms. Allocated memory was 157.3MB in the beginning and 10.5GB in the end (delta: 10.3GB). Free memory was 121.6MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-06 22:47:17,451 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 111.1MB. Free memory was 86.1MB in the beginning and 86.1MB in the end (delta: 42.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:47:17,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.12ms. Allocated memory is still 157.3MB. Free memory was 121.0MB in the beginning and 109.0MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:47:17,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.64ms. Allocated memory is still 157.3MB. Free memory was 109.0MB in the beginning and 106.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:47:17,453 INFO L158 Benchmark]: Boogie Preprocessor took 45.17ms. Allocated memory is still 157.3MB. Free memory was 106.0MB in the beginning and 103.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:47:17,453 INFO L158 Benchmark]: RCFGBuilder took 963.17ms. Allocated memory is still 157.3MB. Free memory was 103.9MB in the beginning and 75.4MB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-06 22:47:17,453 INFO L158 Benchmark]: TraceAbstraction took 38723.52ms. Allocated memory was 157.3MB in the beginning and 10.5GB in the end (delta: 10.3GB). Free memory was 74.8MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-11-06 22:47:17,454 INFO L158 Benchmark]: Witness Printer took 81.38ms. Allocated memory is still 10.5GB. Free memory was 9.3GB in the beginning and 9.3GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:47:17,456 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 111.1MB. Free memory was 86.1MB in the beginning and 86.1MB in the end (delta: 42.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.12ms. Allocated memory is still 157.3MB. Free memory was 121.0MB in the beginning and 109.0MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.64ms. Allocated memory is still 157.3MB. Free memory was 109.0MB in the beginning and 106.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.17ms. Allocated memory is still 157.3MB. Free memory was 106.0MB in the beginning and 103.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 963.17ms. Allocated memory is still 157.3MB. Free memory was 103.9MB in the beginning and 75.4MB in the end (delta: 28.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 38723.52ms. Allocated memory was 157.3MB in the beginning and 10.5GB in the end (delta: 10.3GB). Free memory was 74.8MB in the beginning and 9.3GB in the end (delta: -9.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 81.38ms. Allocated memory is still 10.5GB. Free memory was 9.3GB in the beginning and 9.3GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.4s, 385 PlacesBefore, 111 PlacesAfterwards, 394 TransitionsBefore, 115 TransitionsAfterwards, 48822 CoEnabledTransitionPairs, 9 FixpointIterations, 143 TrivialSequentialCompositions, 183 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 57 ConcurrentYvCompositions, 5 ChoiceCompositions, 393 TotalNumberOfCompositions, 167397 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 91027, independent: 89523, independent conditional: 0, independent unconditional: 89523, dependent: 1504, dependent conditional: 0, dependent unconditional: 1504, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 28457, independent: 28322, independent conditional: 0, independent unconditional: 28322, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 91027, independent: 61201, independent conditional: 0, independent unconditional: 61201, dependent: 1369, dependent conditional: 0, dependent unconditional: 1369, unknown: 28457, unknown conditional: 0, unknown unconditional: 28457] , Statistics on independence cache: Total cache size (in pairs): 2567, Positive cache size: 2493, Positive conditional cache size: 0, Positive unconditional cache size: 2493, Negative cache size: 74, Negative conditional cache size: 0, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 629 locations, 72 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: 38.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 627 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1390 IncrementalHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 61 mSDtfsCounter, 1390 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=11, InterpolantAutomatonStates: 35, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 117 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-06 22:47:17,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8937a88d-95f4-477a-ba76-dde0e88ad26d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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