./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-more-sorted.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_60e369ec-ea14-430a-8304-8c1c9ffd8236/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60e369ec-ea14-430a-8304-8c1c9ffd8236/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_60e369ec-ea14-430a-8304-8c1c9ffd8236/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60e369ec-ea14-430a-8304-8c1c9ffd8236/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60e369ec-ea14-430a-8304-8c1c9ffd8236/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_60e369ec-ea14-430a-8304-8c1c9ffd8236/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 362fd638a164593c63fbfc307f633b7ac4c475762218e6a2237e90d5b6553a84 --- 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:39:44,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:39:44,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:39:44,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:39:44,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:39:44,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:39:44,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:39:44,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:39:44,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:39:44,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:39:44,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:39:44,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:39:44,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:39:44,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:39:44,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:39:44,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:39:44,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:39:44,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:39:44,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:39:44,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:39:44,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:39:44,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:39:44,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:39:44,392 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:39:44,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:39:44,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:39:44,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:39:44,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:39:44,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:39:44,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:39:44,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:39:44,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:39:44,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:39:44,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:39:44,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:39:44,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:39:44,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:39:44,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:39:44,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:39:44,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:39:44,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:39:44,424 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60e369ec-ea14-430a-8304-8c1c9ffd8236/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 11:39:44,479 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:39:44,479 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:39:44,480 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:39:44,480 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:39:44,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:39:44,482 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:39:44,483 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:39:44,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:39:44,484 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:39:44,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:39:44,486 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:39:44,487 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:39:44,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:39:44,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:39:44,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:39:44,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:39:44,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:39:44,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:39:44,489 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 11:39:44,489 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:39:44,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:39:44,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:39:44,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:39:44,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:39:44,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:39:44,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:39:44,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:39:44,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:39:44,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:39:44,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:39:44,493 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:39:44,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:39:44,494 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:39:44,495 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:39:44,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:39:44,495 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_60e369ec-ea14-430a-8304-8c1c9ffd8236/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_60e369ec-ea14-430a-8304-8c1c9ffd8236/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 -> 362fd638a164593c63fbfc307f633b7ac4c475762218e6a2237e90d5b6553a84 [2022-11-16 11:39:44,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:39:44,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:39:44,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:39:44,990 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:39:44,991 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:39:44,993 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60e369ec-ea14-430a-8304-8c1c9ffd8236/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2022-11-16 11:39:45,079 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60e369ec-ea14-430a-8304-8c1c9ffd8236/bin/uautomizer-tPACEb0tL8/data/d9b00688c/11c7311f0c094431b133ac6a024e8021/FLAGaeca3da6f [2022-11-16 11:39:45,709 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:39:45,710 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60e369ec-ea14-430a-8304-8c1c9ffd8236/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2022-11-16 11:39:45,737 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60e369ec-ea14-430a-8304-8c1c9ffd8236/bin/uautomizer-tPACEb0tL8/data/d9b00688c/11c7311f0c094431b133ac6a024e8021/FLAGaeca3da6f [2022-11-16 11:39:46,036 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60e369ec-ea14-430a-8304-8c1c9ffd8236/bin/uautomizer-tPACEb0tL8/data/d9b00688c/11c7311f0c094431b133ac6a024e8021 [2022-11-16 11:39:46,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:39:46,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:39:46,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:39:46,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:39:46,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:39:46,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:39:46" (1/1) ... [2022-11-16 11:39:46,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dfba2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:46, skipping insertion in model container [2022-11-16 11:39:46,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:39:46" (1/1) ... [2022-11-16 11:39:46,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:39:46,100 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:39:46,533 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_60e369ec-ea14-430a-8304-8c1c9ffd8236/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c[2434,2447] [2022-11-16 11:39:46,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:39:46,567 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:39:46,614 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_60e369ec-ea14-430a-8304-8c1c9ffd8236/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c[2434,2447] [2022-11-16 11:39:46,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:39:46,641 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:39:46,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:46 WrapperNode [2022-11-16 11:39:46,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:39:46,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:39:46,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:39:46,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:39:46,650 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:39:46" (1/1) ... [2022-11-16 11:39:46,664 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:39:46" (1/1) ... [2022-11-16 11:39:46,698 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 173 [2022-11-16 11:39:46,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:39:46,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:39:46,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:39:46,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:39:46,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:46" (1/1) ... [2022-11-16 11:39:46,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:46" (1/1) ... [2022-11-16 11:39:46,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:46" (1/1) ... [2022-11-16 11:39:46,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:46" (1/1) ... [2022-11-16 11:39:46,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:46" (1/1) ... [2022-11-16 11:39:46,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:46" (1/1) ... [2022-11-16 11:39:46,750 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:46" (1/1) ... [2022-11-16 11:39:46,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:46" (1/1) ... [2022-11-16 11:39:46,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:39:46,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:39:46,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:39:46,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:39:46,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:46" (1/1) ... [2022-11-16 11:39:46,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:39:46,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60e369ec-ea14-430a-8304-8c1c9ffd8236/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:39:46,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60e369ec-ea14-430a-8304-8c1c9ffd8236/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:39:46,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60e369ec-ea14-430a-8304-8c1c9ffd8236/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:39:46,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:39:46,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 11:39:46,899 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 11:39:46,899 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 11:39:46,899 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 11:39:46,901 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 11:39:46,901 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 11:39:46,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:39:46,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:39:46,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:39:46,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:39:46,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:39:46,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:39:46,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:39:46,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:39:46,905 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:39:47,096 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:39:47,099 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:39:47,939 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:39:47,955 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:39:47,955 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 11:39:47,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:39:47 BoogieIcfgContainer [2022-11-16 11:39:47,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:39:47,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:39:47,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:39:47,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:39:47,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:39:46" (1/3) ... [2022-11-16 11:39:47,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3773eabd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:39:47, skipping insertion in model container [2022-11-16 11:39:47,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:39:46" (2/3) ... [2022-11-16 11:39:47,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3773eabd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:39:47, skipping insertion in model container [2022-11-16 11:39:47,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:39:47" (3/3) ... [2022-11-16 11:39:47,971 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2022-11-16 11:39:47,983 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:39:47,997 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:39:47,997 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-16 11:39:47,998 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:39:48,134 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 11:39:48,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 353 places, 360 transitions, 744 flow [2022-11-16 11:39:48,413 INFO L130 PetriNetUnfolder]: 17/357 cut-off events. [2022-11-16 11:39:48,414 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 11:39:48,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 357 events. 17/357 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 716 event pairs, 0 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 247. Up to 2 conditions per place. [2022-11-16 11:39:48,431 INFO L82 GeneralOperation]: Start removeDead. Operand has 353 places, 360 transitions, 744 flow [2022-11-16 11:39:48,451 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 329 places, 334 transitions, 686 flow [2022-11-16 11:39:48,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:39:48,491 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;@1d133eaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:39:48,491 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-11-16 11:39:48,507 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-11-16 11:39:48,507 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:39:48,508 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:48,509 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] [2022-11-16 11:39:48,510 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:39:48,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:48,519 INFO L85 PathProgramCache]: Analyzing trace with hash -2098974523, now seen corresponding path program 1 times [2022-11-16 11:39:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:48,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243824861] [2022-11-16 11:39:48,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:48,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:48,834 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:48,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:48,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243824861] [2022-11-16 11:39:48,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243824861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:48,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:48,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:48,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554384724] [2022-11-16 11:39:48,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:48,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:48,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:48,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:48,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:48,903 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 360 [2022-11-16 11:39:48,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 334 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:48,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:48,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 360 [2022-11-16 11:39:48,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:49,340 INFO L130 PetriNetUnfolder]: 73/865 cut-off events. [2022-11-16 11:39:49,341 INFO L131 PetriNetUnfolder]: For 81/93 co-relation queries the response was YES. [2022-11-16 11:39:49,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 865 events. 73/865 cut-off events. For 81/93 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4698 event pairs, 39 based on Foata normal form. 34/720 useless extension candidates. Maximal degree in co-relation 760. Up to 99 conditions per place. [2022-11-16 11:39:49,362 INFO L137 encePairwiseOnDemand]: 350/360 looper letters, 21 selfloop transitions, 2 changer transitions 3/326 dead transitions. [2022-11-16 11:39:49,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 326 transitions, 716 flow [2022-11-16 11:39:49,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2022-11-16 11:39:49,395 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.937037037037037 [2022-11-16 11:39:49,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1012 transitions. [2022-11-16 11:39:49,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1012 transitions. [2022-11-16 11:39:49,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:49,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1012 transitions. [2022-11-16 11:39:49,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 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:49,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:49,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:49,433 INFO L175 Difference]: Start difference. First operand has 329 places, 334 transitions, 686 flow. Second operand 3 states and 1012 transitions. [2022-11-16 11:39:49,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 326 transitions, 716 flow [2022-11-16 11:39:49,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 326 transitions, 704 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-16 11:39:49,455 INFO L231 Difference]: Finished difference. Result has 324 places, 323 transitions, 656 flow [2022-11-16 11:39:49,458 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=324, PETRI_TRANSITIONS=323} [2022-11-16 11:39:49,465 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -5 predicate places. [2022-11-16 11:39:49,466 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 323 transitions, 656 flow [2022-11-16 11:39:49,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:49,467 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:49,468 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] [2022-11-16 11:39:49,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:39:49,470 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:39:49,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:49,471 INFO L85 PathProgramCache]: Analyzing trace with hash -356466636, now seen corresponding path program 1 times [2022-11-16 11:39:49,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:49,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405796828] [2022-11-16 11:39:49,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:49,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:49,592 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:49,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:49,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405796828] [2022-11-16 11:39:49,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405796828] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:49,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:49,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:49,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560733021] [2022-11-16 11:39:49,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:49,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:49,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:49,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:49,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:49,599 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 360 [2022-11-16 11:39:49,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 323 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:49,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:49,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 360 [2022-11-16 11:39:49,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:49,886 INFO L130 PetriNetUnfolder]: 47/734 cut-off events. [2022-11-16 11:39:49,886 INFO L131 PetriNetUnfolder]: For 9/26 co-relation queries the response was YES. [2022-11-16 11:39:49,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 734 events. 47/734 cut-off events. For 9/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3634 event pairs, 21 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 789. Up to 74 conditions per place. [2022-11-16 11:39:49,903 INFO L137 encePairwiseOnDemand]: 357/360 looper letters, 21 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2022-11-16 11:39:49,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 322 transitions, 700 flow [2022-11-16 11:39:49,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:49,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2022-11-16 11:39:49,908 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9305555555555556 [2022-11-16 11:39:49,908 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1005 transitions. [2022-11-16 11:39:49,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1005 transitions. [2022-11-16 11:39:49,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:49,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1005 transitions. [2022-11-16 11:39:49,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 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:49,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:49,919 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:49,919 INFO L175 Difference]: Start difference. First operand has 324 places, 323 transitions, 656 flow. Second operand 3 states and 1005 transitions. [2022-11-16 11:39:49,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 322 transitions, 700 flow [2022-11-16 11:39:49,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 322 transitions, 696 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:39:49,931 INFO L231 Difference]: Finished difference. Result has 320 places, 322 transitions, 654 flow [2022-11-16 11:39:49,932 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=320, PETRI_TRANSITIONS=322} [2022-11-16 11:39:49,933 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -9 predicate places. [2022-11-16 11:39:49,933 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 322 transitions, 654 flow [2022-11-16 11:39:49,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 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:49,935 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:49,935 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] [2022-11-16 11:39:49,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:39:49,936 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:39:49,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash 548459483, now seen corresponding path program 1 times [2022-11-16 11:39:49,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:49,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101548547] [2022-11-16 11:39:49,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:49,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:50,006 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:50,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:50,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101548547] [2022-11-16 11:39:50,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101548547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:50,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:50,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:50,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016626543] [2022-11-16 11:39:50,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:50,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:50,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:50,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:50,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:50,017 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 360 [2022-11-16 11:39:50,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 322 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:50,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:50,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 360 [2022-11-16 11:39:50,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:50,226 INFO L130 PetriNetUnfolder]: 35/667 cut-off events. [2022-11-16 11:39:50,226 INFO L131 PetriNetUnfolder]: For 8/17 co-relation queries the response was YES. [2022-11-16 11:39:50,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 667 events. 35/667 cut-off events. For 8/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3079 event pairs, 12 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 685. Up to 46 conditions per place. [2022-11-16 11:39:50,239 INFO L137 encePairwiseOnDemand]: 355/360 looper letters, 15 selfloop transitions, 1 changer transitions 0/318 dead transitions. [2022-11-16 11:39:50,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 318 transitions, 678 flow [2022-11-16 11:39:50,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:50,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2022-11-16 11:39:50,243 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9351851851851852 [2022-11-16 11:39:50,244 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1010 transitions. [2022-11-16 11:39:50,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1010 transitions. [2022-11-16 11:39:50,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:50,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1010 transitions. [2022-11-16 11:39:50,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.6666666666667) internal successors, (1010), 3 states have internal predecessors, (1010), 0 states have call successors, (0), 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:50,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:50,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:50,253 INFO L175 Difference]: Start difference. First operand has 320 places, 322 transitions, 654 flow. Second operand 3 states and 1010 transitions. [2022-11-16 11:39:50,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 318 transitions, 678 flow [2022-11-16 11:39:50,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 318 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:39:50,261 INFO L231 Difference]: Finished difference. Result has 316 places, 318 transitions, 644 flow [2022-11-16 11:39:50,262 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=316, PETRI_TRANSITIONS=318} [2022-11-16 11:39:50,263 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -13 predicate places. [2022-11-16 11:39:50,263 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 318 transitions, 644 flow [2022-11-16 11:39:50,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:39:50,265 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:50,265 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] [2022-11-16 11:39:50,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:39:50,266 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:39:50,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:50,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2034579958, now seen corresponding path program 1 times [2022-11-16 11:39:50,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:50,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139837370] [2022-11-16 11:39:50,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:50,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:50,455 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:50,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:50,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139837370] [2022-11-16 11:39:50,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139837370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:50,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:50,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:39:50,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925952776] [2022-11-16 11:39:50,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:50,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:39:50,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:50,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:39:50,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:39:50,460 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 360 [2022-11-16 11:39:50,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 318 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 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:50,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:50,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 360 [2022-11-16 11:39:50,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:39:51,926 INFO L130 PetriNetUnfolder]: 1052/5356 cut-off events. [2022-11-16 11:39:51,926 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-11-16 11:39:51,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6822 conditions, 5356 events. 1052/5356 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 52219 event pairs, 720 based on Foata normal form. 0/4187 useless extension candidates. Maximal degree in co-relation 6781. Up to 1404 conditions per place. [2022-11-16 11:39:52,032 INFO L137 encePairwiseOnDemand]: 357/360 looper letters, 27 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2022-11-16 11:39:52,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 317 transitions, 700 flow [2022-11-16 11:39:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:39:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:39:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 993 transitions. [2022-11-16 11:39:52,036 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9194444444444444 [2022-11-16 11:39:52,037 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 993 transitions. [2022-11-16 11:39:52,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 993 transitions. [2022-11-16 11:39:52,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:39:52,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 993 transitions. [2022-11-16 11:39:52,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 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:52,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:52,052 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:52,052 INFO L175 Difference]: Start difference. First operand has 316 places, 318 transitions, 644 flow. Second operand 3 states and 993 transitions. [2022-11-16 11:39:52,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 317 transitions, 700 flow [2022-11-16 11:39:52,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 317 transitions, 699 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:39:52,061 INFO L231 Difference]: Finished difference. Result has 316 places, 317 transitions, 645 flow [2022-11-16 11:39:52,068 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=645, PETRI_PLACES=316, PETRI_TRANSITIONS=317} [2022-11-16 11:39:52,071 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -13 predicate places. [2022-11-16 11:39:52,071 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 317 transitions, 645 flow [2022-11-16 11:39:52,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 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:52,073 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:39:52,073 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] [2022-11-16 11:39:52,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:39:52,074 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:39:52,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:39:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1729075805, now seen corresponding path program 1 times [2022-11-16 11:39:52,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:39:52,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359555896] [2022-11-16 11:39:52,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:39:52,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:39:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:39:52,947 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:52,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:39:52,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359555896] [2022-11-16 11:39:52,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359555896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:39:52,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:39:52,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:39:52,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339379727] [2022-11-16 11:39:52,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:39:52,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:39:52,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:39:52,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:39:52,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:39:52,957 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 360 [2022-11-16 11:39:52,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 317 transitions, 645 flow. Second operand has 6 states, 6 states have (on average 275.8333333333333) internal successors, (1655), 6 states have internal predecessors, (1655), 0 states have call successors, (0), 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:52,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:39:52,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 360 [2022-11-16 11:39:52,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:15,890 INFO L130 PetriNetUnfolder]: 48809/124317 cut-off events. [2022-11-16 11:40:15,891 INFO L131 PetriNetUnfolder]: For 349/581 co-relation queries the response was YES. [2022-11-16 11:40:16,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188283 conditions, 124317 events. 48809/124317 cut-off events. For 349/581 co-relation queries the response was YES. Maximal size of possible extension queue 3053. Compared 1640033 event pairs, 42984 based on Foata normal form. 0/100417 useless extension candidates. Maximal degree in co-relation 188243. Up to 63773 conditions per place. [2022-11-16 11:40:17,435 INFO L137 encePairwiseOnDemand]: 354/360 looper letters, 71 selfloop transitions, 5 changer transitions 0/316 dead transitions. [2022-11-16 11:40:17,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 316 transitions, 795 flow [2022-11-16 11:40:17,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:40:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:40:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1721 transitions. [2022-11-16 11:40:17,441 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7967592592592593 [2022-11-16 11:40:17,441 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1721 transitions. [2022-11-16 11:40:17,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1721 transitions. [2022-11-16 11:40:17,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:17,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1721 transitions. [2022-11-16 11:40:17,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 286.8333333333333) internal successors, (1721), 6 states have internal predecessors, (1721), 0 states have call successors, (0), 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:40:17,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 360.0) internal successors, (2520), 7 states have internal predecessors, (2520), 0 states have call successors, (0), 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:40:17,456 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 360.0) internal successors, (2520), 7 states have internal predecessors, (2520), 0 states have call successors, (0), 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:40:17,456 INFO L175 Difference]: Start difference. First operand has 316 places, 317 transitions, 645 flow. Second operand 6 states and 1721 transitions. [2022-11-16 11:40:17,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 316 transitions, 795 flow [2022-11-16 11:40:17,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 316 transitions, 791 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:40:17,467 INFO L231 Difference]: Finished difference. Result has 318 places, 316 transitions, 649 flow [2022-11-16 11:40:17,468 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=649, PETRI_PLACES=318, PETRI_TRANSITIONS=316} [2022-11-16 11:40:17,472 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -11 predicate places. [2022-11-16 11:40:17,472 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 316 transitions, 649 flow [2022-11-16 11:40:17,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.8333333333333) internal successors, (1655), 6 states have internal predecessors, (1655), 0 states have call successors, (0), 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:40:17,474 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:17,475 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] [2022-11-16 11:40:17,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:40:17,476 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:40:17,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:17,477 INFO L85 PathProgramCache]: Analyzing trace with hash 40576903, now seen corresponding path program 1 times [2022-11-16 11:40:17,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:17,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75309042] [2022-11-16 11:40:17,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:17,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:17,569 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:40:17,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:17,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75309042] [2022-11-16 11:40:17,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75309042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:17,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:17,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:40:17,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021297714] [2022-11-16 11:40:17,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:17,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:40:17,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:17,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:40:17,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:40:17,578 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 360 [2022-11-16 11:40:17,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 316 transitions, 649 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:17,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:17,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 360 [2022-11-16 11:40:17,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:17,706 INFO L130 PetriNetUnfolder]: 25/420 cut-off events. [2022-11-16 11:40:17,706 INFO L131 PetriNetUnfolder]: For 4/7 co-relation queries the response was YES. [2022-11-16 11:40:17,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 420 events. 25/420 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1495 event pairs, 12 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 473. Up to 46 conditions per place. [2022-11-16 11:40:17,717 INFO L137 encePairwiseOnDemand]: 357/360 looper letters, 18 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2022-11-16 11:40:17,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 315 transitions, 687 flow [2022-11-16 11:40:17,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:40:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:40:17,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2022-11-16 11:40:17,721 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9361111111111111 [2022-11-16 11:40:17,721 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1011 transitions. [2022-11-16 11:40:17,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1011 transitions. [2022-11-16 11:40:17,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:17,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1011 transitions. [2022-11-16 11:40:17,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 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:40:17,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:17,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:17,729 INFO L175 Difference]: Start difference. First operand has 318 places, 316 transitions, 649 flow. Second operand 3 states and 1011 transitions. [2022-11-16 11:40:17,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 315 transitions, 687 flow [2022-11-16 11:40:17,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 315 transitions, 677 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 11:40:17,743 INFO L231 Difference]: Finished difference. Result has 314 places, 315 transitions, 641 flow [2022-11-16 11:40:17,744 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=641, PETRI_PLACES=314, PETRI_TRANSITIONS=315} [2022-11-16 11:40:17,747 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -15 predicate places. [2022-11-16 11:40:17,747 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 315 transitions, 641 flow [2022-11-16 11:40:17,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:17,748 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:17,748 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] [2022-11-16 11:40:17,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:40:17,752 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:40:17,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:17,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1570204824, now seen corresponding path program 1 times [2022-11-16 11:40:17,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:17,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699739589] [2022-11-16 11:40:17,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:17,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:17,825 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:40:17,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:17,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699739589] [2022-11-16 11:40:17,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699739589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:17,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:17,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:40:17,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489233890] [2022-11-16 11:40:17,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:17,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:40:17,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:17,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:40:17,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:40:17,834 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 360 [2022-11-16 11:40:17,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 315 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:17,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:17,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 360 [2022-11-16 11:40:17,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:18,239 INFO L130 PetriNetUnfolder]: 25/421 cut-off events. [2022-11-16 11:40:18,240 INFO L131 PetriNetUnfolder]: For 10/13 co-relation queries the response was YES. [2022-11-16 11:40:18,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 421 events. 25/421 cut-off events. For 10/13 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1412 event pairs, 12 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 442. Up to 46 conditions per place. [2022-11-16 11:40:18,256 INFO L137 encePairwiseOnDemand]: 357/360 looper letters, 18 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2022-11-16 11:40:18,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 314 transitions, 679 flow [2022-11-16 11:40:18,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:40:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:40:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1011 transitions. [2022-11-16 11:40:18,261 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9361111111111111 [2022-11-16 11:40:18,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1011 transitions. [2022-11-16 11:40:18,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1011 transitions. [2022-11-16 11:40:18,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:18,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1011 transitions. [2022-11-16 11:40:18,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 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:40:18,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:18,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:18,271 INFO L175 Difference]: Start difference. First operand has 314 places, 315 transitions, 641 flow. Second operand 3 states and 1011 transitions. [2022-11-16 11:40:18,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 314 transitions, 679 flow [2022-11-16 11:40:18,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 314 transitions, 675 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:40:18,281 INFO L231 Difference]: Finished difference. Result has 313 places, 314 transitions, 639 flow [2022-11-16 11:40:18,282 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=313, PETRI_TRANSITIONS=314} [2022-11-16 11:40:18,285 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -16 predicate places. [2022-11-16 11:40:18,286 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 314 transitions, 639 flow [2022-11-16 11:40:18,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:18,287 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:18,287 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:40:18,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:40:18,288 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:40:18,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:18,288 INFO L85 PathProgramCache]: Analyzing trace with hash -191270784, now seen corresponding path program 1 times [2022-11-16 11:40:18,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:18,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800498729] [2022-11-16 11:40:18,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:18,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:18,353 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:40:18,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:18,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800498729] [2022-11-16 11:40:18,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800498729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:18,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:18,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:40:18,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710352971] [2022-11-16 11:40:18,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:18,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:40:18,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:18,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:40:18,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:40:18,359 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 360 [2022-11-16 11:40:18,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 314 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:18,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:18,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 360 [2022-11-16 11:40:18,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:18,486 INFO L130 PetriNetUnfolder]: 25/418 cut-off events. [2022-11-16 11:40:18,487 INFO L131 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2022-11-16 11:40:18,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 418 events. 25/418 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1387 event pairs, 12 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 432. Up to 45 conditions per place. [2022-11-16 11:40:18,493 INFO L137 encePairwiseOnDemand]: 357/360 looper letters, 17 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2022-11-16 11:40:18,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 313 transitions, 675 flow [2022-11-16 11:40:18,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:40:18,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:40:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2022-11-16 11:40:18,498 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9351851851851852 [2022-11-16 11:40:18,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1010 transitions. [2022-11-16 11:40:18,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1010 transitions. [2022-11-16 11:40:18,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:18,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1010 transitions. [2022-11-16 11:40:18,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.6666666666667) internal successors, (1010), 3 states have internal predecessors, (1010), 0 states have call successors, (0), 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:40:18,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:18,508 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:18,509 INFO L175 Difference]: Start difference. First operand has 313 places, 314 transitions, 639 flow. Second operand 3 states and 1010 transitions. [2022-11-16 11:40:18,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 313 transitions, 675 flow [2022-11-16 11:40:18,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 313 transitions, 671 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:40:18,518 INFO L231 Difference]: Finished difference. Result has 312 places, 313 transitions, 637 flow [2022-11-16 11:40:18,519 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=637, PETRI_PLACES=312, PETRI_TRANSITIONS=313} [2022-11-16 11:40:18,520 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -17 predicate places. [2022-11-16 11:40:18,520 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 313 transitions, 637 flow [2022-11-16 11:40:18,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:18,521 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:18,522 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] [2022-11-16 11:40:18,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:40:18,522 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:40:18,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:18,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1274213160, now seen corresponding path program 1 times [2022-11-16 11:40:18,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:18,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015670197] [2022-11-16 11:40:18,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:18,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:18,578 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:40:18,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:18,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015670197] [2022-11-16 11:40:18,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015670197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:18,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:18,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:40:18,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545489019] [2022-11-16 11:40:18,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:18,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:40:18,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:18,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:40:18,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:40:18,585 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 360 [2022-11-16 11:40:18,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 313 transitions, 637 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:18,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:18,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 360 [2022-11-16 11:40:18,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:18,775 INFO L130 PetriNetUnfolder]: 48/713 cut-off events. [2022-11-16 11:40:18,775 INFO L131 PetriNetUnfolder]: For 13/19 co-relation queries the response was YES. [2022-11-16 11:40:18,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 713 events. 48/713 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3461 event pairs, 20 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 740. Up to 56 conditions per place. [2022-11-16 11:40:18,786 INFO L137 encePairwiseOnDemand]: 355/360 looper letters, 15 selfloop transitions, 1 changer transitions 0/309 dead transitions. [2022-11-16 11:40:18,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 309 transitions, 661 flow [2022-11-16 11:40:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:40:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:40:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1010 transitions. [2022-11-16 11:40:18,791 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9351851851851852 [2022-11-16 11:40:18,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1010 transitions. [2022-11-16 11:40:18,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1010 transitions. [2022-11-16 11:40:18,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:18,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1010 transitions. [2022-11-16 11:40:18,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.6666666666667) internal successors, (1010), 3 states have internal predecessors, (1010), 0 states have call successors, (0), 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:40:18,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:18,802 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:18,802 INFO L175 Difference]: Start difference. First operand has 312 places, 313 transitions, 637 flow. Second operand 3 states and 1010 transitions. [2022-11-16 11:40:18,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 309 transitions, 661 flow [2022-11-16 11:40:18,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 309 transitions, 657 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:40:18,812 INFO L231 Difference]: Finished difference. Result has 308 places, 309 transitions, 627 flow [2022-11-16 11:40:18,813 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=308, PETRI_TRANSITIONS=309} [2022-11-16 11:40:18,813 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -21 predicate places. [2022-11-16 11:40:18,814 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 309 transitions, 627 flow [2022-11-16 11:40:18,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:18,815 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:18,815 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:40:18,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:40:18,816 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:40:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:18,817 INFO L85 PathProgramCache]: Analyzing trace with hash 319767329, now seen corresponding path program 1 times [2022-11-16 11:40:18,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:18,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427849634] [2022-11-16 11:40:18,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:18,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:18,881 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:40:18,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:18,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427849634] [2022-11-16 11:40:18,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427849634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:18,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:18,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:40:18,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229297481] [2022-11-16 11:40:18,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:18,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:40:18,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:18,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:40:18,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:40:18,887 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 360 [2022-11-16 11:40:18,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 309 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:18,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:18,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 360 [2022-11-16 11:40:18,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:19,006 INFO L130 PetriNetUnfolder]: 23/408 cut-off events. [2022-11-16 11:40:19,007 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-11-16 11:40:19,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 408 events. 23/408 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1433 event pairs, 6 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 424. Up to 25 conditions per place. [2022-11-16 11:40:19,013 INFO L137 encePairwiseOnDemand]: 355/360 looper letters, 14 selfloop transitions, 3 changer transitions 0/309 dead transitions. [2022-11-16 11:40:19,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 309 transitions, 663 flow [2022-11-16 11:40:19,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:40:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:40:19,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2022-11-16 11:40:19,017 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9425925925925925 [2022-11-16 11:40:19,018 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1018 transitions. [2022-11-16 11:40:19,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1018 transitions. [2022-11-16 11:40:19,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:19,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1018 transitions. [2022-11-16 11:40:19,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 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:40:19,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:19,027 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:19,028 INFO L175 Difference]: Start difference. First operand has 308 places, 309 transitions, 627 flow. Second operand 3 states and 1018 transitions. [2022-11-16 11:40:19,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 309 transitions, 663 flow [2022-11-16 11:40:19,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 309 transitions, 662 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:40:19,037 INFO L231 Difference]: Finished difference. Result has 307 places, 307 transitions, 628 flow [2022-11-16 11:40:19,038 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=307, PETRI_TRANSITIONS=307} [2022-11-16 11:40:19,039 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -22 predicate places. [2022-11-16 11:40:19,039 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 307 transitions, 628 flow [2022-11-16 11:40:19,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.6666666666667) internal successors, (1004), 3 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:19,040 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:19,040 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:40:19,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:40:19,041 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:40:19,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:19,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1492310395, now seen corresponding path program 1 times [2022-11-16 11:40:19,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:19,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646086011] [2022-11-16 11:40:19,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:19,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:19,103 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:40:19,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:19,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646086011] [2022-11-16 11:40:19,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646086011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:19,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:19,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:40:19,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261943667] [2022-11-16 11:40:19,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:19,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:40:19,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:19,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:40:19,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:40:19,109 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 360 [2022-11-16 11:40:19,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 307 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 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:40:19,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:19,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 360 [2022-11-16 11:40:19,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:19,779 INFO L130 PetriNetUnfolder]: 460/3136 cut-off events. [2022-11-16 11:40:19,779 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-11-16 11:40:19,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3787 conditions, 3136 events. 460/3136 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 27801 event pairs, 172 based on Foata normal form. 0/2702 useless extension candidates. Maximal degree in co-relation 3747. Up to 577 conditions per place. [2022-11-16 11:40:19,816 INFO L137 encePairwiseOnDemand]: 351/360 looper letters, 25 selfloop transitions, 3 changer transitions 0/309 dead transitions. [2022-11-16 11:40:19,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 309 transitions, 693 flow [2022-11-16 11:40:19,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:40:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:40:19,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1006 transitions. [2022-11-16 11:40:19,821 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9314814814814815 [2022-11-16 11:40:19,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1006 transitions. [2022-11-16 11:40:19,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1006 transitions. [2022-11-16 11:40:19,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:19,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1006 transitions. [2022-11-16 11:40:19,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 335.3333333333333) internal successors, (1006), 3 states have internal predecessors, (1006), 0 states have call successors, (0), 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:40:19,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:19,832 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:19,832 INFO L175 Difference]: Start difference. First operand has 307 places, 307 transitions, 628 flow. Second operand 3 states and 1006 transitions. [2022-11-16 11:40:19,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 309 transitions, 693 flow [2022-11-16 11:40:19,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 309 transitions, 687 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:40:19,842 INFO L231 Difference]: Finished difference. Result has 302 places, 304 transitions, 631 flow [2022-11-16 11:40:19,843 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=302, PETRI_TRANSITIONS=304} [2022-11-16 11:40:19,844 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -27 predicate places. [2022-11-16 11:40:19,844 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 304 transitions, 631 flow [2022-11-16 11:40:19,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 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:40:19,846 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:19,846 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:40:19,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:40:19,847 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:40:19,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:19,848 INFO L85 PathProgramCache]: Analyzing trace with hash 409768425, now seen corresponding path program 1 times [2022-11-16 11:40:19,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:19,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883074707] [2022-11-16 11:40:19,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:19,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:19,925 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:40:19,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:19,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883074707] [2022-11-16 11:40:19,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883074707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:19,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:19,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:40:19,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099861868] [2022-11-16 11:40:19,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:19,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:40:19,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:19,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:40:19,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:40:19,930 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 360 [2022-11-16 11:40:19,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 304 transitions, 631 flow. Second operand has 3 states, 3 states have (on average 333.6666666666667) internal successors, (1001), 3 states have internal predecessors, (1001), 0 states have call successors, (0), 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:40:19,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:19,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 360 [2022-11-16 11:40:19,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:20,201 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([944] thread3EXIT-->L89-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem34#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][294], [Black: 399#true, 404#true, 366#(= |#race~N~0| 0), 393#(= |#race~M~0| 0), 401#(= |#race~A~0| 0), 311#L89-7true]) [2022-11-16 11:40:20,202 INFO L383 tUnfolder$Statistics]: this new event has 260 ancestors and is cut-off event [2022-11-16 11:40:20,202 INFO L386 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-11-16 11:40:20,202 INFO L386 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-11-16 11:40:20,202 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-16 11:40:20,203 INFO L130 PetriNetUnfolder]: 69/803 cut-off events. [2022-11-16 11:40:20,203 INFO L131 PetriNetUnfolder]: For 13/44 co-relation queries the response was YES. [2022-11-16 11:40:20,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 803 events. 69/803 cut-off events. For 13/44 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3938 event pairs, 17 based on Foata normal form. 3/717 useless extension candidates. Maximal degree in co-relation 916. Up to 65 conditions per place. [2022-11-16 11:40:20,221 INFO L137 encePairwiseOnDemand]: 357/360 looper letters, 16 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2022-11-16 11:40:20,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 305 transitions, 671 flow [2022-11-16 11:40:20,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:40:20,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:40:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2022-11-16 11:40:20,226 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.937037037037037 [2022-11-16 11:40:20,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1012 transitions. [2022-11-16 11:40:20,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1012 transitions. [2022-11-16 11:40:20,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:20,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1012 transitions. [2022-11-16 11:40:20,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 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:40:20,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:20,235 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:20,235 INFO L175 Difference]: Start difference. First operand has 302 places, 304 transitions, 631 flow. Second operand 3 states and 1012 transitions. [2022-11-16 11:40:20,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 305 transitions, 671 flow [2022-11-16 11:40:20,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 305 transitions, 671 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:40:20,244 INFO L231 Difference]: Finished difference. Result has 303 places, 303 transitions, 633 flow [2022-11-16 11:40:20,245 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=303, PETRI_TRANSITIONS=303} [2022-11-16 11:40:20,246 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -26 predicate places. [2022-11-16 11:40:20,246 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 303 transitions, 633 flow [2022-11-16 11:40:20,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.6666666666667) internal successors, (1001), 3 states have internal predecessors, (1001), 0 states have call successors, (0), 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:40:20,247 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:20,248 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:40:20,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:40:20,248 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:40:20,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:20,249 INFO L85 PathProgramCache]: Analyzing trace with hash -274126058, now seen corresponding path program 1 times [2022-11-16 11:40:20,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:20,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033575720] [2022-11-16 11:40:20,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:20,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:20,313 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:40:20,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:20,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033575720] [2022-11-16 11:40:20,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033575720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:20,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:20,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:40:20,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920608498] [2022-11-16 11:40:20,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:20,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:40:20,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:20,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:40:20,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:40:20,318 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 360 [2022-11-16 11:40:20,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 303 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 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:40:20,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:20,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 360 [2022-11-16 11:40:20,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:20,621 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([944] thread3EXIT-->L89-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem34#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][293], [408#true, Black: 399#true, 404#true, 366#(= |#race~N~0| 0), 393#(= |#race~M~0| 0), 311#L89-7true, 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:20,621 INFO L383 tUnfolder$Statistics]: this new event has 260 ancestors and is cut-off event [2022-11-16 11:40:20,621 INFO L386 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-11-16 11:40:20,622 INFO L386 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-11-16 11:40:20,622 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-16 11:40:20,622 INFO L130 PetriNetUnfolder]: 90/897 cut-off events. [2022-11-16 11:40:20,623 INFO L131 PetriNetUnfolder]: For 37/60 co-relation queries the response was YES. [2022-11-16 11:40:20,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 897 events. 90/897 cut-off events. For 37/60 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4806 event pairs, 18 based on Foata normal form. 3/800 useless extension candidates. Maximal degree in co-relation 1040. Up to 72 conditions per place. [2022-11-16 11:40:20,644 INFO L137 encePairwiseOnDemand]: 355/360 looper letters, 14 selfloop transitions, 3 changer transitions 0/303 dead transitions. [2022-11-16 11:40:20,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 303 transitions, 669 flow [2022-11-16 11:40:20,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:40:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:40:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2022-11-16 11:40:20,649 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9425925925925925 [2022-11-16 11:40:20,649 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1018 transitions. [2022-11-16 11:40:20,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1018 transitions. [2022-11-16 11:40:20,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:20,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1018 transitions. [2022-11-16 11:40:20,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 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:40:20,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:20,658 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:20,658 INFO L175 Difference]: Start difference. First operand has 303 places, 303 transitions, 633 flow. Second operand 3 states and 1018 transitions. [2022-11-16 11:40:20,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 303 transitions, 669 flow [2022-11-16 11:40:20,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 303 transitions, 665 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:40:20,667 INFO L231 Difference]: Finished difference. Result has 301 places, 301 transitions, 631 flow [2022-11-16 11:40:20,668 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=631, PETRI_PLACES=301, PETRI_TRANSITIONS=301} [2022-11-16 11:40:20,669 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -28 predicate places. [2022-11-16 11:40:20,669 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 301 transitions, 631 flow [2022-11-16 11:40:20,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 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:40:20,670 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:20,670 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] [2022-11-16 11:40:20,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:40:20,671 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:40:20,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash -650178132, now seen corresponding path program 1 times [2022-11-16 11:40:20,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:20,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324163067] [2022-11-16 11:40:20,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:20,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:20,950 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:40:20,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:20,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324163067] [2022-11-16 11:40:20,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324163067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:20,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:20,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:40:20,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572632365] [2022-11-16 11:40:20,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:20,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:40:20,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:20,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:40:20,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:40:20,958 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 360 [2022-11-16 11:40:20,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 301 transitions, 631 flow. Second operand has 7 states, 7 states have (on average 305.7142857142857) internal successors, (2140), 7 states have internal predecessors, (2140), 0 states have call successors, (0), 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:40:20,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:20,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 360 [2022-11-16 11:40:20,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:21,723 INFO L130 PetriNetUnfolder]: 368/1814 cut-off events. [2022-11-16 11:40:21,723 INFO L131 PetriNetUnfolder]: For 42/313 co-relation queries the response was YES. [2022-11-16 11:40:21,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2560 conditions, 1814 events. 368/1814 cut-off events. For 42/313 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 12097 event pairs, 157 based on Foata normal form. 2/1489 useless extension candidates. Maximal degree in co-relation 2517. Up to 503 conditions per place. [2022-11-16 11:40:21,768 INFO L137 encePairwiseOnDemand]: 351/360 looper letters, 64 selfloop transitions, 8 changer transitions 0/326 dead transitions. [2022-11-16 11:40:21,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 326 transitions, 833 flow [2022-11-16 11:40:21,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:40:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:40:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2497 transitions. [2022-11-16 11:40:21,776 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8670138888888889 [2022-11-16 11:40:21,776 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2497 transitions. [2022-11-16 11:40:21,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2497 transitions. [2022-11-16 11:40:21,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:21,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2497 transitions. [2022-11-16 11:40:21,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 312.125) internal successors, (2497), 8 states have internal predecessors, (2497), 0 states have call successors, (0), 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:40:21,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 360.0) internal successors, (3240), 9 states have internal predecessors, (3240), 0 states have call successors, (0), 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:40:21,796 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 360.0) internal successors, (3240), 9 states have internal predecessors, (3240), 0 states have call successors, (0), 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:40:21,796 INFO L175 Difference]: Start difference. First operand has 301 places, 301 transitions, 631 flow. Second operand 8 states and 2497 transitions. [2022-11-16 11:40:21,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 326 transitions, 833 flow [2022-11-16 11:40:21,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 326 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:40:21,805 INFO L231 Difference]: Finished difference. Result has 309 places, 304 transitions, 661 flow [2022-11-16 11:40:21,805 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=661, PETRI_PLACES=309, PETRI_TRANSITIONS=304} [2022-11-16 11:40:21,806 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -20 predicate places. [2022-11-16 11:40:21,807 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 304 transitions, 661 flow [2022-11-16 11:40:21,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 305.7142857142857) internal successors, (2140), 7 states have internal predecessors, (2140), 0 states have call successors, (0), 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:40:21,808 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:21,808 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] [2022-11-16 11:40:21,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:40:21,809 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:40:21,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash 314015774, now seen corresponding path program 1 times [2022-11-16 11:40:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:21,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894720900] [2022-11-16 11:40:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:21,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:21,895 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:40:21,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:21,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894720900] [2022-11-16 11:40:21,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894720900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:21,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:21,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:40:21,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904871546] [2022-11-16 11:40:21,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:21,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:40:21,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:21,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:40:21,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:40:21,899 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 360 [2022-11-16 11:40:21,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 304 transitions, 661 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:21,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:21,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 360 [2022-11-16 11:40:21,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:22,288 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([944] thread3EXIT-->L89-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem34#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem34#1=|v_ULTIMATE.start_main_#t~mem34#1_5|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][295], [Black: 399#true, 420#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 431#true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), 401#(= |#race~A~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 311#L89-7true]) [2022-11-16 11:40:22,289 INFO L383 tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event [2022-11-16 11:40:22,289 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-16 11:40:22,289 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-16 11:40:22,289 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-16 11:40:22,290 INFO L130 PetriNetUnfolder]: 142/1406 cut-off events. [2022-11-16 11:40:22,290 INFO L131 PetriNetUnfolder]: For 66/108 co-relation queries the response was YES. [2022-11-16 11:40:22,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1716 conditions, 1406 events. 142/1406 cut-off events. For 66/108 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8932 event pairs, 36 based on Foata normal form. 2/1261 useless extension candidates. Maximal degree in co-relation 1670. Up to 142 conditions per place. [2022-11-16 11:40:22,320 INFO L137 encePairwiseOnDemand]: 357/360 looper letters, 16 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2022-11-16 11:40:22,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 305 transitions, 701 flow [2022-11-16 11:40:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:40:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:40:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2022-11-16 11:40:22,324 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.937037037037037 [2022-11-16 11:40:22,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1012 transitions. [2022-11-16 11:40:22,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1012 transitions. [2022-11-16 11:40:22,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:22,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1012 transitions. [2022-11-16 11:40:22,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 3 states have internal predecessors, (1012), 0 states have call successors, (0), 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:40:22,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:22,334 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:22,334 INFO L175 Difference]: Start difference. First operand has 309 places, 304 transitions, 661 flow. Second operand 3 states and 1012 transitions. [2022-11-16 11:40:22,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 305 transitions, 701 flow [2022-11-16 11:40:22,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 305 transitions, 691 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:40:22,349 INFO L231 Difference]: Finished difference. Result has 306 places, 303 transitions, 653 flow [2022-11-16 11:40:22,351 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=653, PETRI_PLACES=306, PETRI_TRANSITIONS=303} [2022-11-16 11:40:22,352 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -23 predicate places. [2022-11-16 11:40:22,352 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 303 transitions, 653 flow [2022-11-16 11:40:22,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:40:22,353 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:22,353 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] [2022-11-16 11:40:22,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:40:22,353 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:40:22,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:22,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1728614226, now seen corresponding path program 1 times [2022-11-16 11:40:22,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:22,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461966138] [2022-11-16 11:40:22,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:22,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:22,421 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:40:22,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:22,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461966138] [2022-11-16 11:40:22,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461966138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:22,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:22,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:40:22,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102511900] [2022-11-16 11:40:22,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:22,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:40:22,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:22,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:40:22,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:40:22,429 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 360 [2022-11-16 11:40:22,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 303 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 335.3333333333333) internal successors, (1006), 3 states have internal predecessors, (1006), 0 states have call successors, (0), 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:40:22,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:22,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 360 [2022-11-16 11:40:22,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:22,771 INFO L130 PetriNetUnfolder]: 161/1350 cut-off events. [2022-11-16 11:40:22,771 INFO L131 PetriNetUnfolder]: For 110/131 co-relation queries the response was YES. [2022-11-16 11:40:22,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 1350 events. 161/1350 cut-off events. For 110/131 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 8780 event pairs, 31 based on Foata normal form. 8/1220 useless extension candidates. Maximal degree in co-relation 1616. Up to 134 conditions per place. [2022-11-16 11:40:22,794 INFO L137 encePairwiseOnDemand]: 355/360 looper letters, 12 selfloop transitions, 2 changer transitions 9/303 dead transitions. [2022-11-16 11:40:22,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 303 transitions, 687 flow [2022-11-16 11:40:22,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:40:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:40:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1017 transitions. [2022-11-16 11:40:22,798 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2022-11-16 11:40:22,798 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1017 transitions. [2022-11-16 11:40:22,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1017 transitions. [2022-11-16 11:40:22,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:22,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1017 transitions. [2022-11-16 11:40:22,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 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:40:22,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:22,808 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:22,809 INFO L175 Difference]: Start difference. First operand has 306 places, 303 transitions, 653 flow. Second operand 3 states and 1017 transitions. [2022-11-16 11:40:22,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 303 transitions, 687 flow [2022-11-16 11:40:22,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 303 transitions, 683 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:40:22,819 INFO L231 Difference]: Finished difference. Result has 304 places, 292 transitions, 630 flow [2022-11-16 11:40:22,820 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=304, PETRI_TRANSITIONS=292} [2022-11-16 11:40:22,820 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -25 predicate places. [2022-11-16 11:40:22,821 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 292 transitions, 630 flow [2022-11-16 11:40:22,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.3333333333333) internal successors, (1006), 3 states have internal predecessors, (1006), 0 states have call successors, (0), 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:40:22,822 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:22,822 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] [2022-11-16 11:40:22,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:40:22,822 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:40:22,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:22,823 INFO L85 PathProgramCache]: Analyzing trace with hash 287251270, now seen corresponding path program 1 times [2022-11-16 11:40:22,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:22,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109981078] [2022-11-16 11:40:22,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:22,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:23,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:40:23,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:23,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109981078] [2022-11-16 11:40:23,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109981078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:23,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:23,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:40:23,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957989283] [2022-11-16 11:40:23,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:23,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:40:23,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:23,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:40:23,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:40:23,370 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 360 [2022-11-16 11:40:23,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 292 transitions, 630 flow. Second operand has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 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:40:23,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:23,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 360 [2022-11-16 11:40:23,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:35,032 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([852] L56-4-->L56-5: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][211], [435#true, 34#L48-5true, Black: 399#true, 70#L56-5true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 228#L85-4true, Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0), 439#true]) [2022-11-16 11:40:35,032 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-11-16 11:40:35,033 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 11:40:35,033 INFO L386 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-11-16 11:40:35,033 INFO L386 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-11-16 11:40:35,401 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 444#(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)), 70#L56-5true, 62#L87-7true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:35,402 INFO L383 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-11-16 11:40:35,402 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-11-16 11:40:35,402 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-16 11:40:35,402 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-11-16 11:40:35,402 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 444#(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)), 70#L56-5true, 21#L88-2true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:35,402 INFO L383 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-11-16 11:40:35,402 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-16 11:40:35,402 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-16 11:40:35,403 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-16 11:40:35,409 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 444#(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)), 70#L56-5true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0), 258#L88-3true]) [2022-11-16 11:40:35,409 INFO L383 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-11-16 11:40:35,409 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-16 11:40:35,409 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-16 11:40:35,409 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-16 11:40:35,778 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 444#(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)), 70#L56-5true, 366#(= |#race~N~0| 0), 344#L88-4true, Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:35,778 INFO L383 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2022-11-16 11:40:35,778 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-16 11:40:35,778 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-16 11:40:35,778 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-16 11:40:36,465 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 303#L88-5true, 444#(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)), 70#L56-5true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:36,465 INFO L383 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2022-11-16 11:40:36,465 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-16 11:40:36,465 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-11-16 11:40:36,465 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-11-16 11:40:36,827 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 444#(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)), 70#L56-5true, 366#(= |#race~N~0| 0), 91#L88-6true, Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:36,827 INFO L383 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-11-16 11:40:36,827 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-16 11:40:36,827 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-16 11:40:36,827 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-16 11:40:36,828 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 72#ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACEtrue, 324#L64-8true, Black: 399#true, 444#(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)), 70#L56-5true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:36,828 INFO L383 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-11-16 11:40:36,828 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-16 11:40:36,828 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-16 11:40:36,828 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-16 11:40:38,725 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 444#(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)), 70#L56-5true, 366#(= |#race~N~0| 0), 62#L87-7true, Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:38,726 INFO L383 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2022-11-16 11:40:38,726 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-11-16 11:40:38,726 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-11-16 11:40:38,726 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-16 11:40:38,726 INFO L386 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2022-11-16 11:40:39,908 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 444#(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)), 70#L56-5true, 21#L88-2true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:39,908 INFO L383 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2022-11-16 11:40:39,908 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-16 11:40:39,909 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-16 11:40:39,909 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-16 11:40:39,909 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-16 11:40:40,113 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 444#(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)), 70#L56-5true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0), 258#L88-3true]) [2022-11-16 11:40:40,113 INFO L383 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-11-16 11:40:40,113 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-16 11:40:40,113 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-16 11:40:40,114 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-16 11:40:40,114 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-16 11:40:40,302 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 444#(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)), 70#L56-5true, 366#(= |#race~N~0| 0), 344#L88-4true, Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:40,302 INFO L383 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2022-11-16 11:40:40,303 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-16 11:40:40,303 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-16 11:40:40,303 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-16 11:40:40,303 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-16 11:40:40,488 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 303#L88-5true, 444#(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)), 70#L56-5true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:40,488 INFO L383 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2022-11-16 11:40:40,488 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-11-16 11:40:40,488 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-16 11:40:40,488 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-11-16 11:40:40,489 INFO L386 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-11-16 11:40:40,688 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 444#(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)), 70#L56-5true, 91#L88-6true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:40,688 INFO L383 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-11-16 11:40:40,688 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-16 11:40:40,688 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-16 11:40:40,688 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-16 11:40:40,688 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-16 11:40:40,689 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 72#ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACEtrue, Black: 399#true, 324#L64-8true, 444#(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)), 70#L56-5true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:40,689 INFO L383 tUnfolder$Statistics]: this new event has 204 ancestors and is cut-off event [2022-11-16 11:40:40,689 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-16 11:40:40,689 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-16 11:40:40,689 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-16 11:40:40,689 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-16 11:40:41,034 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([804] L48-4-->L48-5: Formula: (= |v_#race~A~0_1| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_1|} AuxVars[] AssignedVars[#race~A~0][257], [437#(= |#race~sorted3~0| 0), 70#L56-5true, 366#(= |#race~N~0| 0), 328#L64-5true, Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 34#L48-5true, Black: 399#true, 200#L86-4true, 393#(= |#race~M~0| 0), 401#(= |#race~A~0| 0), 439#true]) [2022-11-16 11:40:41,034 INFO L383 tUnfolder$Statistics]: this new event has 223 ancestors and is cut-off event [2022-11-16 11:40:41,035 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-16 11:40:41,035 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-16 11:40:41,035 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-16 11:40:41,375 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([903] L64-4-->L64-5: Formula: (= |v_#race~A~0_13| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_13|} AuxVars[] AssignedVars[#race~A~0][204], [437#(= |#race~sorted3~0| 0), 70#L56-5true, 328#L64-5true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 34#L48-5true, Black: 399#true, 200#L86-4true, 393#(= |#race~M~0| 0), 401#(= |#race~A~0| 0), 439#true]) [2022-11-16 11:40:41,375 INFO L383 tUnfolder$Statistics]: this new event has 223 ancestors and is cut-off event [2022-11-16 11:40:41,375 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-16 11:40:41,378 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-16 11:40:41,378 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-16 11:40:42,667 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 444#(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)), 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0), 92#L88-7true]) [2022-11-16 11:40:42,667 INFO L383 tUnfolder$Statistics]: this new event has 237 ancestors and is cut-off event [2022-11-16 11:40:42,667 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-16 11:40:42,668 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-16 11:40:42,668 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-16 11:40:42,965 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 444#(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)), 100#L89-2true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:42,965 INFO L383 tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event [2022-11-16 11:40:42,965 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-16 11:40:42,965 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-16 11:40:42,965 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-16 11:40:42,970 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 444#(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)), 366#(= |#race~N~0| 0), 71#L89-3true, Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:42,970 INFO L383 tUnfolder$Statistics]: this new event has 241 ancestors and is cut-off event [2022-11-16 11:40:42,971 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-16 11:40:42,971 INFO L386 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-11-16 11:40:42,971 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-16 11:40:42,975 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 444#(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)), 309#L89-4true, 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:42,975 INFO L383 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-11-16 11:40:42,976 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 11:40:42,976 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 11:40:42,976 INFO L386 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-11-16 11:40:42,979 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), Black: 399#true, 324#L64-8true, 444#(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)), 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), 333#L89-5true, Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:42,980 INFO L383 tUnfolder$Statistics]: this new event has 243 ancestors and is cut-off event [2022-11-16 11:40:42,980 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-16 11:40:42,980 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-16 11:40:42,980 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-11-16 11:40:42,983 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 9#L89-6true, Black: 399#true, 324#L64-8true, 444#(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)), 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:42,983 INFO L383 tUnfolder$Statistics]: this new event has 244 ancestors and is cut-off event [2022-11-16 11:40:42,984 INFO L386 tUnfolder$Statistics]: existing Event has 174 ancestors and is cut-off event [2022-11-16 11:40:42,984 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-16 11:40:42,984 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-16 11:40:42,984 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([910] L64-7-->L64-8: Formula: (= (store |v_#race_42| v_~A~0.base_30 (store (select |v_#race_42| v_~A~0.base_30) (+ v_~A~0.offset_30 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0)) |v_#race_41|) InVars {#race=|v_#race_42|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} OutVars{#race=|v_#race_41|, ~A~0.base=v_~A~0.base_30, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_30} AuxVars[] AssignedVars[#race][225], [437#(= |#race~sorted3~0| 0), 324#L64-8true, Black: 399#true, 241#ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACEtrue, 444#(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)), 366#(= |#race~N~0| 0), Black: 424#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 426#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= thread1Thread1of1ForFork2_~i~0 0)), 393#(= |#race~M~0| 0), Black: 422#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 401#(= |#race~A~0| 0)]) [2022-11-16 11:40:42,985 INFO L383 tUnfolder$Statistics]: this new event has 244 ancestors and is cut-off event [2022-11-16 11:40:42,985 INFO L386 tUnfolder$Statistics]: existing Event has 174 ancestors and is cut-off event [2022-11-16 11:40:42,985 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-16 11:40:42,985 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-16 11:40:42,989 INFO L130 PetriNetUnfolder]: 58890/110037 cut-off events. [2022-11-16 11:40:42,990 INFO L131 PetriNetUnfolder]: For 112/3933 co-relation queries the response was YES. [2022-11-16 11:40:43,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192980 conditions, 110037 events. 58890/110037 cut-off events. For 112/3933 co-relation queries the response was YES. Maximal size of possible extension queue 2603. Compared 1129573 event pairs, 12868 based on Foata normal form. 108/96121 useless extension candidates. Maximal degree in co-relation 192934. Up to 29692 conditions per place. [2022-11-16 11:40:44,155 INFO L137 encePairwiseOnDemand]: 355/360 looper letters, 207 selfloop transitions, 4 changer transitions 0/435 dead transitions. [2022-11-16 11:40:44,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 435 transitions, 1338 flow [2022-11-16 11:40:44,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:40:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:40:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1886 transitions. [2022-11-16 11:40:44,164 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8731481481481481 [2022-11-16 11:40:44,164 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1886 transitions. [2022-11-16 11:40:44,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1886 transitions. [2022-11-16 11:40:44,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:44,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1886 transitions. [2022-11-16 11:40:44,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 314.3333333333333) internal successors, (1886), 6 states have internal predecessors, (1886), 0 states have call successors, (0), 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:40:44,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 360.0) internal successors, (2520), 7 states have internal predecessors, (2520), 0 states have call successors, (0), 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:40:44,177 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 360.0) internal successors, (2520), 7 states have internal predecessors, (2520), 0 states have call successors, (0), 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:40:44,177 INFO L175 Difference]: Start difference. First operand has 304 places, 292 transitions, 630 flow. Second operand 6 states and 1886 transitions. [2022-11-16 11:40:44,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 435 transitions, 1338 flow [2022-11-16 11:40:44,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 435 transitions, 1334 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:40:44,289 INFO L231 Difference]: Finished difference. Result has 297 places, 291 transitions, 632 flow [2022-11-16 11:40:44,290 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=632, PETRI_PLACES=297, PETRI_TRANSITIONS=291} [2022-11-16 11:40:44,291 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -32 predicate places. [2022-11-16 11:40:44,291 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 291 transitions, 632 flow [2022-11-16 11:40:44,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 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:40:44,292 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:44,292 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] [2022-11-16 11:40:44,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:40:44,293 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:40:44,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:44,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1151047327, now seen corresponding path program 1 times [2022-11-16 11:40:44,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:44,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315827929] [2022-11-16 11:40:44,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:44,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:44,441 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:40:44,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:44,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315827929] [2022-11-16 11:40:44,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315827929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:44,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:44,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:40:44,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18552685] [2022-11-16 11:40:44,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:44,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:40:44,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:44,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:40:44,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:40:44,446 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 360 [2022-11-16 11:40:44,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 291 transitions, 632 flow. Second operand has 5 states, 5 states have (on average 319.4) internal successors, (1597), 5 states have internal predecessors, (1597), 0 states have call successors, (0), 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:40:44,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:44,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 360 [2022-11-16 11:40:44,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:45,176 INFO L130 PetriNetUnfolder]: 508/3831 cut-off events. [2022-11-16 11:40:45,177 INFO L131 PetriNetUnfolder]: For 208/253 co-relation queries the response was YES. [2022-11-16 11:40:45,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4774 conditions, 3831 events. 508/3831 cut-off events. For 208/253 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 36429 event pairs, 275 based on Foata normal form. 0/3376 useless extension candidates. Maximal degree in co-relation 4727. Up to 590 conditions per place. [2022-11-16 11:40:45,216 INFO L137 encePairwiseOnDemand]: 355/360 looper letters, 43 selfloop transitions, 4 changer transitions 0/304 dead transitions. [2022-11-16 11:40:45,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 304 transitions, 759 flow [2022-11-16 11:40:45,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:40:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-16 11:40:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1628 transitions. [2022-11-16 11:40:45,222 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9044444444444445 [2022-11-16 11:40:45,223 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1628 transitions. [2022-11-16 11:40:45,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1628 transitions. [2022-11-16 11:40:45,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:45,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1628 transitions. [2022-11-16 11:40:45,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 325.6) internal successors, (1628), 5 states have internal predecessors, (1628), 0 states have call successors, (0), 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:40:45,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 360.0) internal successors, (2160), 6 states have internal predecessors, (2160), 0 states have call successors, (0), 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:40:45,237 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 360.0) internal successors, (2160), 6 states have internal predecessors, (2160), 0 states have call successors, (0), 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:40:45,238 INFO L175 Difference]: Start difference. First operand has 297 places, 291 transitions, 632 flow. Second operand 5 states and 1628 transitions. [2022-11-16 11:40:45,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 304 transitions, 759 flow [2022-11-16 11:40:45,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 304 transitions, 752 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:40:45,244 INFO L231 Difference]: Finished difference. Result has 299 places, 292 transitions, 642 flow [2022-11-16 11:40:45,245 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=642, PETRI_PLACES=299, PETRI_TRANSITIONS=292} [2022-11-16 11:40:45,246 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -30 predicate places. [2022-11-16 11:40:45,246 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 292 transitions, 642 flow [2022-11-16 11:40:45,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 319.4) internal successors, (1597), 5 states have internal predecessors, (1597), 0 states have call successors, (0), 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:40:45,247 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:45,247 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] [2022-11-16 11:40:45,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:40:45,248 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:40:45,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:45,248 INFO L85 PathProgramCache]: Analyzing trace with hash -169897350, now seen corresponding path program 1 times [2022-11-16 11:40:45,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:45,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90059254] [2022-11-16 11:40:45,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:45,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:45,306 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:40:45,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:45,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90059254] [2022-11-16 11:40:45,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90059254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:45,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:45,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:40:45,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711273780] [2022-11-16 11:40:45,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:45,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:40:45,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:45,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:40:45,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:40:45,311 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 360 [2022-11-16 11:40:45,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 292 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 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:40:45,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:45,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 360 [2022-11-16 11:40:45,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:40:46,084 INFO L130 PetriNetUnfolder]: 262/2010 cut-off events. [2022-11-16 11:40:46,084 INFO L131 PetriNetUnfolder]: For 191/212 co-relation queries the response was YES. [2022-11-16 11:40:46,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2541 conditions, 2010 events. 262/2010 cut-off events. For 191/212 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 15823 event pairs, 73 based on Foata normal form. 0/1815 useless extension candidates. Maximal degree in co-relation 2495. Up to 274 conditions per place. [2022-11-16 11:40:46,112 INFO L137 encePairwiseOnDemand]: 357/360 looper letters, 13 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2022-11-16 11:40:46,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 293 transitions, 676 flow [2022-11-16 11:40:46,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:40:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:40:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1009 transitions. [2022-11-16 11:40:46,117 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9342592592592592 [2022-11-16 11:40:46,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1009 transitions. [2022-11-16 11:40:46,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1009 transitions. [2022-11-16 11:40:46,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:40:46,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1009 transitions. [2022-11-16 11:40:46,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 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:40:46,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:46,126 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 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:40:46,127 INFO L175 Difference]: Start difference. First operand has 299 places, 292 transitions, 642 flow. Second operand 3 states and 1009 transitions. [2022-11-16 11:40:46,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 293 transitions, 676 flow [2022-11-16 11:40:46,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 293 transitions, 671 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:40:46,135 INFO L231 Difference]: Finished difference. Result has 298 places, 291 transitions, 639 flow [2022-11-16 11:40:46,136 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=298, PETRI_TRANSITIONS=291} [2022-11-16 11:40:46,137 INFO L288 CegarLoopForPetriNet]: 329 programPoint places, -31 predicate places. [2022-11-16 11:40:46,137 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 291 transitions, 639 flow [2022-11-16 11:40:46,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 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:40:46,138 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:40:46,138 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] [2022-11-16 11:40:46,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:40:46,138 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 60 more)] === [2022-11-16 11:40:46,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:40:46,139 INFO L85 PathProgramCache]: Analyzing trace with hash -186549074, now seen corresponding path program 1 times [2022-11-16 11:40:46,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:40:46,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278028762] [2022-11-16 11:40:46,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:40:46,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:40:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:40:46,786 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:40:46,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:40:46,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278028762] [2022-11-16 11:40:46,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278028762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:40:46,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:40:46,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:40:46,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604025182] [2022-11-16 11:40:46,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:40:46,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:40:46,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:40:46,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:40:46,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:40:46,793 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 360 [2022-11-16 11:40:46,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 291 transitions, 639 flow. Second operand has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:40:46,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:40:46,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 360 [2022-11-16 11:40:46,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand