./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 e04fb08f 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_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8/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_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8 --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:38:51,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:38:51,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:38:51,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:38:51,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:38:51,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:38:51,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:38:51,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:38:51,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:38:51,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:38:51,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:38:51,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:38:51,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:38:51,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:38:51,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:38:51,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:38:51,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:38:51,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:38:51,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:38:51,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:38:51,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:38:51,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:38:51,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:38:51,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:38:51,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:38:51,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:38:51,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:38:51,524 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:38:51,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:38:51,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:38:51,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:38:51,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:38:51,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:38:51,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:38:51,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:38:51,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:38:51,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:38:51,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:38:51,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:38:51,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:38:51,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:38:51,539 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 11:38:51,570 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:38:51,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:38:51,571 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:38:51,571 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:38:51,572 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:38:51,572 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:38:51,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:38:51,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:38:51,573 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:38:51,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:38:51,573 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:38:51,574 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:38:51,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:38:51,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:38:51,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:38:51,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:38:51,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:38:51,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:38:51,575 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 11:38:51,575 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:38:51,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:38:51,576 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:38:51,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:38:51,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:38:51,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:38:51,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:38:51,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:38:51,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:38:51,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:38:51,578 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:38:51,578 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:38:51,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:38:51,578 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:38:51,578 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:38:51,579 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:38:51,579 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8/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_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8 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 [2022-11-16 11:38:51,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:38:51,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:38:51,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:38:51,930 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:38:51,931 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:38:51,933 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2022-11-16 11:38:52,031 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8/data/8c26481c0/f8abf83160bf45d29678749548336bfc/FLAGb4909c693 [2022-11-16 11:38:52,574 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:38:52,575 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2022-11-16 11:38:52,584 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8/data/8c26481c0/f8abf83160bf45d29678749548336bfc/FLAGb4909c693 [2022-11-16 11:38:52,914 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8/data/8c26481c0/f8abf83160bf45d29678749548336bfc [2022-11-16 11:38:52,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:38:52,920 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:38:52,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:38:52,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:38:52,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:38:52,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:38:52" (1/1) ... [2022-11-16 11:38:52,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41fbe3e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:52, skipping insertion in model container [2022-11-16 11:38:52,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:38:52" (1/1) ... [2022-11-16 11:38:52,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:38:52,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:38:53,245 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c[2817,2830] [2022-11-16 11:38:53,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:38:53,261 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:38:53,337 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c[2817,2830] [2022-11-16 11:38:53,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:38:53,370 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:38:53,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:53 WrapperNode [2022-11-16 11:38:53,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:38:53,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:38:53,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:38:53,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:38:53,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:53" (1/1) ... [2022-11-16 11:38:53,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:53" (1/1) ... [2022-11-16 11:38:53,450 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 318 [2022-11-16 11:38:53,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:38:53,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:38:53,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:38:53,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:38:53,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:53" (1/1) ... [2022-11-16 11:38:53,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:53" (1/1) ... [2022-11-16 11:38:53,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:53" (1/1) ... [2022-11-16 11:38:53,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:53" (1/1) ... [2022-11-16 11:38:53,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:53" (1/1) ... [2022-11-16 11:38:53,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:53" (1/1) ... [2022-11-16 11:38:53,490 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:53" (1/1) ... [2022-11-16 11:38:53,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:53" (1/1) ... [2022-11-16 11:38:53,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:38:53,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:38:53,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:38:53,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:38:53,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:53" (1/1) ... [2022-11-16 11:38:53,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:38:53,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:38:53,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:38:53,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:38:53,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:38:53,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 11:38:53,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 11:38:53,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 11:38:53,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 11:38:53,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 11:38:53,609 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 11:38:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:38:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:38:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:38:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:38:53,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:38:53,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:38:53,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:38:53,612 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:38:53,733 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:38:53,735 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:38:54,482 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:38:54,506 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:38:54,506 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:38:54,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:38:54 BoogieIcfgContainer [2022-11-16 11:38:54,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:38:54,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:38:54,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:38:54,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:38:54,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:38:52" (1/3) ... [2022-11-16 11:38:54,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10472ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:38:54, skipping insertion in model container [2022-11-16 11:38:54,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:38:53" (2/3) ... [2022-11-16 11:38:54,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10472ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:38:54, skipping insertion in model container [2022-11-16 11:38:54,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:38:54" (3/3) ... [2022-11-16 11:38:54,527 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2022-11-16 11:38:54,538 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:38:54,551 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:38:54,551 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-11-16 11:38:54,551 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:38:54,705 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 11:38:54,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 405 places, 416 transitions, 856 flow [2022-11-16 11:38:54,984 INFO L130 PetriNetUnfolder]: 21/413 cut-off events. [2022-11-16 11:38:54,984 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 11:38:55,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 413 events. 21/413 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1112 event pairs, 0 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 270. Up to 2 conditions per place. [2022-11-16 11:38:55,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 405 places, 416 transitions, 856 flow [2022-11-16 11:38:55,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 380 places, 389 transitions, 796 flow [2022-11-16 11:38:55,041 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:38:55,049 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;@46a2ffbd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:38:55,049 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-11-16 11:38:55,056 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-11-16 11:38:55,056 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:38:55,056 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:38:55,057 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:55,058 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:38:55,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:55,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2088113730, now seen corresponding path program 1 times [2022-11-16 11:38:55,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:55,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154142120] [2022-11-16 11:38:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:55,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:38:55,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:55,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154142120] [2022-11-16 11:38:55,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154142120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:55,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:55,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:38:55,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449925012] [2022-11-16 11:38:55,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:55,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:38:55,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:55,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:38:55,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:38:55,425 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 416 [2022-11-16 11:38:55,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 389 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:55,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:38:55,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 416 [2022-11-16 11:38:55,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:38:55,919 INFO L130 PetriNetUnfolder]: 47/918 cut-off events. [2022-11-16 11:38:55,919 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2022-11-16 11:38:55,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 918 events. 47/918 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4687 event pairs, 21 based on Foata normal form. 31/811 useless extension candidates. Maximal degree in co-relation 721. Up to 63 conditions per place. [2022-11-16 11:38:55,950 INFO L137 encePairwiseOnDemand]: 407/416 looper letters, 15 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2022-11-16 11:38:55,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 382 transitions, 816 flow [2022-11-16 11:38:55,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:38:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:38:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1194 transitions. [2022-11-16 11:38:55,983 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9567307692307693 [2022-11-16 11:38:55,984 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1194 transitions. [2022-11-16 11:38:55,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1194 transitions. [2022-11-16 11:38:55,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:38:55,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1194 transitions. [2022-11-16 11:38:56,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 398.0) internal successors, (1194), 3 states have internal predecessors, (1194), 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) [2022-11-16 11:38:56,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:38:56,020 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:38:56,023 INFO L175 Difference]: Start difference. First operand has 380 places, 389 transitions, 796 flow. Second operand 3 states and 1194 transitions. [2022-11-16 11:38:56,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 382 transitions, 816 flow [2022-11-16 11:38:56,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 382 transitions, 804 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-16 11:38:56,046 INFO L231 Difference]: Finished difference. Result has 375 places, 382 transitions, 774 flow [2022-11-16 11:38:56,048 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=375, PETRI_TRANSITIONS=382} [2022-11-16 11:38:56,055 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -5 predicate places. [2022-11-16 11:38:56,056 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 382 transitions, 774 flow [2022-11-16 11:38:56,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:56,057 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:38:56,057 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:56,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:38:56,058 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:38:56,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:56,060 INFO L85 PathProgramCache]: Analyzing trace with hash 632456667, now seen corresponding path program 1 times [2022-11-16 11:38:56,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:56,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351655460] [2022-11-16 11:38:56,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:56,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:56,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:38:56,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:56,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351655460] [2022-11-16 11:38:56,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351655460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:56,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:56,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:38:56,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81139477] [2022-11-16 11:38:56,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:56,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:38:56,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:56,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:38:56,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:38:56,181 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 416 [2022-11-16 11:38:56,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 382 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:56,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:38:56,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 416 [2022-11-16 11:38:56,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:38:56,573 INFO L130 PetriNetUnfolder]: 73/1272 cut-off events. [2022-11-16 11:38:56,574 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-16 11:38:56,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 1272 events. 73/1272 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8254 event pairs, 39 based on Foata normal form. 0/1081 useless extension candidates. Maximal degree in co-relation 1349. Up to 90 conditions per place. [2022-11-16 11:38:56,606 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 15 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2022-11-16 11:38:56,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 381 transitions, 806 flow [2022-11-16 11:38:56,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:38:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:38:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1188 transitions. [2022-11-16 11:38:56,611 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9519230769230769 [2022-11-16 11:38:56,611 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1188 transitions. [2022-11-16 11:38:56,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1188 transitions. [2022-11-16 11:38:56,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:38:56,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1188 transitions. [2022-11-16 11:38:56,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:56,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:38:56,621 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:38:56,622 INFO L175 Difference]: Start difference. First operand has 375 places, 382 transitions, 774 flow. Second operand 3 states and 1188 transitions. [2022-11-16 11:38:56,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 381 transitions, 806 flow [2022-11-16 11:38:56,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 381 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:38:56,635 INFO L231 Difference]: Finished difference. Result has 374 places, 381 transitions, 772 flow [2022-11-16 11:38:56,636 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=374, PETRI_TRANSITIONS=381} [2022-11-16 11:38:56,637 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -6 predicate places. [2022-11-16 11:38:56,638 INFO L495 AbstractCegarLoop]: Abstraction has has 374 places, 381 transitions, 772 flow [2022-11-16 11:38:56,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:56,640 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:38:56,640 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:56,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:38:56,641 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:38:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:56,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1458864836, now seen corresponding path program 1 times [2022-11-16 11:38:56,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:56,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047350239] [2022-11-16 11:38:56,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:56,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:38:56,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:56,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047350239] [2022-11-16 11:38:56,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047350239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:56,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:56,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:38:56,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137060475] [2022-11-16 11:38:56,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:56,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:38:56,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:56,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:38:56,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:38:56,794 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 416 [2022-11-16 11:38:56,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 381 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:56,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:38:56,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 416 [2022-11-16 11:38:56,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:38:57,152 INFO L130 PetriNetUnfolder]: 61/1020 cut-off events. [2022-11-16 11:38:57,153 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-16 11:38:57,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 1020 events. 61/1020 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5434 event pairs, 39 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 1075. Up to 90 conditions per place. [2022-11-16 11:38:57,177 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 15 selfloop transitions, 2 changer transitions 0/380 dead transitions. [2022-11-16 11:38:57,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 380 transitions, 804 flow [2022-11-16 11:38:57,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:38:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:38:57,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1188 transitions. [2022-11-16 11:38:57,184 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9519230769230769 [2022-11-16 11:38:57,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1188 transitions. [2022-11-16 11:38:57,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1188 transitions. [2022-11-16 11:38:57,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:38:57,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1188 transitions. [2022-11-16 11:38:57,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:57,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:38:57,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:38:57,197 INFO L175 Difference]: Start difference. First operand has 374 places, 381 transitions, 772 flow. Second operand 3 states and 1188 transitions. [2022-11-16 11:38:57,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 380 transitions, 804 flow [2022-11-16 11:38:57,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 380 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:38:57,206 INFO L231 Difference]: Finished difference. Result has 373 places, 380 transitions, 770 flow [2022-11-16 11:38:57,207 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=373, PETRI_TRANSITIONS=380} [2022-11-16 11:38:57,210 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -7 predicate places. [2022-11-16 11:38:57,211 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 380 transitions, 770 flow [2022-11-16 11:38:57,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:57,212 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:38:57,213 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:57,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:38:57,213 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:38:57,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:57,214 INFO L85 PathProgramCache]: Analyzing trace with hash 881932410, now seen corresponding path program 1 times [2022-11-16 11:38:57,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:57,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885198954] [2022-11-16 11:38:57,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:38:57,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:57,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885198954] [2022-11-16 11:38:57,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885198954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:57,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:57,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:38:57,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870325499] [2022-11-16 11:38:57,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:57,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:38:57,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:57,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:38:57,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:38:57,349 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 416 [2022-11-16 11:38:57,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 380 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:57,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:38:57,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 416 [2022-11-16 11:38:57,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:38:57,641 INFO L130 PetriNetUnfolder]: 62/939 cut-off events. [2022-11-16 11:38:57,641 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-16 11:38:57,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 939 events. 62/939 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5072 event pairs, 21 based on Foata normal form. 0/763 useless extension candidates. Maximal degree in co-relation 958. Up to 58 conditions per place. [2022-11-16 11:38:57,673 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 15 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2022-11-16 11:38:57,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 379 transitions, 802 flow [2022-11-16 11:38:57,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:38:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:38:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1188 transitions. [2022-11-16 11:38:57,677 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9519230769230769 [2022-11-16 11:38:57,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1188 transitions. [2022-11-16 11:38:57,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1188 transitions. [2022-11-16 11:38:57,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:38:57,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1188 transitions. [2022-11-16 11:38:57,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:57,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:38:57,693 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:38:57,693 INFO L175 Difference]: Start difference. First operand has 373 places, 380 transitions, 770 flow. Second operand 3 states and 1188 transitions. [2022-11-16 11:38:57,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 379 transitions, 802 flow [2022-11-16 11:38:57,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 379 transitions, 798 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:38:57,705 INFO L231 Difference]: Finished difference. Result has 372 places, 379 transitions, 768 flow [2022-11-16 11:38:57,706 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=372, PETRI_TRANSITIONS=379} [2022-11-16 11:38:57,713 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -8 predicate places. [2022-11-16 11:38:57,713 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 379 transitions, 768 flow [2022-11-16 11:38:57,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:57,715 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:38:57,715 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:57,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:38:57,716 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:38:57,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1587501555, now seen corresponding path program 1 times [2022-11-16 11:38:57,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:57,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697779239] [2022-11-16 11:38:57,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:57,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:38:57,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:57,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697779239] [2022-11-16 11:38:57,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697779239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:57,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:57,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:38:57,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641525429] [2022-11-16 11:38:57,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:57,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:38:57,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:57,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:38:57,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:38:57,809 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 416 [2022-11-16 11:38:57,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 379 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:57,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:38:57,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 416 [2022-11-16 11:38:57,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:38:58,231 INFO L130 PetriNetUnfolder]: 149/1672 cut-off events. [2022-11-16 11:38:58,231 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 11:38:58,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1859 conditions, 1672 events. 149/1672 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 13264 event pairs, 72 based on Foata normal form. 0/1349 useless extension candidates. Maximal degree in co-relation 1799. Up to 145 conditions per place. [2022-11-16 11:38:58,266 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 18 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2022-11-16 11:38:58,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 378 transitions, 806 flow [2022-11-16 11:38:58,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:38:58,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:38:58,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2022-11-16 11:38:58,270 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9471153846153846 [2022-11-16 11:38:58,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1182 transitions. [2022-11-16 11:38:58,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1182 transitions. [2022-11-16 11:38:58,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:38:58,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1182 transitions. [2022-11-16 11:38:58,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 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) [2022-11-16 11:38:58,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:38:58,280 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:38:58,280 INFO L175 Difference]: Start difference. First operand has 372 places, 379 transitions, 768 flow. Second operand 3 states and 1182 transitions. [2022-11-16 11:38:58,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 378 transitions, 806 flow [2022-11-16 11:38:58,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 378 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:38:58,295 INFO L231 Difference]: Finished difference. Result has 371 places, 378 transitions, 766 flow [2022-11-16 11:38:58,296 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=371, PETRI_TRANSITIONS=378} [2022-11-16 11:38:58,300 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -9 predicate places. [2022-11-16 11:38:58,300 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 378 transitions, 766 flow [2022-11-16 11:38:58,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:58,302 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:38:58,302 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:58,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:38:58,303 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:38:58,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:58,305 INFO L85 PathProgramCache]: Analyzing trace with hash 233407208, now seen corresponding path program 1 times [2022-11-16 11:38:58,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:58,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311012067] [2022-11-16 11:38:58,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:58,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:38:58,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:58,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311012067] [2022-11-16 11:38:58,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311012067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:58,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:58,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:38:58,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125627307] [2022-11-16 11:38:58,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:58,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:38:58,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:58,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:38:58,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:38:58,385 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 416 [2022-11-16 11:38:58,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 378 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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) [2022-11-16 11:38:58,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:38:58,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 416 [2022-11-16 11:38:58,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:38:58,814 INFO L130 PetriNetUnfolder]: 217/1793 cut-off events. [2022-11-16 11:38:58,815 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-11-16 11:38:58,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2058 conditions, 1793 events. 217/1793 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 14041 event pairs, 132 based on Foata normal form. 0/1461 useless extension candidates. Maximal degree in co-relation 1992. Up to 250 conditions per place. [2022-11-16 11:38:58,852 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 21 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2022-11-16 11:38:58,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 377 transitions, 810 flow [2022-11-16 11:38:58,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:38:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:38:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2022-11-16 11:38:58,856 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9423076923076923 [2022-11-16 11:38:58,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1176 transitions. [2022-11-16 11:38:58,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1176 transitions. [2022-11-16 11:38:58,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:38:58,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1176 transitions. [2022-11-16 11:38:58,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:58,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:38:58,867 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:38:58,867 INFO L175 Difference]: Start difference. First operand has 371 places, 378 transitions, 766 flow. Second operand 3 states and 1176 transitions. [2022-11-16 11:38:58,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 377 transitions, 810 flow [2022-11-16 11:38:58,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 377 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:38:58,875 INFO L231 Difference]: Finished difference. Result has 370 places, 377 transitions, 764 flow [2022-11-16 11:38:58,876 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=370, PETRI_TRANSITIONS=377} [2022-11-16 11:38:58,877 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -10 predicate places. [2022-11-16 11:38:58,877 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 377 transitions, 764 flow [2022-11-16 11:38:58,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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) [2022-11-16 11:38:58,879 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:38:58,879 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:58,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:38:58,880 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:38:58,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:58,880 INFO L85 PathProgramCache]: Analyzing trace with hash -644287400, now seen corresponding path program 1 times [2022-11-16 11:38:58,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:58,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323886519] [2022-11-16 11:38:58,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:58,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:38:58,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:58,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323886519] [2022-11-16 11:38:58,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323886519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:58,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:58,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:38:58,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674794499] [2022-11-16 11:38:58,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:58,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:38:58,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:58,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:38:58,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:38:58,933 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 416 [2022-11-16 11:38:58,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 377 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:58,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:38:58,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 416 [2022-11-16 11:38:58,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:38:59,208 INFO L130 PetriNetUnfolder]: 61/1001 cut-off events. [2022-11-16 11:38:59,209 INFO L131 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-11-16 11:38:59,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 1001 events. 61/1001 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5865 event pairs, 21 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 1007. Up to 63 conditions per place. [2022-11-16 11:38:59,229 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 15 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2022-11-16 11:38:59,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 376 transitions, 796 flow [2022-11-16 11:38:59,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:38:59,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:38:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1188 transitions. [2022-11-16 11:38:59,234 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9519230769230769 [2022-11-16 11:38:59,234 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1188 transitions. [2022-11-16 11:38:59,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1188 transitions. [2022-11-16 11:38:59,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:38:59,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1188 transitions. [2022-11-16 11:38:59,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:59,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:38:59,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:38:59,242 INFO L175 Difference]: Start difference. First operand has 370 places, 377 transitions, 764 flow. Second operand 3 states and 1188 transitions. [2022-11-16 11:38:59,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 376 transitions, 796 flow [2022-11-16 11:38:59,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 376 transitions, 792 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:38:59,250 INFO L231 Difference]: Finished difference. Result has 369 places, 376 transitions, 762 flow [2022-11-16 11:38:59,252 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=369, PETRI_TRANSITIONS=376} [2022-11-16 11:38:59,254 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -11 predicate places. [2022-11-16 11:38:59,254 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 376 transitions, 762 flow [2022-11-16 11:38:59,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.3333333333333) internal successors, (1174), 3 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:59,255 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:38:59,255 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:59,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:38:59,256 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:38:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:59,256 INFO L85 PathProgramCache]: Analyzing trace with hash -912543404, now seen corresponding path program 1 times [2022-11-16 11:38:59,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:59,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048485862] [2022-11-16 11:38:59,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:59,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:38:59,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:59,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048485862] [2022-11-16 11:38:59,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048485862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:59,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:59,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:38:59,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364000285] [2022-11-16 11:38:59,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:59,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:38:59,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:59,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:38:59,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:38:59,349 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 416 [2022-11-16 11:38:59,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 376 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:59,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:38:59,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 416 [2022-11-16 11:38:59,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:38:59,853 INFO L130 PetriNetUnfolder]: 164/2307 cut-off events. [2022-11-16 11:38:59,853 INFO L131 PetriNetUnfolder]: For 11/14 co-relation queries the response was YES. [2022-11-16 11:38:59,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2499 conditions, 2307 events. 164/2307 cut-off events. For 11/14 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 20882 event pairs, 72 based on Foata normal form. 0/1909 useless extension candidates. Maximal degree in co-relation 2421. Up to 150 conditions per place. [2022-11-16 11:38:59,893 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 18 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2022-11-16 11:38:59,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 375 transitions, 800 flow [2022-11-16 11:38:59,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:38:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:38:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1182 transitions. [2022-11-16 11:38:59,898 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9471153846153846 [2022-11-16 11:38:59,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1182 transitions. [2022-11-16 11:38:59,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1182 transitions. [2022-11-16 11:38:59,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:38:59,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1182 transitions. [2022-11-16 11:38:59,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 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) [2022-11-16 11:38:59,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:38:59,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:38:59,907 INFO L175 Difference]: Start difference. First operand has 369 places, 376 transitions, 762 flow. Second operand 3 states and 1182 transitions. [2022-11-16 11:38:59,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 375 transitions, 800 flow [2022-11-16 11:38:59,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 375 transitions, 796 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:38:59,915 INFO L231 Difference]: Finished difference. Result has 368 places, 375 transitions, 760 flow [2022-11-16 11:38:59,916 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=368, PETRI_TRANSITIONS=375} [2022-11-16 11:38:59,917 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -12 predicate places. [2022-11-16 11:38:59,917 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 375 transitions, 760 flow [2022-11-16 11:38:59,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 388.3333333333333) internal successors, (1165), 3 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:38:59,918 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:38:59,919 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:38:59,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:38:59,919 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:38:59,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:38:59,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1071090225, now seen corresponding path program 1 times [2022-11-16 11:38:59,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:38:59,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958997918] [2022-11-16 11:38:59,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:38:59,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:38:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:38:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:38:59,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:38:59,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958997918] [2022-11-16 11:38:59,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958997918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:38:59,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:38:59,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:38:59,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914817301] [2022-11-16 11:38:59,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:38:59,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:38:59,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:38:59,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:38:59,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:38:59,968 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 416 [2022-11-16 11:38:59,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 375 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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) [2022-11-16 11:38:59,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:38:59,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 416 [2022-11-16 11:38:59,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:00,481 INFO L130 PetriNetUnfolder]: 193/1730 cut-off events. [2022-11-16 11:39:00,482 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-11-16 11:39:00,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2003 conditions, 1730 events. 193/1730 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 13380 event pairs, 132 based on Foata normal form. 0/1459 useless extension candidates. Maximal degree in co-relation 1919. Up to 258 conditions per place. [2022-11-16 11:39:00,517 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 21 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2022-11-16 11:39:00,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 374 transitions, 804 flow [2022-11-16 11:39:00,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:00,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1176 transitions. [2022-11-16 11:39:00,521 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9423076923076923 [2022-11-16 11:39:00,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1176 transitions. [2022-11-16 11:39:00,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1176 transitions. [2022-11-16 11:39:00,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:00,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1176 transitions. [2022-11-16 11:39:00,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 392.0) internal successors, (1176), 3 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:00,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:00,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:00,532 INFO L175 Difference]: Start difference. First operand has 368 places, 375 transitions, 760 flow. Second operand 3 states and 1176 transitions. [2022-11-16 11:39:00,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 374 transitions, 804 flow [2022-11-16 11:39:00,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 374 transitions, 800 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:39:00,540 INFO L231 Difference]: Finished difference. Result has 367 places, 374 transitions, 758 flow [2022-11-16 11:39:00,541 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=367, PETRI_TRANSITIONS=374} [2022-11-16 11:39:00,542 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -13 predicate places. [2022-11-16 11:39:00,543 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 374 transitions, 758 flow [2022-11-16 11:39:00,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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) [2022-11-16 11:39:00,563 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:00,563 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:00,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:39:00,564 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:00,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:00,565 INFO L85 PathProgramCache]: Analyzing trace with hash 252991754, now seen corresponding path program 1 times [2022-11-16 11:39:00,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:00,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032364012] [2022-11-16 11:39:00,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:00,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:00,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:00,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032364012] [2022-11-16 11:39:00,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032364012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:00,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:00,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:00,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052076231] [2022-11-16 11:39:00,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:00,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:00,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:00,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:00,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:00,614 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 416 [2022-11-16 11:39:00,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 374 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 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) [2022-11-16 11:39:00,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:00,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 416 [2022-11-16 11:39:00,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:00,816 INFO L130 PetriNetUnfolder]: 49/840 cut-off events. [2022-11-16 11:39:00,816 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-16 11:39:00,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 840 events. 49/840 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4262 event pairs, 6 based on Foata normal form. 0/701 useless extension candidates. Maximal degree in co-relation 797. Up to 31 conditions per place. [2022-11-16 11:39:00,836 INFO L137 encePairwiseOnDemand]: 412/416 looper letters, 14 selfloop transitions, 2 changer transitions 0/376 dead transitions. [2022-11-16 11:39:00,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 376 transitions, 796 flow [2022-11-16 11:39:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2022-11-16 11:39:00,840 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9591346153846154 [2022-11-16 11:39:00,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1197 transitions. [2022-11-16 11:39:00,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1197 transitions. [2022-11-16 11:39:00,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:00,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1197 transitions. [2022-11-16 11:39:00,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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) [2022-11-16 11:39:00,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:00,848 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:00,849 INFO L175 Difference]: Start difference. First operand has 367 places, 374 transitions, 758 flow. Second operand 3 states and 1197 transitions. [2022-11-16 11:39:00,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 376 transitions, 796 flow [2022-11-16 11:39:00,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 376 transitions, 792 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:39:00,857 INFO L231 Difference]: Finished difference. Result has 366 places, 374 transitions, 764 flow [2022-11-16 11:39:00,858 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=366, PETRI_TRANSITIONS=374} [2022-11-16 11:39:00,859 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2022-11-16 11:39:00,859 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 374 transitions, 764 flow [2022-11-16 11:39:00,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 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) [2022-11-16 11:39:00,860 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:00,860 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:00,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:39:00,861 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:00,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash -789318641, now seen corresponding path program 1 times [2022-11-16 11:39:00,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:00,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377677011] [2022-11-16 11:39:00,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:00,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:00,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:00,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377677011] [2022-11-16 11:39:00,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377677011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:00,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:00,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:00,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435103334] [2022-11-16 11:39:00,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:00,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:00,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:00,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:00,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:00,911 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 416 [2022-11-16 11:39:00,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 374 transitions, 764 flow. Second operand has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:00,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:00,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 416 [2022-11-16 11:39:00,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:01,253 INFO L130 PetriNetUnfolder]: 119/1724 cut-off events. [2022-11-16 11:39:01,253 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-16 11:39:01,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1838 conditions, 1724 events. 119/1724 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14112 event pairs, 23 based on Foata normal form. 0/1427 useless extension candidates. Maximal degree in co-relation 1580. Up to 73 conditions per place. [2022-11-16 11:39:01,289 INFO L137 encePairwiseOnDemand]: 410/416 looper letters, 16 selfloop transitions, 3 changer transitions 0/376 dead transitions. [2022-11-16 11:39:01,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 376 transitions, 808 flow [2022-11-16 11:39:01,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1192 transitions. [2022-11-16 11:39:01,293 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9551282051282052 [2022-11-16 11:39:01,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1192 transitions. [2022-11-16 11:39:01,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1192 transitions. [2022-11-16 11:39:01,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:01,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1192 transitions. [2022-11-16 11:39:01,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:01,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:01,302 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:01,303 INFO L175 Difference]: Start difference. First operand has 366 places, 374 transitions, 764 flow. Second operand 3 states and 1192 transitions. [2022-11-16 11:39:01,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 376 transitions, 808 flow [2022-11-16 11:39:01,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 376 transitions, 808 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:39:01,311 INFO L231 Difference]: Finished difference. Result has 366 places, 374 transitions, 779 flow [2022-11-16 11:39:01,312 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=779, PETRI_PLACES=366, PETRI_TRANSITIONS=374} [2022-11-16 11:39:01,313 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2022-11-16 11:39:01,313 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 374 transitions, 779 flow [2022-11-16 11:39:01,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:01,314 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:01,315 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:01,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:39:01,315 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:01,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:01,316 INFO L85 PathProgramCache]: Analyzing trace with hash 355262963, now seen corresponding path program 1 times [2022-11-16 11:39:01,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:01,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130100758] [2022-11-16 11:39:01,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:01,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:01,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:01,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130100758] [2022-11-16 11:39:01,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130100758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:01,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:01,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:01,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227362944] [2022-11-16 11:39:01,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:01,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:01,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:01,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:01,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:01,368 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 416 [2022-11-16 11:39:01,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 374 transitions, 779 flow. Second operand has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 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) [2022-11-16 11:39:01,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:01,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 416 [2022-11-16 11:39:01,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:01,696 INFO L130 PetriNetUnfolder]: 57/1131 cut-off events. [2022-11-16 11:39:01,696 INFO L131 PetriNetUnfolder]: For 13/16 co-relation queries the response was YES. [2022-11-16 11:39:01,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 1131 events. 57/1131 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 7094 event pairs, 4 based on Foata normal form. 0/970 useless extension candidates. Maximal degree in co-relation 1010. Up to 38 conditions per place. [2022-11-16 11:39:01,720 INFO L137 encePairwiseOnDemand]: 412/416 looper letters, 17 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2022-11-16 11:39:01,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 379 transitions, 832 flow [2022-11-16 11:39:01,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:01,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:01,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1200 transitions. [2022-11-16 11:39:01,724 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9615384615384616 [2022-11-16 11:39:01,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1200 transitions. [2022-11-16 11:39:01,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1200 transitions. [2022-11-16 11:39:01,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:01,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1200 transitions. [2022-11-16 11:39:01,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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) [2022-11-16 11:39:01,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:01,732 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:01,732 INFO L175 Difference]: Start difference. First operand has 366 places, 374 transitions, 779 flow. Second operand 3 states and 1200 transitions. [2022-11-16 11:39:01,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 379 transitions, 832 flow [2022-11-16 11:39:01,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 379 transitions, 832 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:39:01,740 INFO L231 Difference]: Finished difference. Result has 367 places, 374 transitions, 789 flow [2022-11-16 11:39:01,741 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=789, PETRI_PLACES=367, PETRI_TRANSITIONS=374} [2022-11-16 11:39:01,742 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -13 predicate places. [2022-11-16 11:39:01,742 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 374 transitions, 789 flow [2022-11-16 11:39:01,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 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) [2022-11-16 11:39:01,743 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:01,744 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:01,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:39:01,744 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:01,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:01,745 INFO L85 PathProgramCache]: Analyzing trace with hash -584159850, now seen corresponding path program 1 times [2022-11-16 11:39:01,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:01,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936102017] [2022-11-16 11:39:01,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:01,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:01,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:01,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936102017] [2022-11-16 11:39:01,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936102017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:01,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:01,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:01,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957153666] [2022-11-16 11:39:01,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:01,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:01,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:01,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:01,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:01,814 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 416 [2022-11-16 11:39:01,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 374 transitions, 789 flow. Second operand has 3 states, 3 states have (on average 395.3333333333333) internal successors, (1186), 3 states have internal predecessors, (1186), 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) [2022-11-16 11:39:01,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:01,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 416 [2022-11-16 11:39:01,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:02,096 INFO L130 PetriNetUnfolder]: 59/1077 cut-off events. [2022-11-16 11:39:02,096 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 11:39:02,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 1077 events. 59/1077 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 7166 event pairs, 8 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 994. Up to 36 conditions per place. [2022-11-16 11:39:02,124 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 13 selfloop transitions, 2 changer transitions 0/375 dead transitions. [2022-11-16 11:39:02,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 375 transitions, 823 flow [2022-11-16 11:39:02,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1198 transitions. [2022-11-16 11:39:02,128 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9599358974358975 [2022-11-16 11:39:02,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1198 transitions. [2022-11-16 11:39:02,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1198 transitions. [2022-11-16 11:39:02,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:02,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1198 transitions. [2022-11-16 11:39:02,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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) [2022-11-16 11:39:02,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:02,136 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:02,136 INFO L175 Difference]: Start difference. First operand has 367 places, 374 transitions, 789 flow. Second operand 3 states and 1198 transitions. [2022-11-16 11:39:02,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 375 transitions, 823 flow [2022-11-16 11:39:02,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 375 transitions, 823 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:39:02,145 INFO L231 Difference]: Finished difference. Result has 368 places, 373 transitions, 791 flow [2022-11-16 11:39:02,146 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=791, PETRI_PLACES=368, PETRI_TRANSITIONS=373} [2022-11-16 11:39:02,147 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -12 predicate places. [2022-11-16 11:39:02,147 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 373 transitions, 791 flow [2022-11-16 11:39:02,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 395.3333333333333) internal successors, (1186), 3 states have internal predecessors, (1186), 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) [2022-11-16 11:39:02,148 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:02,148 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:02,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:39:02,149 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:02,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:02,149 INFO L85 PathProgramCache]: Analyzing trace with hash 840474746, now seen corresponding path program 1 times [2022-11-16 11:39:02,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:02,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088842090] [2022-11-16 11:39:02,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:02,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:02,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:02,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088842090] [2022-11-16 11:39:02,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088842090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:02,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:02,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:02,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98761788] [2022-11-16 11:39:02,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:02,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:02,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:02,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:02,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:02,202 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 390 out of 416 [2022-11-16 11:39:02,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 373 transitions, 791 flow. Second operand has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:02,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:02,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 390 of 416 [2022-11-16 11:39:02,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:02,672 INFO L130 PetriNetUnfolder]: 105/1807 cut-off events. [2022-11-16 11:39:02,672 INFO L131 PetriNetUnfolder]: For 16/20 co-relation queries the response was YES. [2022-11-16 11:39:02,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1975 conditions, 1807 events. 105/1807 cut-off events. For 16/20 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 14596 event pairs, 10 based on Foata normal form. 2/1560 useless extension candidates. Maximal degree in co-relation 1779. Up to 94 conditions per place. [2022-11-16 11:39:02,718 INFO L137 encePairwiseOnDemand]: 410/416 looper letters, 19 selfloop transitions, 3 changer transitions 0/378 dead transitions. [2022-11-16 11:39:02,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 378 transitions, 850 flow [2022-11-16 11:39:02,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1195 transitions. [2022-11-16 11:39:02,723 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9575320512820513 [2022-11-16 11:39:02,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1195 transitions. [2022-11-16 11:39:02,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1195 transitions. [2022-11-16 11:39:02,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:02,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1195 transitions. [2022-11-16 11:39:02,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 398.3333333333333) internal successors, (1195), 3 states have internal predecessors, (1195), 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) [2022-11-16 11:39:02,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:02,732 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:02,732 INFO L175 Difference]: Start difference. First operand has 368 places, 373 transitions, 791 flow. Second operand 3 states and 1195 transitions. [2022-11-16 11:39:02,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 378 transitions, 850 flow [2022-11-16 11:39:02,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 378 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:39:02,741 INFO L231 Difference]: Finished difference. Result has 366 places, 373 transitions, 802 flow [2022-11-16 11:39:02,742 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=802, PETRI_PLACES=366, PETRI_TRANSITIONS=373} [2022-11-16 11:39:02,743 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2022-11-16 11:39:02,743 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 373 transitions, 802 flow [2022-11-16 11:39:02,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 391.6666666666667) internal successors, (1175), 3 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:02,744 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:02,744 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:02,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:39:02,745 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:02,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:02,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1274842071, now seen corresponding path program 1 times [2022-11-16 11:39:02,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:02,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646485663] [2022-11-16 11:39:02,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:02,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:02,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:02,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646485663] [2022-11-16 11:39:02,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646485663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:02,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:02,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888095450] [2022-11-16 11:39:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:02,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:02,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:02,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:02,800 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 416 [2022-11-16 11:39:02,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 373 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 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) [2022-11-16 11:39:02,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:02,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 416 [2022-11-16 11:39:02,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:03,946 INFO L130 PetriNetUnfolder]: 366/5161 cut-off events. [2022-11-16 11:39:03,946 INFO L131 PetriNetUnfolder]: For 69/99 co-relation queries the response was YES. [2022-11-16 11:39:03,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5667 conditions, 5161 events. 366/5161 cut-off events. For 69/99 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 57691 event pairs, 106 based on Foata normal form. 0/4394 useless extension candidates. Maximal degree in co-relation 4903. Up to 331 conditions per place. [2022-11-16 11:39:04,015 INFO L137 encePairwiseOnDemand]: 408/416 looper letters, 18 selfloop transitions, 4 changer transitions 0/375 dead transitions. [2022-11-16 11:39:04,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 375 transitions, 852 flow [2022-11-16 11:39:04,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1187 transitions. [2022-11-16 11:39:04,020 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9511217948717948 [2022-11-16 11:39:04,021 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1187 transitions. [2022-11-16 11:39:04,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1187 transitions. [2022-11-16 11:39:04,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:04,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1187 transitions. [2022-11-16 11:39:04,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 395.6666666666667) internal successors, (1187), 3 states have internal predecessors, (1187), 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) [2022-11-16 11:39:04,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:04,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:04,033 INFO L175 Difference]: Start difference. First operand has 366 places, 373 transitions, 802 flow. Second operand 3 states and 1187 transitions. [2022-11-16 11:39:04,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 375 transitions, 852 flow [2022-11-16 11:39:04,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 375 transitions, 852 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:39:04,044 INFO L231 Difference]: Finished difference. Result has 365 places, 373 transitions, 822 flow [2022-11-16 11:39:04,045 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=365, PETRI_TRANSITIONS=373} [2022-11-16 11:39:04,047 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2022-11-16 11:39:04,047 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 373 transitions, 822 flow [2022-11-16 11:39:04,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 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) [2022-11-16 11:39:04,048 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:04,048 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:04,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:39:04,049 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:04,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:04,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1075203329, now seen corresponding path program 1 times [2022-11-16 11:39:04,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:04,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118932030] [2022-11-16 11:39:04,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:04,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:04,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118932030] [2022-11-16 11:39:04,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118932030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:04,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:04,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:04,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363185047] [2022-11-16 11:39:04,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:04,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:04,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:04,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:04,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:04,143 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 416 [2022-11-16 11:39:04,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 373 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 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) [2022-11-16 11:39:04,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:04,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 416 [2022-11-16 11:39:04,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:04,898 INFO L130 PetriNetUnfolder]: 121/2904 cut-off events. [2022-11-16 11:39:04,898 INFO L131 PetriNetUnfolder]: For 45/47 co-relation queries the response was YES. [2022-11-16 11:39:04,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3159 conditions, 2904 events. 121/2904 cut-off events. For 45/47 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 25762 event pairs, 6 based on Foata normal form. 0/2565 useless extension candidates. Maximal degree in co-relation 2727. Up to 114 conditions per place. [2022-11-16 11:39:04,950 INFO L137 encePairwiseOnDemand]: 412/416 looper letters, 17 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2022-11-16 11:39:04,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 378 transitions, 875 flow [2022-11-16 11:39:04,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:04,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1200 transitions. [2022-11-16 11:39:04,954 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9615384615384616 [2022-11-16 11:39:04,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1200 transitions. [2022-11-16 11:39:04,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1200 transitions. [2022-11-16 11:39:04,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:04,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1200 transitions. [2022-11-16 11:39:04,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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) [2022-11-16 11:39:04,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:04,965 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:04,965 INFO L175 Difference]: Start difference. First operand has 365 places, 373 transitions, 822 flow. Second operand 3 states and 1200 transitions. [2022-11-16 11:39:04,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 378 transitions, 875 flow [2022-11-16 11:39:04,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 378 transitions, 875 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:39:04,974 INFO L231 Difference]: Finished difference. Result has 366 places, 373 transitions, 832 flow [2022-11-16 11:39:04,976 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=366, PETRI_TRANSITIONS=373} [2022-11-16 11:39:04,977 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2022-11-16 11:39:04,977 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 373 transitions, 832 flow [2022-11-16 11:39:04,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 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) [2022-11-16 11:39:04,978 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:04,978 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:04,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:39:04,979 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:04,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:04,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1816750882, now seen corresponding path program 1 times [2022-11-16 11:39:04,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:04,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960164898] [2022-11-16 11:39:04,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:04,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:05,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:05,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:05,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960164898] [2022-11-16 11:39:05,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960164898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:05,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:05,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:05,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007551399] [2022-11-16 11:39:05,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:05,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:05,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:05,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:05,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:05,034 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 416 [2022-11-16 11:39:05,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 373 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 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) [2022-11-16 11:39:05,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:05,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 416 [2022-11-16 11:39:05,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:05,821 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][377], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), 465#(= |#race~filename_5~0| 0), Black: 454#true, 310#L80-7true, Black: 463#true, 475#(= |#race~filename_1~0| 0), 480#(= |#race~filename_4~0| 0), Black: 468#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:05,821 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is cut-off event [2022-11-16 11:39:05,822 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:05,822 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-16 11:39:05,822 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:05,826 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][377], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), 465#(= |#race~filename_5~0| 0), Black: 454#true, 310#L80-7true, Black: 463#true, 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:05,826 INFO L383 tUnfolder$Statistics]: this new event has 215 ancestors and is not cut-off event [2022-11-16 11:39:05,826 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is not cut-off event [2022-11-16 11:39:05,826 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-16 11:39:05,827 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is not cut-off event [2022-11-16 11:39:05,827 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is not cut-off event [2022-11-16 11:39:05,841 INFO L130 PetriNetUnfolder]: 113/3037 cut-off events. [2022-11-16 11:39:05,841 INFO L131 PetriNetUnfolder]: For 36/40 co-relation queries the response was YES. [2022-11-16 11:39:05,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3317 conditions, 3037 events. 113/3037 cut-off events. For 36/40 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 27584 event pairs, 6 based on Foata normal form. 0/2685 useless extension candidates. Maximal degree in co-relation 2884. Up to 87 conditions per place. [2022-11-16 11:39:05,929 INFO L137 encePairwiseOnDemand]: 412/416 looper letters, 17 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2022-11-16 11:39:05,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 378 transitions, 885 flow [2022-11-16 11:39:05,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1200 transitions. [2022-11-16 11:39:05,933 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9615384615384616 [2022-11-16 11:39:05,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1200 transitions. [2022-11-16 11:39:05,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1200 transitions. [2022-11-16 11:39:05,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:05,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1200 transitions. [2022-11-16 11:39:05,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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) [2022-11-16 11:39:05,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:05,943 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:05,943 INFO L175 Difference]: Start difference. First operand has 366 places, 373 transitions, 832 flow. Second operand 3 states and 1200 transitions. [2022-11-16 11:39:05,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 378 transitions, 885 flow [2022-11-16 11:39:05,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 378 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:39:05,951 INFO L231 Difference]: Finished difference. Result has 367 places, 373 transitions, 842 flow [2022-11-16 11:39:05,952 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=367, PETRI_TRANSITIONS=373} [2022-11-16 11:39:05,952 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -13 predicate places. [2022-11-16 11:39:05,953 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 373 transitions, 842 flow [2022-11-16 11:39:05,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 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) [2022-11-16 11:39:05,953 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:05,954 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:05,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:39:05,954 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:05,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:05,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1394284357, now seen corresponding path program 1 times [2022-11-16 11:39:05,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:05,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058362929] [2022-11-16 11:39:05,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:06,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:06,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058362929] [2022-11-16 11:39:06,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058362929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:06,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:06,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:06,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174674321] [2022-11-16 11:39:06,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:06,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:06,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:06,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:06,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:06,008 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 416 [2022-11-16 11:39:06,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 373 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 395.6666666666667) internal successors, (1187), 3 states have internal predecessors, (1187), 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) [2022-11-16 11:39:06,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:06,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 416 [2022-11-16 11:39:06,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:07,381 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][358], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), 310#L80-7true, Black: 463#true, 475#(= |#race~filename_1~0| 0), 483#true, Black: 468#true, 480#(= |#race~filename_4~0| 0), Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:07,381 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is cut-off event [2022-11-16 11:39:07,381 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:07,382 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-16 11:39:07,382 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:07,383 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][358], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), Black: 478#true, 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), 465#(= |#race~filename_5~0| 0), Black: 454#true, 310#L80-7true, Black: 463#true, 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 483#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:07,383 INFO L383 tUnfolder$Statistics]: this new event has 215 ancestors and is not cut-off event [2022-11-16 11:39:07,384 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is not cut-off event [2022-11-16 11:39:07,384 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is not cut-off event [2022-11-16 11:39:07,384 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is not cut-off event [2022-11-16 11:39:07,384 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-16 11:39:07,403 INFO L130 PetriNetUnfolder]: 226/4777 cut-off events. [2022-11-16 11:39:07,403 INFO L131 PetriNetUnfolder]: For 62/159 co-relation queries the response was YES. [2022-11-16 11:39:07,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5427 conditions, 4777 events. 226/4777 cut-off events. For 62/159 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 49031 event pairs, 40 based on Foata normal form. 6/4230 useless extension candidates. Maximal degree in co-relation 4659. Up to 174 conditions per place. [2022-11-16 11:39:07,541 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 13 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2022-11-16 11:39:07,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 374 transitions, 876 flow [2022-11-16 11:39:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:07,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1198 transitions. [2022-11-16 11:39:07,546 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9599358974358975 [2022-11-16 11:39:07,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1198 transitions. [2022-11-16 11:39:07,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1198 transitions. [2022-11-16 11:39:07,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:07,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1198 transitions. [2022-11-16 11:39:07,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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) [2022-11-16 11:39:07,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:07,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:07,558 INFO L175 Difference]: Start difference. First operand has 367 places, 373 transitions, 842 flow. Second operand 3 states and 1198 transitions. [2022-11-16 11:39:07,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 374 transitions, 876 flow [2022-11-16 11:39:07,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 876 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:39:07,568 INFO L231 Difference]: Finished difference. Result has 368 places, 372 transitions, 844 flow [2022-11-16 11:39:07,569 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=844, PETRI_PLACES=368, PETRI_TRANSITIONS=372} [2022-11-16 11:39:07,570 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -12 predicate places. [2022-11-16 11:39:07,570 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 372 transitions, 844 flow [2022-11-16 11:39:07,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 395.6666666666667) internal successors, (1187), 3 states have internal predecessors, (1187), 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) [2022-11-16 11:39:07,571 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:07,571 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:07,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:39:07,572 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:07,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:07,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1496417890, now seen corresponding path program 1 times [2022-11-16 11:39:07,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:07,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667925788] [2022-11-16 11:39:07,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:07,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:07,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:07,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667925788] [2022-11-16 11:39:07,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667925788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:07,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:07,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:07,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068058419] [2022-11-16 11:39:07,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:07,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:07,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:07,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:07,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:07,646 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 416 [2022-11-16 11:39:07,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 372 transitions, 844 flow. Second operand has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 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) [2022-11-16 11:39:07,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:07,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 416 [2022-11-16 11:39:07,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:09,008 INFO L130 PetriNetUnfolder]: 471/7635 cut-off events. [2022-11-16 11:39:09,008 INFO L131 PetriNetUnfolder]: For 145/155 co-relation queries the response was YES. [2022-11-16 11:39:09,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8731 conditions, 7635 events. 471/7635 cut-off events. For 145/155 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 90777 event pairs, 76 based on Foata normal form. 1/6890 useless extension candidates. Maximal degree in co-relation 7814. Up to 624 conditions per place. [2022-11-16 11:39:09,115 INFO L137 encePairwiseOnDemand]: 408/416 looper letters, 20 selfloop transitions, 4 changer transitions 0/376 dead transitions. [2022-11-16 11:39:09,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 376 transitions, 904 flow [2022-11-16 11:39:09,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:09,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1189 transitions. [2022-11-16 11:39:09,119 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9527243589743589 [2022-11-16 11:39:09,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1189 transitions. [2022-11-16 11:39:09,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1189 transitions. [2022-11-16 11:39:09,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:09,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1189 transitions. [2022-11-16 11:39:09,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 396.3333333333333) internal successors, (1189), 3 states have internal predecessors, (1189), 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) [2022-11-16 11:39:09,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:09,126 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:09,126 INFO L175 Difference]: Start difference. First operand has 368 places, 372 transitions, 844 flow. Second operand 3 states and 1189 transitions. [2022-11-16 11:39:09,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 376 transitions, 904 flow [2022-11-16 11:39:09,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 376 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:39:09,135 INFO L231 Difference]: Finished difference. Result has 365 places, 372 transitions, 860 flow [2022-11-16 11:39:09,136 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=365, PETRI_TRANSITIONS=372} [2022-11-16 11:39:09,136 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2022-11-16 11:39:09,137 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 372 transitions, 860 flow [2022-11-16 11:39:09,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 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) [2022-11-16 11:39:09,137 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:09,137 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:09,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:39:09,138 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:09,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:09,138 INFO L85 PathProgramCache]: Analyzing trace with hash -570909011, now seen corresponding path program 1 times [2022-11-16 11:39:09,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:09,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934810089] [2022-11-16 11:39:09,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:09,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:09,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:09,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:09,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934810089] [2022-11-16 11:39:09,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934810089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:09,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:09,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:39:09,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665848571] [2022-11-16 11:39:09,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:09,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:39:09,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:09,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:39:09,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:39:09,570 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 416 [2022-11-16 11:39:09,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 372 transitions, 860 flow. Second operand has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 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) [2022-11-16 11:39:09,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:09,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 416 [2022-11-16 11:39:09,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:10,418 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][355], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 478#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 473#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, Black: 463#true, 489#(= |#race~filename_8~0| 0), Black: 468#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:10,419 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is not cut-off event [2022-11-16 11:39:10,419 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is not cut-off event [2022-11-16 11:39:10,419 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-16 11:39:10,419 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-16 11:39:10,438 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][355], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 480#(= |#race~filename_4~0| 0), Black: 468#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:10,438 INFO L383 tUnfolder$Statistics]: this new event has 223 ancestors and is cut-off event [2022-11-16 11:39:10,438 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:10,439 INFO L386 tUnfolder$Statistics]: existing Event has 231 ancestors and is cut-off event [2022-11-16 11:39:10,439 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:10,439 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][355], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:10,439 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is cut-off event [2022-11-16 11:39:10,439 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:10,440 INFO L386 tUnfolder$Statistics]: existing Event has 231 ancestors and is cut-off event [2022-11-16 11:39:10,440 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-16 11:39:10,440 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:10,442 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][355], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 480#(= |#race~filename_4~0| 0), Black: 468#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:10,443 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is cut-off event [2022-11-16 11:39:10,443 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:10,443 INFO L386 tUnfolder$Statistics]: existing Event has 231 ancestors and is cut-off event [2022-11-16 11:39:10,443 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-16 11:39:10,444 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:10,444 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-16 11:39:10,452 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][355], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:10,453 INFO L383 tUnfolder$Statistics]: this new event has 223 ancestors and is not cut-off event [2022-11-16 11:39:10,453 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is not cut-off event [2022-11-16 11:39:10,453 INFO L386 tUnfolder$Statistics]: existing Event has 231 ancestors and is not cut-off event [2022-11-16 11:39:10,453 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is not cut-off event [2022-11-16 11:39:10,453 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is not cut-off event [2022-11-16 11:39:10,454 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-16 11:39:10,454 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-16 11:39:10,464 INFO L130 PetriNetUnfolder]: 130/3431 cut-off events. [2022-11-16 11:39:10,464 INFO L131 PetriNetUnfolder]: For 6/90 co-relation queries the response was YES. [2022-11-16 11:39:10,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3876 conditions, 3431 events. 130/3431 cut-off events. For 6/90 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 32676 event pairs, 0 based on Foata normal form. 24/3088 useless extension candidates. Maximal degree in co-relation 3373. Up to 104 conditions per place. [2022-11-16 11:39:10,557 INFO L137 encePairwiseOnDemand]: 411/416 looper letters, 23 selfloop transitions, 4 changer transitions 0/371 dead transitions. [2022-11-16 11:39:10,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 371 transitions, 912 flow [2022-11-16 11:39:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:39:10,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:39:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2296 transitions. [2022-11-16 11:39:10,564 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9198717948717948 [2022-11-16 11:39:10,564 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2296 transitions. [2022-11-16 11:39:10,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2296 transitions. [2022-11-16 11:39:10,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:10,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2296 transitions. [2022-11-16 11:39:10,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 382.6666666666667) internal successors, (2296), 6 states have internal predecessors, (2296), 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) [2022-11-16 11:39:10,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 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) [2022-11-16 11:39:10,579 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 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) [2022-11-16 11:39:10,579 INFO L175 Difference]: Start difference. First operand has 365 places, 372 transitions, 860 flow. Second operand 6 states and 2296 transitions. [2022-11-16 11:39:10,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 371 transitions, 912 flow [2022-11-16 11:39:10,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 371 transitions, 912 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:39:10,587 INFO L231 Difference]: Finished difference. Result has 369 places, 371 transitions, 866 flow [2022-11-16 11:39:10,588 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=866, PETRI_PLACES=369, PETRI_TRANSITIONS=371} [2022-11-16 11:39:10,588 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -11 predicate places. [2022-11-16 11:39:10,589 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 371 transitions, 866 flow [2022-11-16 11:39:10,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 380.0) internal successors, (2280), 6 states have internal predecessors, (2280), 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) [2022-11-16 11:39:10,590 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:10,590 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:10,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:39:10,591 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:10,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:10,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2011443033, now seen corresponding path program 1 times [2022-11-16 11:39:10,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:10,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829560194] [2022-11-16 11:39:10,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:10,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:10,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:10,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829560194] [2022-11-16 11:39:10,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829560194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:10,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:10,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:10,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59494288] [2022-11-16 11:39:10,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:10,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:10,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:10,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:10,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:10,666 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 416 [2022-11-16 11:39:10,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 371 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:10,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:10,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 416 [2022-11-16 11:39:10,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:11,587 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1090] L56-38-->L56-39: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][218], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 478#true, 470#(= |#race~isNull_6~0| 0), 73#L56-39true, Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 499#true, 473#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), Black: 468#true, 206#L79-7true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,588 INFO L383 tUnfolder$Statistics]: this new event has 177 ancestors and is cut-off event [2022-11-16 11:39:11,588 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-16 11:39:11,588 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-16 11:39:11,588 INFO L386 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-11-16 11:39:11,780 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1159] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][341], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 73#L56-39true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 499#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,781 INFO L383 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2022-11-16 11:39:11,781 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-16 11:39:11,781 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-16 11:39:11,781 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-16 11:39:11,782 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1159] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][341], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 73#L56-39true, 470#(= |#race~isNull_6~0| 0), 465#(= |#race~filename_5~0| 0), Black: 454#true, Black: 487#true, 499#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,783 INFO L383 tUnfolder$Statistics]: this new event has 213 ancestors and is cut-off event [2022-11-16 11:39:11,783 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-16 11:39:11,783 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-16 11:39:11,783 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-16 11:39:11,783 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-16 11:39:11,785 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1159] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][341], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), Black: 478#true, 456#(= |#race~filename_2~0| 0), Black: 449#true, 73#L56-39true, 470#(= |#race~isNull_6~0| 0), 465#(= |#race~filename_5~0| 0), Black: 454#true, Black: 487#true, 499#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,785 INFO L383 tUnfolder$Statistics]: this new event has 241 ancestors and is cut-off event [2022-11-16 11:39:11,785 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-16 11:39:11,786 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-16 11:39:11,786 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-16 11:39:11,786 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-16 11:39:11,786 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-16 11:39:11,792 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1159] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][347], [Black: 444#true, 501#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), 465#(= |#race~filename_5~0| 0), Black: 454#true, Black: 487#true, 234#L56-40true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,793 INFO L383 tUnfolder$Statistics]: this new event has 214 ancestors and is cut-off event [2022-11-16 11:39:11,793 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-16 11:39:11,793 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-16 11:39:11,793 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-16 11:39:11,794 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1159] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][347], [Black: 444#true, 501#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 451#(= |#race~isNull_3~0| 0), Black: 478#true, 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), 465#(= |#race~filename_5~0| 0), Black: 454#true, Black: 487#true, 234#L56-40true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,795 INFO L383 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-11-16 11:39:11,795 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-16 11:39:11,795 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-16 11:39:11,795 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-16 11:39:11,795 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-16 11:39:11,801 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1159] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][347], [Black: 444#true, 501#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), 465#(= |#race~filename_5~0| 0), Black: 454#true, Black: 487#true, 173#L56-41true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,802 INFO L383 tUnfolder$Statistics]: this new event has 215 ancestors and is cut-off event [2022-11-16 11:39:11,802 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-16 11:39:11,802 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 11:39:11,802 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-16 11:39:11,803 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1159] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][347], [Black: 444#true, 501#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), 451#(= |#race~isNull_3~0| 0), Black: 478#true, 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), 465#(= |#race~filename_5~0| 0), Black: 454#true, Black: 487#true, 173#L56-41true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,804 INFO L383 tUnfolder$Statistics]: this new event has 243 ancestors and is cut-off event [2022-11-16 11:39:11,804 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:39:11,804 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-16 11:39:11,804 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 11:39:11,804 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-16 11:39:11,821 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1159] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][341], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), 47#L58true, 465#(= |#race~filename_5~0| 0), Black: 454#true, Black: 487#true, 499#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,821 INFO L383 tUnfolder$Statistics]: this new event has 221 ancestors and is cut-off event [2022-11-16 11:39:11,822 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-16 11:39:11,822 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-16 11:39:11,822 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-16 11:39:11,823 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1159] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][341], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), Black: 478#true, 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), 47#L58true, 465#(= |#race~filename_5~0| 0), Black: 454#true, Black: 487#true, 499#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,823 INFO L383 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-11-16 11:39:11,823 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-16 11:39:11,824 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-16 11:39:11,824 INFO L386 tUnfolder$Statistics]: existing Event has 221 ancestors and is cut-off event [2022-11-16 11:39:11,824 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-16 11:39:11,825 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1090] L56-38-->L56-39: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][218], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), 73#L56-39true, Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 499#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 480#(= |#race~filename_4~0| 0), Black: 468#true, 206#L79-7true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,826 INFO L383 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2022-11-16 11:39:11,826 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-16 11:39:11,826 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-16 11:39:11,826 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-16 11:39:11,826 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1090] L56-38-->L56-39: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][218], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), 73#L56-39true, 465#(= |#race~filename_5~0| 0), Black: 454#true, Black: 487#true, 499#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,827 INFO L383 tUnfolder$Statistics]: this new event has 241 ancestors and is cut-off event [2022-11-16 11:39:11,827 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-16 11:39:11,827 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-16 11:39:11,827 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-16 11:39:11,827 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-16 11:39:11,829 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1090] L56-38-->L56-39: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][218], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 73#L56-39true, 470#(= |#race~isNull_6~0| 0), 465#(= |#race~filename_5~0| 0), Black: 454#true, Black: 487#true, 499#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 480#(= |#race~filename_4~0| 0), Black: 468#true, 206#L79-7true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,829 INFO L383 tUnfolder$Statistics]: this new event has 241 ancestors and is cut-off event [2022-11-16 11:39:11,829 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-16 11:39:11,830 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-16 11:39:11,830 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-16 11:39:11,830 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-16 11:39:11,830 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-16 11:39:11,845 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([1090] L56-38-->L56-39: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet18#1][218], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), 73#L56-39true, Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 499#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,845 INFO L383 tUnfolder$Statistics]: this new event has 205 ancestors and is not cut-off event [2022-11-16 11:39:11,846 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is not cut-off event [2022-11-16 11:39:11,846 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is not cut-off event [2022-11-16 11:39:11,846 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is not cut-off event [2022-11-16 11:39:11,846 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is not cut-off event [2022-11-16 11:39:11,846 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is not cut-off event [2022-11-16 11:39:11,847 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is not cut-off event [2022-11-16 11:39:11,847 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1159] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][347], [Black: 444#true, 501#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), 234#L56-40true, Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,847 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-11-16 11:39:11,847 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-16 11:39:11,847 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-16 11:39:11,848 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-16 11:39:11,848 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-16 11:39:11,848 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-16 11:39:11,850 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1159] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][347], [Black: 444#true, 501#(= |#race~result_11~0| |thread3Thread1of1ForFork0_#t~nondet18#1|), Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 173#L56-41true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,851 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is cut-off event [2022-11-16 11:39:11,851 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:39:11,851 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-16 11:39:11,851 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-16 11:39:11,851 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 11:39:11,852 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-16 11:39:11,858 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1159] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][341], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), 47#L58true, Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 499#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:11,859 INFO L383 tUnfolder$Statistics]: this new event has 213 ancestors and is cut-off event [2022-11-16 11:39:11,859 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-16 11:39:11,859 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-16 11:39:11,859 INFO L386 tUnfolder$Statistics]: existing Event has 221 ancestors and is cut-off event [2022-11-16 11:39:11,859 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-16 11:39:11,860 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-16 11:39:11,879 INFO L130 PetriNetUnfolder]: 375/4218 cut-off events. [2022-11-16 11:39:11,879 INFO L131 PetriNetUnfolder]: For 259/283 co-relation queries the response was YES. [2022-11-16 11:39:11,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5300 conditions, 4218 events. 375/4218 cut-off events. For 259/283 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 44257 event pairs, 82 based on Foata normal form. 0/3812 useless extension candidates. Maximal degree in co-relation 5172. Up to 409 conditions per place. [2022-11-16 11:39:11,952 INFO L137 encePairwiseOnDemand]: 413/416 looper letters, 12 selfloop transitions, 2 changer transitions 0/372 dead transitions. [2022-11-16 11:39:11,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 372 transitions, 898 flow [2022-11-16 11:39:11,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1197 transitions. [2022-11-16 11:39:11,957 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9591346153846154 [2022-11-16 11:39:11,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1197 transitions. [2022-11-16 11:39:11,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1197 transitions. [2022-11-16 11:39:11,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:11,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1197 transitions. [2022-11-16 11:39:11,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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) [2022-11-16 11:39:11,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:11,966 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:11,966 INFO L175 Difference]: Start difference. First operand has 369 places, 371 transitions, 866 flow. Second operand 3 states and 1197 transitions. [2022-11-16 11:39:11,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 372 transitions, 898 flow [2022-11-16 11:39:11,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 372 transitions, 891 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:39:11,974 INFO L231 Difference]: Finished difference. Result has 366 places, 370 transitions, 861 flow [2022-11-16 11:39:11,975 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=861, PETRI_PLACES=366, PETRI_TRANSITIONS=370} [2022-11-16 11:39:11,977 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2022-11-16 11:39:11,977 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 370 transitions, 861 flow [2022-11-16 11:39:11,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:11,978 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:11,978 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:11,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:39:11,979 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:11,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:11,980 INFO L85 PathProgramCache]: Analyzing trace with hash -359961561, now seen corresponding path program 1 times [2022-11-16 11:39:11,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:11,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191587787] [2022-11-16 11:39:11,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:11,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:12,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:12,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:12,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191587787] [2022-11-16 11:39:12,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191587787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:12,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:12,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:12,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632839292] [2022-11-16 11:39:12,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:12,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:12,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:12,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:12,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:12,037 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 393 out of 416 [2022-11-16 11:39:12,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 370 transitions, 861 flow. Second operand has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 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) [2022-11-16 11:39:12,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:12,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 393 of 416 [2022-11-16 11:39:12,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:13,297 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][357], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 478#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 499#true, 473#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, 503#true, Black: 463#true, 489#(= |#race~filename_8~0| 0), Black: 468#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:13,297 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is not cut-off event [2022-11-16 11:39:13,297 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-16 11:39:13,298 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is not cut-off event [2022-11-16 11:39:13,298 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-16 11:39:13,408 INFO L130 PetriNetUnfolder]: 252/5760 cut-off events. [2022-11-16 11:39:13,409 INFO L131 PetriNetUnfolder]: For 93/99 co-relation queries the response was YES. [2022-11-16 11:39:13,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6645 conditions, 5760 events. 252/5760 cut-off events. For 93/99 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 61713 event pairs, 20 based on Foata normal form. 0/5350 useless extension candidates. Maximal degree in co-relation 6218. Up to 304 conditions per place. [2022-11-16 11:39:13,547 INFO L137 encePairwiseOnDemand]: 412/416 looper letters, 16 selfloop transitions, 2 changer transitions 0/374 dead transitions. [2022-11-16 11:39:13,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 374 transitions, 909 flow [2022-11-16 11:39:13,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1199 transitions. [2022-11-16 11:39:13,551 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9607371794871795 [2022-11-16 11:39:13,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1199 transitions. [2022-11-16 11:39:13,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1199 transitions. [2022-11-16 11:39:13,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:13,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1199 transitions. [2022-11-16 11:39:13,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 399.6666666666667) internal successors, (1199), 3 states have internal predecessors, (1199), 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) [2022-11-16 11:39:13,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:13,559 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:13,559 INFO L175 Difference]: Start difference. First operand has 366 places, 370 transitions, 861 flow. Second operand 3 states and 1199 transitions. [2022-11-16 11:39:13,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 374 transitions, 909 flow [2022-11-16 11:39:13,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 374 transitions, 905 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:39:13,670 INFO L231 Difference]: Finished difference. Result has 365 places, 370 transitions, 867 flow [2022-11-16 11:39:13,671 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=867, PETRI_PLACES=365, PETRI_TRANSITIONS=370} [2022-11-16 11:39:13,671 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -15 predicate places. [2022-11-16 11:39:13,672 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 370 transitions, 867 flow [2022-11-16 11:39:13,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 395.0) internal successors, (1185), 3 states have internal predecessors, (1185), 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) [2022-11-16 11:39:13,672 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:13,673 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:13,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 11:39:13,673 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:13,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:13,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1441245710, now seen corresponding path program 1 times [2022-11-16 11:39:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:13,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515099806] [2022-11-16 11:39:13,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:13,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:14,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:14,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515099806] [2022-11-16 11:39:14,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515099806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:14,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:14,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:39:14,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022479021] [2022-11-16 11:39:14,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:14,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:39:14,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:14,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:39:14,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:39:14,539 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 416 [2022-11-16 11:39:14,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 370 transitions, 867 flow. Second operand has 6 states, 6 states have (on average 381.0) internal successors, (2286), 6 states have internal predecessors, (2286), 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) [2022-11-16 11:39:14,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:14,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 416 [2022-11-16 11:39:14,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:15,590 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][353], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 478#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 473#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 503#true, 310#L80-7true, Black: 463#true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 489#(= |#race~filename_8~0| 0), Black: 468#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:15,590 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is not cut-off event [2022-11-16 11:39:15,590 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-16 11:39:15,590 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is not cut-off event [2022-11-16 11:39:15,590 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-16 11:39:15,624 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][353], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, Black: 463#true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), 480#(= |#race~filename_4~0| 0), Black: 468#true, Black: 503#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:15,624 INFO L383 tUnfolder$Statistics]: this new event has 251 ancestors and is cut-off event [2022-11-16 11:39:15,624 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-16 11:39:15,624 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:15,624 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-16 11:39:15,625 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][353], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, Black: 463#true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), Black: 503#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:15,625 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is cut-off event [2022-11-16 11:39:15,625 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-16 11:39:15,625 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:15,626 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:15,626 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-16 11:39:15,626 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][353], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, Black: 463#true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), Black: 503#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:15,626 INFO L383 tUnfolder$Statistics]: this new event has 287 ancestors and is cut-off event [2022-11-16 11:39:15,627 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-16 11:39:15,627 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:15,627 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-16 11:39:15,627 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:15,627 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-16 11:39:15,628 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][353], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), Black: 478#true, 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, Black: 463#true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), Black: 503#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:15,628 INFO L383 tUnfolder$Statistics]: this new event has 251 ancestors and is not cut-off event [2022-11-16 11:39:15,629 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-16 11:39:15,629 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is not cut-off event [2022-11-16 11:39:15,629 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-16 11:39:15,629 INFO L386 tUnfolder$Statistics]: existing Event has 287 ancestors and is not cut-off event [2022-11-16 11:39:15,629 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is not cut-off event [2022-11-16 11:39:15,629 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-16 11:39:15,633 INFO L130 PetriNetUnfolder]: 141/3734 cut-off events. [2022-11-16 11:39:15,633 INFO L131 PetriNetUnfolder]: For 6/86 co-relation queries the response was YES. [2022-11-16 11:39:15,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4283 conditions, 3734 events. 141/3734 cut-off events. For 6/86 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 36046 event pairs, 0 based on Foata normal form. 16/3467 useless extension candidates. Maximal degree in co-relation 4151. Up to 96 conditions per place. [2022-11-16 11:39:15,742 INFO L137 encePairwiseOnDemand]: 411/416 looper letters, 22 selfloop transitions, 4 changer transitions 0/369 dead transitions. [2022-11-16 11:39:15,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 369 transitions, 917 flow [2022-11-16 11:39:15,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:39:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:39:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2295 transitions. [2022-11-16 11:39:15,748 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9194711538461539 [2022-11-16 11:39:15,749 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2295 transitions. [2022-11-16 11:39:15,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2295 transitions. [2022-11-16 11:39:15,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:15,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2295 transitions. [2022-11-16 11:39:15,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 382.5) internal successors, (2295), 6 states have internal predecessors, (2295), 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) [2022-11-16 11:39:15,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 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) [2022-11-16 11:39:15,762 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 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) [2022-11-16 11:39:15,762 INFO L175 Difference]: Start difference. First operand has 365 places, 370 transitions, 867 flow. Second operand 6 states and 2295 transitions. [2022-11-16 11:39:15,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 369 transitions, 917 flow [2022-11-16 11:39:15,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 369 transitions, 917 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:39:15,771 INFO L231 Difference]: Finished difference. Result has 369 places, 369 transitions, 873 flow [2022-11-16 11:39:15,772 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=873, PETRI_PLACES=369, PETRI_TRANSITIONS=369} [2022-11-16 11:39:15,773 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -11 predicate places. [2022-11-16 11:39:15,773 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 369 transitions, 873 flow [2022-11-16 11:39:15,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 381.0) internal successors, (2286), 6 states have internal predecessors, (2286), 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) [2022-11-16 11:39:15,774 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:15,774 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:15,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 11:39:15,775 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:15,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:15,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1043602119, now seen corresponding path program 1 times [2022-11-16 11:39:15,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:15,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871037059] [2022-11-16 11:39:15,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:15,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:16,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:16,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871037059] [2022-11-16 11:39:16,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871037059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:16,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:16,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:39:16,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664851609] [2022-11-16 11:39:16,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:16,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:39:16,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:16,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:39:16,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:39:16,338 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 416 [2022-11-16 11:39:16,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 369 transitions, 873 flow. Second operand has 6 states, 6 states have (on average 382.0) internal successors, (2292), 6 states have internal predecessors, (2292), 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) [2022-11-16 11:39:16,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:16,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 416 [2022-11-16 11:39:16,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:17,233 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][352], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 478#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 473#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 503#true, 310#L80-7true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 463#true, 489#(= |#race~filename_8~0| 0), Black: 468#true, 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:17,233 INFO L383 tUnfolder$Statistics]: this new event has 195 ancestors and is not cut-off event [2022-11-16 11:39:17,233 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is not cut-off event [2022-11-16 11:39:17,233 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-16 11:39:17,233 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-16 11:39:17,258 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][352], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), Black: 503#true, Black: 473#true, 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:17,258 INFO L383 tUnfolder$Statistics]: this new event has 251 ancestors and is cut-off event [2022-11-16 11:39:17,258 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-16 11:39:17,259 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-16 11:39:17,259 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:17,259 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][352], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), Black: 503#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0), 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0))]) [2022-11-16 11:39:17,259 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is cut-off event [2022-11-16 11:39:17,259 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-16 11:39:17,259 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-16 11:39:17,259 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:17,259 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:17,260 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][352], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), Black: 503#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0), 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0))]) [2022-11-16 11:39:17,260 INFO L383 tUnfolder$Statistics]: this new event has 287 ancestors and is cut-off event [2022-11-16 11:39:17,260 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-16 11:39:17,260 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-16 11:39:17,260 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:17,260 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:17,260 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-16 11:39:17,261 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][352], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), Black: 478#true, 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), Black: 503#true, Black: 473#true, 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:17,261 INFO L383 tUnfolder$Statistics]: this new event has 251 ancestors and is not cut-off event [2022-11-16 11:39:17,261 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-16 11:39:17,261 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-16 11:39:17,261 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is not cut-off event [2022-11-16 11:39:17,261 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is not cut-off event [2022-11-16 11:39:17,262 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-16 11:39:17,262 INFO L386 tUnfolder$Statistics]: existing Event has 287 ancestors and is not cut-off event [2022-11-16 11:39:17,265 INFO L130 PetriNetUnfolder]: 141/3725 cut-off events. [2022-11-16 11:39:17,265 INFO L131 PetriNetUnfolder]: For 9/87 co-relation queries the response was YES. [2022-11-16 11:39:17,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4284 conditions, 3725 events. 141/3725 cut-off events. For 9/87 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 35989 event pairs, 0 based on Foata normal form. 8/3459 useless extension candidates. Maximal degree in co-relation 4151. Up to 95 conditions per place. [2022-11-16 11:39:17,327 INFO L137 encePairwiseOnDemand]: 411/416 looper letters, 21 selfloop transitions, 4 changer transitions 0/368 dead transitions. [2022-11-16 11:39:17,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 368 transitions, 921 flow [2022-11-16 11:39:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:39:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:39:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2294 transitions. [2022-11-16 11:39:17,333 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9190705128205128 [2022-11-16 11:39:17,333 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2294 transitions. [2022-11-16 11:39:17,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2294 transitions. [2022-11-16 11:39:17,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:17,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2294 transitions. [2022-11-16 11:39:17,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 382.3333333333333) internal successors, (2294), 6 states have internal predecessors, (2294), 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) [2022-11-16 11:39:17,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 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) [2022-11-16 11:39:17,347 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 416.0) internal successors, (2912), 7 states have internal predecessors, (2912), 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) [2022-11-16 11:39:17,348 INFO L175 Difference]: Start difference. First operand has 369 places, 369 transitions, 873 flow. Second operand 6 states and 2294 transitions. [2022-11-16 11:39:17,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 368 transitions, 921 flow [2022-11-16 11:39:17,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 368 transitions, 914 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:39:17,359 INFO L231 Difference]: Finished difference. Result has 369 places, 368 transitions, 872 flow [2022-11-16 11:39:17,359 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=872, PETRI_PLACES=369, PETRI_TRANSITIONS=368} [2022-11-16 11:39:17,360 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -11 predicate places. [2022-11-16 11:39:17,360 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 368 transitions, 872 flow [2022-11-16 11:39:17,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 382.0) internal successors, (2292), 6 states have internal predecessors, (2292), 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) [2022-11-16 11:39:17,361 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:17,362 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:17,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 11:39:17,362 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:17,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:17,363 INFO L85 PathProgramCache]: Analyzing trace with hash -787580262, now seen corresponding path program 1 times [2022-11-16 11:39:17,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:17,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912560968] [2022-11-16 11:39:17,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:17,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:17,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:17,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:17,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912560968] [2022-11-16 11:39:17,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912560968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:17,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:17,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:17,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388981692] [2022-11-16 11:39:17,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:17,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:17,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:17,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:17,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:17,461 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 416 [2022-11-16 11:39:17,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 368 transitions, 872 flow. Second operand has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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) [2022-11-16 11:39:17,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:17,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 416 [2022-11-16 11:39:17,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:18,435 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][352], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), 522#true, 465#(= |#race~filename_5~0| 0), Black: 454#true, Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, Black: 463#true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), Black: 503#true, Black: 473#true, 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:18,435 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is cut-off event [2022-11-16 11:39:18,435 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:18,435 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is cut-off event [2022-11-16 11:39:18,435 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-16 11:39:18,436 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][352], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), Black: 478#true, 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), 522#true, 465#(= |#race~filename_5~0| 0), Black: 454#true, Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), Black: 503#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0), 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0))]) [2022-11-16 11:39:18,436 INFO L383 tUnfolder$Statistics]: this new event has 251 ancestors and is not cut-off event [2022-11-16 11:39:18,436 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is not cut-off event [2022-11-16 11:39:18,436 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is not cut-off event [2022-11-16 11:39:18,437 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-16 11:39:18,437 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-16 11:39:18,440 INFO L130 PetriNetUnfolder]: 207/5288 cut-off events. [2022-11-16 11:39:18,440 INFO L131 PetriNetUnfolder]: For 34/61 co-relation queries the response was YES. [2022-11-16 11:39:18,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6065 conditions, 5288 events. 207/5288 cut-off events. For 34/61 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 55856 event pairs, 12 based on Foata normal form. 0/4935 useless extension candidates. Maximal degree in co-relation 5736. Up to 140 conditions per place. [2022-11-16 11:39:18,520 INFO L137 encePairwiseOnDemand]: 414/416 looper letters, 9 selfloop transitions, 1 changer transitions 0/367 dead transitions. [2022-11-16 11:39:18,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 367 transitions, 890 flow [2022-11-16 11:39:18,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1199 transitions. [2022-11-16 11:39:18,524 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9607371794871795 [2022-11-16 11:39:18,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1199 transitions. [2022-11-16 11:39:18,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1199 transitions. [2022-11-16 11:39:18,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:18,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1199 transitions. [2022-11-16 11:39:18,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 399.6666666666667) internal successors, (1199), 3 states have internal predecessors, (1199), 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) [2022-11-16 11:39:18,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:18,533 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:18,533 INFO L175 Difference]: Start difference. First operand has 369 places, 368 transitions, 872 flow. Second operand 3 states and 1199 transitions. [2022-11-16 11:39:18,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 367 transitions, 890 flow [2022-11-16 11:39:18,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 367 transitions, 883 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:39:18,543 INFO L231 Difference]: Finished difference. Result has 366 places, 367 transitions, 865 flow [2022-11-16 11:39:18,544 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=865, PETRI_PLACES=366, PETRI_TRANSITIONS=367} [2022-11-16 11:39:18,544 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2022-11-16 11:39:18,544 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 367 transitions, 865 flow [2022-11-16 11:39:18,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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) [2022-11-16 11:39:18,545 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:18,546 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:18,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 11:39:18,546 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:18,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:18,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1111929360, now seen corresponding path program 1 times [2022-11-16 11:39:18,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:18,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435213103] [2022-11-16 11:39:18,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:18,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:18,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:18,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435213103] [2022-11-16 11:39:18,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435213103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:18,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:18,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:18,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675608592] [2022-11-16 11:39:18,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:18,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:18,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:18,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:18,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:18,628 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 416 [2022-11-16 11:39:18,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 367 transitions, 865 flow. Second operand has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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) [2022-11-16 11:39:18,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:18,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 416 [2022-11-16 11:39:18,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:19,885 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1160] thread3EXIT-->L80-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][352], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), 522#true, Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 310#L80-7true, 526#true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), Black: 503#true, Black: 473#true, 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:19,885 INFO L383 tUnfolder$Statistics]: this new event has 251 ancestors and is not cut-off event [2022-11-16 11:39:19,885 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is not cut-off event [2022-11-16 11:39:19,886 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-16 11:39:19,886 INFO L386 tUnfolder$Statistics]: existing Event has 251 ancestors and is not cut-off event [2022-11-16 11:39:19,889 INFO L130 PetriNetUnfolder]: 222/6057 cut-off events. [2022-11-16 11:39:19,889 INFO L131 PetriNetUnfolder]: For 51/109 co-relation queries the response was YES. [2022-11-16 11:39:19,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6962 conditions, 6057 events. 222/6057 cut-off events. For 51/109 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 66325 event pairs, 46 based on Foata normal form. 0/5672 useless extension candidates. Maximal degree in co-relation 6722. Up to 158 conditions per place. [2022-11-16 11:39:19,997 INFO L137 encePairwiseOnDemand]: 414/416 looper letters, 9 selfloop transitions, 1 changer transitions 0/366 dead transitions. [2022-11-16 11:39:19,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 366 transitions, 883 flow [2022-11-16 11:39:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1199 transitions. [2022-11-16 11:39:20,001 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9607371794871795 [2022-11-16 11:39:20,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1199 transitions. [2022-11-16 11:39:20,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1199 transitions. [2022-11-16 11:39:20,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:20,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1199 transitions. [2022-11-16 11:39:20,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 399.6666666666667) internal successors, (1199), 3 states have internal predecessors, (1199), 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) [2022-11-16 11:39:20,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:20,009 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:20,010 INFO L175 Difference]: Start difference. First operand has 366 places, 367 transitions, 865 flow. Second operand 3 states and 1199 transitions. [2022-11-16 11:39:20,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 366 transitions, 883 flow [2022-11-16 11:39:20,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 366 transitions, 882 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:39:20,018 INFO L231 Difference]: Finished difference. Result has 366 places, 366 transitions, 864 flow [2022-11-16 11:39:20,019 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=366, PETRI_TRANSITIONS=366} [2022-11-16 11:39:20,020 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2022-11-16 11:39:20,020 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 366 transitions, 864 flow [2022-11-16 11:39:20,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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) [2022-11-16 11:39:20,021 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:20,021 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:20,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 11:39:20,021 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2022-11-16 11:39:20,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:20,022 INFO L85 PathProgramCache]: Analyzing trace with hash 138352230, now seen corresponding path program 1 times [2022-11-16 11:39:20,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:20,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944936834] [2022-11-16 11:39:20,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:20,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:39:20,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:20,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944936834] [2022-11-16 11:39:20,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944936834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:20,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:20,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:20,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111176720] [2022-11-16 11:39:20,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:20,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:20,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:20,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:20,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:20,123 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 416 [2022-11-16 11:39:20,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 366 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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) [2022-11-16 11:39:20,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:20,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 416 [2022-11-16 11:39:20,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:20,880 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1094] L56-39-->L56-40: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][227], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 478#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 234#L56-40true, 530#true, 473#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 503#true, 526#true, Black: 463#true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 489#(= |#race~filename_8~0| 0), Black: 468#true, 206#L79-7true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:20,880 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-11-16 11:39:20,880 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-11-16 11:39:20,880 INFO L386 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2022-11-16 11:39:20,880 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-11-16 11:39:21,028 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1094] L56-39-->L56-40: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][227], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 234#L56-40true, 530#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 526#true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 503#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:21,028 INFO L383 tUnfolder$Statistics]: this new event has 234 ancestors and is cut-off event [2022-11-16 11:39:21,029 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-16 11:39:21,029 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-16 11:39:21,029 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-16 11:39:21,041 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1159] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][339], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 530#true, 173#L56-41true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 526#true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 503#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:21,042 INFO L383 tUnfolder$Statistics]: this new event has 243 ancestors and is cut-off event [2022-11-16 11:39:21,042 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-16 11:39:21,042 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-16 11:39:21,042 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-16 11:39:21,042 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1159] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][339], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 530#true, 234#L56-40true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 526#true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 503#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:21,042 INFO L383 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-11-16 11:39:21,042 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-16 11:39:21,042 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-16 11:39:21,042 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-16 11:39:21,044 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1094] L56-39-->L56-40: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][227], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), Black: 478#true, 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), 234#L56-40true, 530#true, Black: 487#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 526#true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 503#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:21,044 INFO L383 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-11-16 11:39:21,044 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-16 11:39:21,044 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-16 11:39:21,045 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-16 11:39:21,045 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-16 11:39:21,045 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1094] L56-39-->L56-40: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][227], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), Black: 478#true, 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 234#L56-40true, 530#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 526#true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 503#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:21,045 INFO L383 tUnfolder$Statistics]: this new event has 270 ancestors and is cut-off event [2022-11-16 11:39:21,045 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-16 11:39:21,045 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-16 11:39:21,046 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-16 11:39:21,046 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-16 11:39:21,046 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-16 11:39:21,046 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([1094] L56-39-->L56-40: Formula: (= |v_thread3Thread1of1ForFork0_#t~nondet18#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork0_#t~nondet18#1=|v_thread3Thread1of1ForFork0_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][227], [Black: 444#true, 451#(= |#race~isNull_3~0| 0), Black: 478#true, 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), Black: 487#true, 234#L56-40true, 530#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 526#true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), 480#(= |#race~filename_4~0| 0), Black: 468#true, 206#L79-7true, Black: 503#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:21,047 INFO L383 tUnfolder$Statistics]: this new event has 234 ancestors and is cut-off event [2022-11-16 11:39:21,047 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-16 11:39:21,047 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-16 11:39:21,047 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-16 11:39:21,047 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-16 11:39:21,048 INFO L386 tUnfolder$Statistics]: existing Event has 270 ancestors and is cut-off event [2022-11-16 11:39:21,048 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-16 11:39:21,061 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1159] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][339], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), 234#L56-40true, Black: 487#true, 530#true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 526#true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 503#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:21,061 INFO L383 tUnfolder$Statistics]: this new event has 234 ancestors and is not cut-off event [2022-11-16 11:39:21,061 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is not cut-off event [2022-11-16 11:39:21,061 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is not cut-off event [2022-11-16 11:39:21,061 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is not cut-off event [2022-11-16 11:39:21,062 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is not cut-off event [2022-11-16 11:39:21,062 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1159] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_5|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][339], [Black: 444#true, Black: 478#true, 451#(= |#race~isNull_3~0| 0), 456#(= |#race~filename_2~0| 0), Black: 449#true, 470#(= |#race~isNull_6~0| 0), Black: 454#true, 465#(= |#race~filename_5~0| 0), 530#true, Black: 487#true, 173#L56-41true, 497#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 526#true, 513#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 463#true, 489#(= |#race~filename_8~0| 0), 475#(= |#race~filename_1~0| 0), 505#(= |#race~filename_7~0| 0), Black: 468#true, 480#(= |#race~filename_4~0| 0), 206#L79-7true, Black: 503#true, Black: 473#true, 446#(= |#race~isNull_0~0| 0)]) [2022-11-16 11:39:21,062 INFO L383 tUnfolder$Statistics]: this new event has 235 ancestors and is cut-off event [2022-11-16 11:39:21,062 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-16 11:39:21,063 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-16 11:39:21,063 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-16 11:39:21,063 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-16 11:39:21,070 INFO L130 PetriNetUnfolder]: 263/4528 cut-off events. [2022-11-16 11:39:21,071 INFO L131 PetriNetUnfolder]: For 152/168 co-relation queries the response was YES. [2022-11-16 11:39:21,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5471 conditions, 4528 events. 263/4528 cut-off events. For 152/168 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 47063 event pairs, 96 based on Foata normal form. 24/4227 useless extension candidates. Maximal degree in co-relation 5363. Up to 429 conditions per place. [2022-11-16 11:39:21,134 INFO L137 encePairwiseOnDemand]: 414/416 looper letters, 0 selfloop transitions, 0 changer transitions 365/365 dead transitions. [2022-11-16 11:39:21,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 365 transitions, 880 flow [2022-11-16 11:39:21,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1198 transitions. [2022-11-16 11:39:21,137 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9599358974358975 [2022-11-16 11:39:21,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1198 transitions. [2022-11-16 11:39:21,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1198 transitions. [2022-11-16 11:39:21,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:21,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1198 transitions. [2022-11-16 11:39:21,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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) [2022-11-16 11:39:21,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:21,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 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) [2022-11-16 11:39:21,146 INFO L175 Difference]: Start difference. First operand has 366 places, 366 transitions, 864 flow. Second operand 3 states and 1198 transitions. [2022-11-16 11:39:21,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 365 transitions, 880 flow [2022-11-16 11:39:21,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 365 transitions, 879 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:39:21,153 INFO L231 Difference]: Finished difference. Result has 366 places, 0 transitions, 0 flow [2022-11-16 11:39:21,153 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=416, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=366, PETRI_TRANSITIONS=0} [2022-11-16 11:39:21,154 INFO L288 CegarLoopForPetriNet]: 380 programPoint places, -14 predicate places. [2022-11-16 11:39:21,154 INFO L495 AbstractCegarLoop]: Abstraction has has 366 places, 0 transitions, 0 flow [2022-11-16 11:39:21,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.3333333333333) internal successors, (1198), 3 states have internal predecessors, (1198), 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) [2022-11-16 11:39:21,158 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (71 of 72 remaining) [2022-11-16 11:39:21,159 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 72 remaining) [2022-11-16 11:39:21,159 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (69 of 72 remaining) [2022-11-16 11:39:21,159 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (68 of 72 remaining) [2022-11-16 11:39:21,160 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (67 of 72 remaining) [2022-11-16 11:39:21,160 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (66 of 72 remaining) [2022-11-16 11:39:21,160 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (65 of 72 remaining) [2022-11-16 11:39:21,160 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (64 of 72 remaining) [2022-11-16 11:39:21,160 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 72 remaining) [2022-11-16 11:39:21,161 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (62 of 72 remaining) [2022-11-16 11:39:21,161 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (61 of 72 remaining) [2022-11-16 11:39:21,161 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (60 of 72 remaining) [2022-11-16 11:39:21,161 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (59 of 72 remaining) [2022-11-16 11:39:21,161 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (58 of 72 remaining) [2022-11-16 11:39:21,162 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (57 of 72 remaining) [2022-11-16 11:39:21,162 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (56 of 72 remaining) [2022-11-16 11:39:21,162 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (55 of 72 remaining) [2022-11-16 11:39:21,162 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (54 of 72 remaining) [2022-11-16 11:39:21,163 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (53 of 72 remaining) [2022-11-16 11:39:21,163 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (52 of 72 remaining) [2022-11-16 11:39:21,163 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (51 of 72 remaining) [2022-11-16 11:39:21,163 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (50 of 72 remaining) [2022-11-16 11:39:21,163 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (49 of 72 remaining) [2022-11-16 11:39:21,164 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (48 of 72 remaining) [2022-11-16 11:39:21,164 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (47 of 72 remaining) [2022-11-16 11:39:21,164 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (46 of 72 remaining) [2022-11-16 11:39:21,164 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (45 of 72 remaining) [2022-11-16 11:39:21,164 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 72 remaining) [2022-11-16 11:39:21,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 72 remaining) [2022-11-16 11:39:21,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 72 remaining) [2022-11-16 11:39:21,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 72 remaining) [2022-11-16 11:39:21,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 72 remaining) [2022-11-16 11:39:21,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (39 of 72 remaining) [2022-11-16 11:39:21,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (38 of 72 remaining) [2022-11-16 11:39:21,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 72 remaining) [2022-11-16 11:39:21,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (36 of 72 remaining) [2022-11-16 11:39:21,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (35 of 72 remaining) [2022-11-16 11:39:21,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (34 of 72 remaining) [2022-11-16 11:39:21,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (33 of 72 remaining) [2022-11-16 11:39:21,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (32 of 72 remaining) [2022-11-16 11:39:21,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (31 of 72 remaining) [2022-11-16 11:39:21,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (30 of 72 remaining) [2022-11-16 11:39:21,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 72 remaining) [2022-11-16 11:39:21,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 72 remaining) [2022-11-16 11:39:21,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 72 remaining) [2022-11-16 11:39:21,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 72 remaining) [2022-11-16 11:39:21,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 72 remaining) [2022-11-16 11:39:21,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 72 remaining) [2022-11-16 11:39:21,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 72 remaining) [2022-11-16 11:39:21,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 72 remaining) [2022-11-16 11:39:21,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (21 of 72 remaining) [2022-11-16 11:39:21,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 72 remaining) [2022-11-16 11:39:21,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 72 remaining) [2022-11-16 11:39:21,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 72 remaining) [2022-11-16 11:39:21,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 72 remaining) [2022-11-16 11:39:21,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 72 remaining) [2022-11-16 11:39:21,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 72 remaining) [2022-11-16 11:39:21,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 72 remaining) [2022-11-16 11:39:21,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 72 remaining) [2022-11-16 11:39:21,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 72 remaining) [2022-11-16 11:39:21,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 72 remaining) [2022-11-16 11:39:21,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 72 remaining) [2022-11-16 11:39:21,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 72 remaining) [2022-11-16 11:39:21,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 72 remaining) [2022-11-16 11:39:21,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 72 remaining) [2022-11-16 11:39:21,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 72 remaining) [2022-11-16 11:39:21,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 72 remaining) [2022-11-16 11:39:21,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 72 remaining) [2022-11-16 11:39:21,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 72 remaining) [2022-11-16 11:39:21,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 72 remaining) [2022-11-16 11:39:21,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 72 remaining) [2022-11-16 11:39:21,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 72 remaining) [2022-11-16 11:39:21,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-16 11:39:21,175 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:39:21,182 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:39:21,182 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:39:21,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:39:21 BasicIcfg [2022-11-16 11:39:21,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:39:21,190 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:39:21,190 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:39:21,190 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:39:21,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:38:54" (3/4) ... [2022-11-16 11:39:21,194 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 11:39:21,202 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-16 11:39:21,202 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-16 11:39:21,202 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-16 11:39:21,209 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-16 11:39:21,210 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-16 11:39:21,210 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-16 11:39:21,211 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 11:39:21,260 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:39:21,260 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:39:21,261 INFO L158 Benchmark]: Toolchain (without parser) took 28342.18ms. Allocated memory was 140.5MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 103.7MB in the beginning and 527.8MB in the end (delta: -424.0MB). Peak memory consumption was 728.5MB. Max. memory is 16.1GB. [2022-11-16 11:39:21,261 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 140.5MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:39:21,262 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.99ms. Allocated memory is still 140.5MB. Free memory was 103.5MB in the beginning and 113.5MB in the end (delta: -9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 11:39:21,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.45ms. Allocated memory is still 140.5MB. Free memory was 113.5MB in the beginning and 110.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:39:21,262 INFO L158 Benchmark]: Boogie Preprocessor took 44.14ms. Allocated memory is still 140.5MB. Free memory was 110.6MB in the beginning and 108.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:39:21,263 INFO L158 Benchmark]: RCFGBuilder took 1014.11ms. Allocated memory is still 140.5MB. Free memory was 108.5MB in the beginning and 80.8MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-16 11:39:21,263 INFO L158 Benchmark]: TraceAbstraction took 26673.26ms. Allocated memory was 140.5MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 80.1MB in the beginning and 532.0MB in the end (delta: -451.8MB). Peak memory consumption was 704.0MB. Max. memory is 16.1GB. [2022-11-16 11:39:21,263 INFO L158 Benchmark]: Witness Printer took 70.35ms. Allocated memory is still 1.3GB. Free memory was 532.0MB in the beginning and 527.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:39:21,265 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 140.5MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.99ms. Allocated memory is still 140.5MB. Free memory was 103.5MB in the beginning and 113.5MB in the end (delta: -9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.45ms. Allocated memory is still 140.5MB. Free memory was 113.5MB in the beginning and 110.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.14ms. Allocated memory is still 140.5MB. Free memory was 110.6MB in the beginning and 108.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1014.11ms. Allocated memory is still 140.5MB. Free memory was 108.5MB in the beginning and 80.8MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 26673.26ms. Allocated memory was 140.5MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 80.1MB in the beginning and 532.0MB in the end (delta: -451.8MB). Peak memory consumption was 704.0MB. Max. memory is 16.1GB. * Witness Printer took 70.35ms. Allocated memory is still 1.3GB. Free memory was 532.0MB in the beginning and 527.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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, 621 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: 26.4s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 655 IncrementalHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 230 mSDtfsCounter, 655 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=873occurred in iteration=23, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2687 NumberOfCodeBlocks, 2687 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2660 ConstructedInterpolants, 0 QuantifiedInterpolants, 2951 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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! [2022-11-16 11:39:21,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f23eeb12-2ba2-4071-b028-e9d3d726cd8d/bin/uautomizer-tPACEb0tL8/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