./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro --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 4b2db95108d1ec3739bf941ab9d238fd5c3dd7467faa747c6c0552ae2048ee95 --- 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-8393723 [2022-11-18 20:51:10,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:51:10,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:51:10,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:51:10,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:51:10,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:51:10,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:51:10,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:51:10,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:51:10,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:51:10,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:51:10,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:51:10,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:51:10,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:51:10,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:51:10,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:51:10,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:51:10,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:51:10,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:51:10,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:51:10,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:51:10,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:51:10,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:51:10,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:51:10,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:51:10,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:51:10,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:51:10,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:51:10,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:51:10,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:51:10,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:51:10,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:51:10,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:51:10,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:51:10,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:51:10,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:51:10,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:51:10,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:51:10,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:51:10,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:51:10,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:51:10,709 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-18 20:51:10,756 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:51:10,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:51:10,757 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:51:10,757 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:51:10,758 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:51:10,759 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:51:10,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:51:10,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:51:10,760 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:51:10,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:51:10,762 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:51:10,762 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:51:10,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:51:10,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:51:10,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:51:10,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:51:10,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:51:10,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:51:10,764 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-18 20:51:10,764 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:51:10,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:51:10,765 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:51:10,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:51:10,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:51:10,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:51:10,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:51:10,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:51:10,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:51:10,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:51:10,769 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:51:10,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:51:10,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:51:10,769 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:51:10,770 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:51:10,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:51:10,770 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_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro/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_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro 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 -> 4b2db95108d1ec3739bf941ab9d238fd5c3dd7467faa747c6c0552ae2048ee95 [2022-11-18 20:51:11,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:51:11,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:51:11,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:51:11,120 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:51:11,121 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:51:11,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2022-11-18 20:51:11,206 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro/data/d25b3b660/0b2a02cdeceb4ca7a732efba7abc03f5/FLAGdd4bc6115 [2022-11-18 20:51:11,768 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:51:11,769 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2022-11-18 20:51:11,778 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro/data/d25b3b660/0b2a02cdeceb4ca7a732efba7abc03f5/FLAGdd4bc6115 [2022-11-18 20:51:12,129 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro/data/d25b3b660/0b2a02cdeceb4ca7a732efba7abc03f5 [2022-11-18 20:51:12,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:51:12,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:51:12,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:51:12,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:51:12,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:51:12,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:12" (1/1) ... [2022-11-18 20:51:12,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8f293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:12, skipping insertion in model container [2022-11-18 20:51:12,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:51:12" (1/1) ... [2022-11-18 20:51:12,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:51:12,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:51:12,613 WARN L234 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_f50d3ef3-8a12-4e2f-b282-b63c96964b55/sv-benchmarks/c/weaver/popl20-commit-1.wvr.c[4604,4617] [2022-11-18 20:51:12,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:51:12,652 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:51:12,739 WARN L234 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_f50d3ef3-8a12-4e2f-b282-b63c96964b55/sv-benchmarks/c/weaver/popl20-commit-1.wvr.c[4604,4617] [2022-11-18 20:51:12,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:51:12,769 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:51:12,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:12 WrapperNode [2022-11-18 20:51:12,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:51:12,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:51:12,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:51:12,772 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:51:12,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:12" (1/1) ... [2022-11-18 20:51:12,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:12" (1/1) ... [2022-11-18 20:51:12,875 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 715 [2022-11-18 20:51:12,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:51:12,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:51:12,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:51:12,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:51:12,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:12" (1/1) ... [2022-11-18 20:51:12,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:12" (1/1) ... [2022-11-18 20:51:12,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:12" (1/1) ... [2022-11-18 20:51:12,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:12" (1/1) ... [2022-11-18 20:51:12,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:12" (1/1) ... [2022-11-18 20:51:12,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:12" (1/1) ... [2022-11-18 20:51:12,959 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:12" (1/1) ... [2022-11-18 20:51:12,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:12" (1/1) ... [2022-11-18 20:51:12,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:51:12,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:51:12,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:51:12,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:51:12,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:12" (1/1) ... [2022-11-18 20:51:12,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:51:13,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:51:13,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:51:13,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:51:13,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:51:13,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:51:13,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:51:13,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:51:13,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-18 20:51:13,087 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-18 20:51:13,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-18 20:51:13,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-18 20:51:13,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-18 20:51:13,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-18 20:51:13,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:51:13,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 20:51:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 20:51:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:51:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:51:13,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:51:13,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:51:13,092 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:51:13,308 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:51:13,323 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:51:14,736 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:51:15,928 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:51:15,928 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-18 20:51:15,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:15 BoogieIcfgContainer [2022-11-18 20:51:15,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:51:15,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:51:15,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:51:15,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:51:15,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:51:12" (1/3) ... [2022-11-18 20:51:15,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3620abd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:51:15, skipping insertion in model container [2022-11-18 20:51:15,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:51:12" (2/3) ... [2022-11-18 20:51:15,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3620abd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:51:15, skipping insertion in model container [2022-11-18 20:51:15,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:15" (3/3) ... [2022-11-18 20:51:15,944 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2022-11-18 20:51:15,959 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:51:15,972 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:51:15,972 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 116 error locations. [2022-11-18 20:51:15,973 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:51:16,284 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-18 20:51:16,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 470 places, 479 transitions, 982 flow [2022-11-18 20:51:16,648 INFO L130 PetriNetUnfolder]: 19/476 cut-off events. [2022-11-18 20:51:16,649 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 20:51:16,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 476 events. 19/476 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 707 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 397. Up to 2 conditions per place. [2022-11-18 20:51:16,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 470 places, 479 transitions, 982 flow [2022-11-18 20:51:16,682 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 448 places, 456 transitions, 930 flow [2022-11-18 20:51:16,698 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:51:16,707 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;@465c7f46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:51:16,707 INFO L358 AbstractCegarLoop]: Starting to check reachability of 207 error locations. [2022-11-18 20:51:16,713 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-11-18 20:51:16,714 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:51:16,714 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:16,715 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:16,716 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:16,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:16,722 INFO L85 PathProgramCache]: Analyzing trace with hash 361508747, now seen corresponding path program 1 times [2022-11-18 20:51:16,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:16,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913948782] [2022-11-18 20:51:16,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:16,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:17,128 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-18 20:51:17,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:17,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913948782] [2022-11-18 20:51:17,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913948782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:17,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:17,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:17,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216546495] [2022-11-18 20:51:17,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:17,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:17,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:17,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:17,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:17,206 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-18 20:51:17,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 456 transitions, 930 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 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-18 20:51:17,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:17,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-18 20:51:17,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:17,741 INFO L130 PetriNetUnfolder]: 66/439 cut-off events. [2022-11-18 20:51:17,741 INFO L131 PetriNetUnfolder]: For 37/49 co-relation queries the response was YES. [2022-11-18 20:51:17,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 439 events. 66/439 cut-off events. For 37/49 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 527 event pairs, 31 based on Foata normal form. 41/431 useless extension candidates. Maximal degree in co-relation 372. Up to 104 conditions per place. [2022-11-18 20:51:17,747 INFO L137 encePairwiseOnDemand]: 376/479 looper letters, 19 selfloop transitions, 2 changer transitions 6/355 dead transitions. [2022-11-18 20:51:17,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 355 transitions, 770 flow [2022-11-18 20:51:17,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2022-11-18 20:51:17,771 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8239387613082811 [2022-11-18 20:51:17,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1184 transitions. [2022-11-18 20:51:17,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1184 transitions. [2022-11-18 20:51:17,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:17,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1184 transitions. [2022-11-18 20:51:17,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:51:17,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:17,817 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:17,820 INFO L175 Difference]: Start difference. First operand has 448 places, 456 transitions, 930 flow. Second operand 3 states and 1184 transitions. [2022-11-18 20:51:17,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 355 transitions, 770 flow [2022-11-18 20:51:17,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 355 transitions, 758 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-18 20:51:17,849 INFO L231 Difference]: Finished difference. Result has 355 places, 349 transitions, 708 flow [2022-11-18 20:51:17,853 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=355, PETRI_TRANSITIONS=349} [2022-11-18 20:51:17,858 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -93 predicate places. [2022-11-18 20:51:17,858 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 349 transitions, 708 flow [2022-11-18 20:51:17,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 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-18 20:51:17,860 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:17,860 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:17,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:51:17,861 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:17,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:17,862 INFO L85 PathProgramCache]: Analyzing trace with hash -442970851, now seen corresponding path program 1 times [2022-11-18 20:51:17,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:17,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627364162] [2022-11-18 20:51:17,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:17,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:17,953 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-18 20:51:17,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:17,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627364162] [2022-11-18 20:51:17,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627364162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:17,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:17,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:17,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42388053] [2022-11-18 20:51:17,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:17,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:17,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:17,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:17,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:17,961 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-18 20:51:17,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 349 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 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-18 20:51:17,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:17,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-18 20:51:17,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:18,306 INFO L130 PetriNetUnfolder]: 66/432 cut-off events. [2022-11-18 20:51:18,306 INFO L131 PetriNetUnfolder]: For 7/19 co-relation queries the response was YES. [2022-11-18 20:51:18,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 432 events. 66/432 cut-off events. For 7/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 521 event pairs, 31 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 515. Up to 105 conditions per place. [2022-11-18 20:51:18,310 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/348 dead transitions. [2022-11-18 20:51:18,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 348 transitions, 750 flow [2022-11-18 20:51:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-18 20:51:18,314 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-18 20:51:18,314 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-18 20:51:18,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-18 20:51:18,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:18,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-18 20:51:18,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 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-18 20:51:18,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:18,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:18,324 INFO L175 Difference]: Start difference. First operand has 355 places, 349 transitions, 708 flow. Second operand 3 states and 1085 transitions. [2022-11-18 20:51:18,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 348 transitions, 750 flow [2022-11-18 20:51:18,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 348 transitions, 746 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:51:18,333 INFO L231 Difference]: Finished difference. Result has 348 places, 348 transitions, 706 flow [2022-11-18 20:51:18,334 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=348, PETRI_TRANSITIONS=348} [2022-11-18 20:51:18,335 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -100 predicate places. [2022-11-18 20:51:18,335 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 348 transitions, 706 flow [2022-11-18 20:51:18,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 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-18 20:51:18,336 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:18,337 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] [2022-11-18 20:51:18,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:51:18,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:18,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:18,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2120855895, now seen corresponding path program 1 times [2022-11-18 20:51:18,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:18,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598832539] [2022-11-18 20:51:18,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:18,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:18,444 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-18 20:51:18,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:18,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598832539] [2022-11-18 20:51:18,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598832539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:18,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:18,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:18,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550856854] [2022-11-18 20:51:18,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:18,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:18,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:18,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:18,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:18,449 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-18 20:51:18,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 348 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 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-18 20:51:18,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:18,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-18 20:51:18,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:18,753 INFO L130 PetriNetUnfolder]: 66/431 cut-off events. [2022-11-18 20:51:18,753 INFO L131 PetriNetUnfolder]: For 7/19 co-relation queries the response was YES. [2022-11-18 20:51:18,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 431 events. 66/431 cut-off events. For 7/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 523 event pairs, 31 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 507. Up to 105 conditions per place. [2022-11-18 20:51:18,759 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2022-11-18 20:51:18,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 347 transitions, 748 flow [2022-11-18 20:51:18,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:18,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-18 20:51:18,766 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-18 20:51:18,766 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-18 20:51:18,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-18 20:51:18,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:18,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-18 20:51:18,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 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-18 20:51:18,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:18,776 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:18,776 INFO L175 Difference]: Start difference. First operand has 348 places, 348 transitions, 706 flow. Second operand 3 states and 1085 transitions. [2022-11-18 20:51:18,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 347 transitions, 748 flow [2022-11-18 20:51:18,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 347 transitions, 744 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:51:18,786 INFO L231 Difference]: Finished difference. Result has 347 places, 347 transitions, 704 flow [2022-11-18 20:51:18,786 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=704, PETRI_PLACES=347, PETRI_TRANSITIONS=347} [2022-11-18 20:51:18,789 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -101 predicate places. [2022-11-18 20:51:18,790 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 347 transitions, 704 flow [2022-11-18 20:51:18,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 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-18 20:51:18,792 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:18,792 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] [2022-11-18 20:51:18,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:51:18,792 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:18,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:18,793 INFO L85 PathProgramCache]: Analyzing trace with hash -383090007, now seen corresponding path program 1 times [2022-11-18 20:51:18,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:18,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019786171] [2022-11-18 20:51:18,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:18,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:18,913 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-18 20:51:18,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:18,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019786171] [2022-11-18 20:51:18,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019786171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:18,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:18,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:18,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086959872] [2022-11-18 20:51:18,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:18,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:18,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:18,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:18,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:18,919 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-18 20:51:18,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 347 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:18,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:18,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-18 20:51:18,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:19,272 INFO L130 PetriNetUnfolder]: 89/558 cut-off events. [2022-11-18 20:51:19,272 INFO L131 PetriNetUnfolder]: For 15/33 co-relation queries the response was YES. [2022-11-18 20:51:19,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 558 events. 89/558 cut-off events. For 15/33 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1192 event pairs, 38 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 662. Up to 107 conditions per place. [2022-11-18 20:51:19,277 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 26 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2022-11-18 20:51:19,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 356 transitions, 783 flow [2022-11-18 20:51:19,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:19,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2022-11-18 20:51:19,283 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7654836464857342 [2022-11-18 20:51:19,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1100 transitions. [2022-11-18 20:51:19,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1100 transitions. [2022-11-18 20:51:19,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:19,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1100 transitions. [2022-11-18 20:51:19,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 366.6666666666667) internal successors, (1100), 3 states have internal predecessors, (1100), 0 states have call successors, (0), 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-18 20:51:19,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:19,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:19,299 INFO L175 Difference]: Start difference. First operand has 347 places, 347 transitions, 704 flow. Second operand 3 states and 1100 transitions. [2022-11-18 20:51:19,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 356 transitions, 783 flow [2022-11-18 20:51:19,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 356 transitions, 779 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:51:19,313 INFO L231 Difference]: Finished difference. Result has 347 places, 347 transitions, 708 flow [2022-11-18 20:51:19,313 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=347, PETRI_TRANSITIONS=347} [2022-11-18 20:51:19,315 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -101 predicate places. [2022-11-18 20:51:19,315 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 347 transitions, 708 flow [2022-11-18 20:51:19,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:19,317 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:19,317 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] [2022-11-18 20:51:19,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:51:19,317 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:19,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:19,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2036418058, now seen corresponding path program 1 times [2022-11-18 20:51:19,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:19,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127359930] [2022-11-18 20:51:19,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:19,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:19,398 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-18 20:51:19,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:19,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127359930] [2022-11-18 20:51:19,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127359930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:19,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:19,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:19,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127590372] [2022-11-18 20:51:19,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:19,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:19,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:19,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:19,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:19,403 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-18 20:51:19,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 347 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:19,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:19,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-18 20:51:19,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:19,720 INFO L130 PetriNetUnfolder]: 89/531 cut-off events. [2022-11-18 20:51:19,720 INFO L131 PetriNetUnfolder]: For 29/44 co-relation queries the response was YES. [2022-11-18 20:51:19,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 531 events. 89/531 cut-off events. For 29/44 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1031 event pairs, 44 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 351. Up to 139 conditions per place. [2022-11-18 20:51:19,724 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 18 selfloop transitions, 2 changer transitions 0/346 dead transitions. [2022-11-18 20:51:19,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 346 transitions, 746 flow [2022-11-18 20:51:19,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-18 20:51:19,728 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-18 20:51:19,728 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-18 20:51:19,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-18 20:51:19,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:19,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-18 20:51:19,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 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-18 20:51:19,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:19,738 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:19,738 INFO L175 Difference]: Start difference. First operand has 347 places, 347 transitions, 708 flow. Second operand 3 states and 1091 transitions. [2022-11-18 20:51:19,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 346 transitions, 746 flow [2022-11-18 20:51:19,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 346 transitions, 744 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:51:19,746 INFO L231 Difference]: Finished difference. Result has 347 places, 346 transitions, 708 flow [2022-11-18 20:51:19,747 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=347, PETRI_TRANSITIONS=346} [2022-11-18 20:51:19,748 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -101 predicate places. [2022-11-18 20:51:19,748 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 346 transitions, 708 flow [2022-11-18 20:51:19,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:19,749 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:19,749 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:19,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:51:19,750 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:19,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:19,751 INFO L85 PathProgramCache]: Analyzing trace with hash 519389193, now seen corresponding path program 1 times [2022-11-18 20:51:19,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:19,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329471000] [2022-11-18 20:51:19,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:19,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:19,803 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-18 20:51:19,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:19,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329471000] [2022-11-18 20:51:19,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329471000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:19,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:19,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:19,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033215528] [2022-11-18 20:51:19,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:19,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:19,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:19,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:19,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:19,808 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-18 20:51:19,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 346 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:19,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:19,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-18 20:51:19,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:20,083 INFO L130 PetriNetUnfolder]: 89/530 cut-off events. [2022-11-18 20:51:20,084 INFO L131 PetriNetUnfolder]: For 28/43 co-relation queries the response was YES. [2022-11-18 20:51:20,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 530 events. 89/530 cut-off events. For 28/43 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1039 event pairs, 44 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 641. Up to 137 conditions per place. [2022-11-18 20:51:20,088 INFO L137 encePairwiseOnDemand]: 477/479 looper letters, 18 selfloop transitions, 1 changer transitions 0/345 dead transitions. [2022-11-18 20:51:20,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 345 transitions, 744 flow [2022-11-18 20:51:20,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2022-11-18 20:51:20,092 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7585247042449548 [2022-11-18 20:51:20,092 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1090 transitions. [2022-11-18 20:51:20,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1090 transitions. [2022-11-18 20:51:20,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:20,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1090 transitions. [2022-11-18 20:51:20,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 0 states have call successors, (0), 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-18 20:51:20,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:20,102 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:20,102 INFO L175 Difference]: Start difference. First operand has 347 places, 346 transitions, 708 flow. Second operand 3 states and 1090 transitions. [2022-11-18 20:51:20,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 345 transitions, 744 flow [2022-11-18 20:51:20,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 345 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:51:20,111 INFO L231 Difference]: Finished difference. Result has 346 places, 345 transitions, 704 flow [2022-11-18 20:51:20,112 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=704, PETRI_PLACES=346, PETRI_TRANSITIONS=345} [2022-11-18 20:51:20,113 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -102 predicate places. [2022-11-18 20:51:20,113 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 345 transitions, 704 flow [2022-11-18 20:51:20,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:20,115 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:20,115 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] [2022-11-18 20:51:20,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:51:20,115 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:20,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:20,116 INFO L85 PathProgramCache]: Analyzing trace with hash -175073494, now seen corresponding path program 1 times [2022-11-18 20:51:20,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:20,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488193831] [2022-11-18 20:51:20,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:20,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:20,190 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-18 20:51:20,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:20,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488193831] [2022-11-18 20:51:20,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488193831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:20,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:20,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:20,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252383718] [2022-11-18 20:51:20,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:20,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:20,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:20,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:20,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:20,195 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-18 20:51:20,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 345 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:20,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:20,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-18 20:51:20,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:20,527 INFO L130 PetriNetUnfolder]: 89/529 cut-off events. [2022-11-18 20:51:20,528 INFO L131 PetriNetUnfolder]: For 28/43 co-relation queries the response was YES. [2022-11-18 20:51:20,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 529 events. 89/529 cut-off events. For 28/43 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1034 event pairs, 44 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 641. Up to 139 conditions per place. [2022-11-18 20:51:20,532 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 18 selfloop transitions, 2 changer transitions 0/344 dead transitions. [2022-11-18 20:51:20,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 344 transitions, 742 flow [2022-11-18 20:51:20,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-18 20:51:20,536 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-18 20:51:20,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-18 20:51:20,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-18 20:51:20,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:20,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-18 20:51:20,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 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-18 20:51:20,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:20,545 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:20,545 INFO L175 Difference]: Start difference. First operand has 346 places, 345 transitions, 704 flow. Second operand 3 states and 1091 transitions. [2022-11-18 20:51:20,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 344 transitions, 742 flow [2022-11-18 20:51:20,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 344 transitions, 741 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:51:20,554 INFO L231 Difference]: Finished difference. Result has 346 places, 344 transitions, 705 flow [2022-11-18 20:51:20,555 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=346, PETRI_TRANSITIONS=344} [2022-11-18 20:51:20,556 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -102 predicate places. [2022-11-18 20:51:20,556 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 344 transitions, 705 flow [2022-11-18 20:51:20,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:20,557 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:20,557 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] [2022-11-18 20:51:20,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:51:20,558 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:20,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:20,558 INFO L85 PathProgramCache]: Analyzing trace with hash 184583361, now seen corresponding path program 1 times [2022-11-18 20:51:20,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:20,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558496447] [2022-11-18 20:51:20,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:20,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:21,237 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-18 20:51:21,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:21,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558496447] [2022-11-18 20:51:21,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558496447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:21,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:21,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:51:21,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403601765] [2022-11-18 20:51:21,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:21,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:51:21,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:21,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:51:21,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:51:21,244 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 479 [2022-11-18 20:51:21,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 344 transitions, 705 flow. Second operand has 6 states, 6 states have (on average 295.8333333333333) internal successors, (1775), 6 states have internal predecessors, (1775), 0 states have call successors, (0), 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-18 20:51:21,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:21,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 479 [2022-11-18 20:51:21,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:22,270 INFO L130 PetriNetUnfolder]: 569/1174 cut-off events. [2022-11-18 20:51:22,270 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-11-18 20:51:22,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 1174 events. 569/1174 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3654 event pairs, 320 based on Foata normal form. 0/1106 useless extension candidates. Maximal degree in co-relation 2052. Up to 841 conditions per place. [2022-11-18 20:51:22,280 INFO L137 encePairwiseOnDemand]: 461/479 looper letters, 66 selfloop transitions, 15 changer transitions 0/341 dead transitions. [2022-11-18 20:51:22,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 341 transitions, 861 flow [2022-11-18 20:51:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:51:22,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:51:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1847 transitions. [2022-11-18 20:51:22,286 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6426583159359778 [2022-11-18 20:51:22,286 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1847 transitions. [2022-11-18 20:51:22,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1847 transitions. [2022-11-18 20:51:22,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:22,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1847 transitions. [2022-11-18 20:51:22,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 307.8333333333333) internal successors, (1847), 6 states have internal predecessors, (1847), 0 states have call successors, (0), 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-18 20:51:22,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 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-18 20:51:22,301 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 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-18 20:51:22,302 INFO L175 Difference]: Start difference. First operand has 346 places, 344 transitions, 705 flow. Second operand 6 states and 1847 transitions. [2022-11-18 20:51:22,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 341 transitions, 861 flow [2022-11-18 20:51:22,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 341 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:51:22,310 INFO L231 Difference]: Finished difference. Result has 346 places, 341 transitions, 725 flow [2022-11-18 20:51:22,311 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=725, PETRI_PLACES=346, PETRI_TRANSITIONS=341} [2022-11-18 20:51:22,312 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -102 predicate places. [2022-11-18 20:51:22,312 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 341 transitions, 725 flow [2022-11-18 20:51:22,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 295.8333333333333) internal successors, (1775), 6 states have internal predecessors, (1775), 0 states have call successors, (0), 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-18 20:51:22,313 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:22,314 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] [2022-11-18 20:51:22,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:51:22,314 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:22,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:22,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1666495121, now seen corresponding path program 1 times [2022-11-18 20:51:22,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:22,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167494575] [2022-11-18 20:51:22,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:22,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:22,366 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-18 20:51:22,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:22,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167494575] [2022-11-18 20:51:22,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167494575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:22,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:22,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432008935] [2022-11-18 20:51:22,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:22,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:22,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:22,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:22,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:22,372 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-18 20:51:22,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 341 transitions, 725 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 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-18 20:51:22,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:22,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-18 20:51:22,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:22,655 INFO L130 PetriNetUnfolder]: 89/525 cut-off events. [2022-11-18 20:51:22,656 INFO L131 PetriNetUnfolder]: For 28/43 co-relation queries the response was YES. [2022-11-18 20:51:22,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 525 events. 89/525 cut-off events. For 28/43 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1022 event pairs, 44 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 670. Up to 142 conditions per place. [2022-11-18 20:51:22,659 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 21 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2022-11-18 20:51:22,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 340 transitions, 769 flow [2022-11-18 20:51:22,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:22,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-18 20:51:22,663 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-18 20:51:22,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-18 20:51:22,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-18 20:51:22,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:22,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-18 20:51:22,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 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-18 20:51:22,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:22,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:22,673 INFO L175 Difference]: Start difference. First operand has 346 places, 341 transitions, 725 flow. Second operand 3 states and 1085 transitions. [2022-11-18 20:51:22,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 340 transitions, 769 flow [2022-11-18 20:51:22,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 340 transitions, 739 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 20:51:22,681 INFO L231 Difference]: Finished difference. Result has 342 places, 340 transitions, 697 flow [2022-11-18 20:51:22,682 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=342, PETRI_TRANSITIONS=340} [2022-11-18 20:51:22,683 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -106 predicate places. [2022-11-18 20:51:22,683 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 340 transitions, 697 flow [2022-11-18 20:51:22,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 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-18 20:51:22,684 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:22,684 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:22,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:51:22,685 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:22,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:22,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1773761217, now seen corresponding path program 1 times [2022-11-18 20:51:22,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:22,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456335112] [2022-11-18 20:51:22,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:22,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:22,736 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-18 20:51:22,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:22,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456335112] [2022-11-18 20:51:22,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456335112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:22,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:22,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:22,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648427719] [2022-11-18 20:51:22,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:22,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:22,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:22,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:22,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:22,741 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-18 20:51:22,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 340 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:22,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:22,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-18 20:51:22,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:23,196 INFO L130 PetriNetUnfolder]: 149/740 cut-off events. [2022-11-18 20:51:23,196 INFO L131 PetriNetUnfolder]: For 51/70 co-relation queries the response was YES. [2022-11-18 20:51:23,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 740 events. 149/740 cut-off events. For 51/70 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2417 event pairs, 50 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 956. Up to 121 conditions per place. [2022-11-18 20:51:23,202 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 29 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2022-11-18 20:51:23,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 351 transitions, 788 flow [2022-11-18 20:51:23,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1101 transitions. [2022-11-18 20:51:23,207 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7661795407098121 [2022-11-18 20:51:23,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1101 transitions. [2022-11-18 20:51:23,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1101 transitions. [2022-11-18 20:51:23,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:23,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1101 transitions. [2022-11-18 20:51:23,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 0 states have call successors, (0), 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-18 20:51:23,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:23,218 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:23,218 INFO L175 Difference]: Start difference. First operand has 342 places, 340 transitions, 697 flow. Second operand 3 states and 1101 transitions. [2022-11-18 20:51:23,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 351 transitions, 788 flow [2022-11-18 20:51:23,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 351 transitions, 784 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:51:23,228 INFO L231 Difference]: Finished difference. Result has 342 places, 340 transitions, 701 flow [2022-11-18 20:51:23,229 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=342, PETRI_TRANSITIONS=340} [2022-11-18 20:51:23,230 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -106 predicate places. [2022-11-18 20:51:23,230 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 340 transitions, 701 flow [2022-11-18 20:51:23,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:23,232 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:23,233 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:23,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:51:23,233 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:23,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:23,234 INFO L85 PathProgramCache]: Analyzing trace with hash -847127388, now seen corresponding path program 1 times [2022-11-18 20:51:23,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:23,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328436275] [2022-11-18 20:51:23,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:23,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:23,297 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-18 20:51:23,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:23,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328436275] [2022-11-18 20:51:23,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328436275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:23,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:23,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:23,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800975440] [2022-11-18 20:51:23,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:23,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:23,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:23,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:23,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:23,303 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-18 20:51:23,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 340 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:23,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:23,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-18 20:51:23,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:23,683 INFO L130 PetriNetUnfolder]: 149/719 cut-off events. [2022-11-18 20:51:23,684 INFO L131 PetriNetUnfolder]: For 63/87 co-relation queries the response was YES. [2022-11-18 20:51:23,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 719 events. 149/719 cut-off events. For 63/87 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2327 event pairs, 86 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 982. Up to 233 conditions per place. [2022-11-18 20:51:23,690 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 19 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2022-11-18 20:51:23,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 339 transitions, 741 flow [2022-11-18 20:51:23,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:23,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-18 20:51:23,694 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-18 20:51:23,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-18 20:51:23,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-18 20:51:23,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:23,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-18 20:51:23,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 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-18 20:51:23,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:23,731 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:23,731 INFO L175 Difference]: Start difference. First operand has 342 places, 340 transitions, 701 flow. Second operand 3 states and 1091 transitions. [2022-11-18 20:51:23,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 339 transitions, 741 flow [2022-11-18 20:51:23,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 339 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:51:23,740 INFO L231 Difference]: Finished difference. Result has 342 places, 339 transitions, 701 flow [2022-11-18 20:51:23,741 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=342, PETRI_TRANSITIONS=339} [2022-11-18 20:51:23,741 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -106 predicate places. [2022-11-18 20:51:23,742 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 339 transitions, 701 flow [2022-11-18 20:51:23,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:23,742 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:23,743 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-18 20:51:23,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:51:23,743 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:23,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash -820869240, now seen corresponding path program 1 times [2022-11-18 20:51:23,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:23,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150645328] [2022-11-18 20:51:23,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:23,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:23,801 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-18 20:51:23,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:23,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150645328] [2022-11-18 20:51:23,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150645328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:23,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:23,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:23,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258986707] [2022-11-18 20:51:23,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:23,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:23,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:23,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:23,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:23,806 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-18 20:51:23,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 339 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 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-18 20:51:23,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:23,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-18 20:51:23,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:24,191 INFO L130 PetriNetUnfolder]: 149/718 cut-off events. [2022-11-18 20:51:24,191 INFO L131 PetriNetUnfolder]: For 62/86 co-relation queries the response was YES. [2022-11-18 20:51:24,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 718 events. 149/718 cut-off events. For 62/86 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2331 event pairs, 86 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 970. Up to 236 conditions per place. [2022-11-18 20:51:24,198 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 22 selfloop transitions, 2 changer transitions 0/338 dead transitions. [2022-11-18 20:51:24,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 338 transitions, 747 flow [2022-11-18 20:51:24,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:24,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-18 20:51:24,202 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-18 20:51:24,202 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-18 20:51:24,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-18 20:51:24,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:24,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-18 20:51:24,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 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-18 20:51:24,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:24,210 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:24,210 INFO L175 Difference]: Start difference. First operand has 342 places, 339 transitions, 701 flow. Second operand 3 states and 1085 transitions. [2022-11-18 20:51:24,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 338 transitions, 747 flow [2022-11-18 20:51:24,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 338 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:51:24,218 INFO L231 Difference]: Finished difference. Result has 341 places, 338 transitions, 699 flow [2022-11-18 20:51:24,219 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=341, PETRI_TRANSITIONS=338} [2022-11-18 20:51:24,222 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -107 predicate places. [2022-11-18 20:51:24,222 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 338 transitions, 699 flow [2022-11-18 20:51:24,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 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-18 20:51:24,223 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:24,224 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] [2022-11-18 20:51:24,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:51:24,224 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:24,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:24,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1878791325, now seen corresponding path program 1 times [2022-11-18 20:51:24,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:24,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319837681] [2022-11-18 20:51:24,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:24,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:24,281 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-18 20:51:24,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:24,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319837681] [2022-11-18 20:51:24,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319837681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:24,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:24,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:24,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419026979] [2022-11-18 20:51:24,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:24,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:24,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:24,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:24,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:24,292 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-18 20:51:24,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 338 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:24,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:24,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-18 20:51:24,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:24,650 INFO L130 PetriNetUnfolder]: 149/717 cut-off events. [2022-11-18 20:51:24,650 INFO L131 PetriNetUnfolder]: For 63/87 co-relation queries the response was YES. [2022-11-18 20:51:24,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 717 events. 149/717 cut-off events. For 63/87 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2311 event pairs, 86 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 966. Up to 231 conditions per place. [2022-11-18 20:51:24,656 INFO L137 encePairwiseOnDemand]: 477/479 looper letters, 19 selfloop transitions, 1 changer transitions 0/337 dead transitions. [2022-11-18 20:51:24,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 337 transitions, 737 flow [2022-11-18 20:51:24,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2022-11-18 20:51:24,661 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7585247042449548 [2022-11-18 20:51:24,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1090 transitions. [2022-11-18 20:51:24,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1090 transitions. [2022-11-18 20:51:24,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:24,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1090 transitions. [2022-11-18 20:51:24,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 0 states have call successors, (0), 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-18 20:51:24,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:24,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:24,671 INFO L175 Difference]: Start difference. First operand has 341 places, 338 transitions, 699 flow. Second operand 3 states and 1090 transitions. [2022-11-18 20:51:24,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 337 transitions, 737 flow [2022-11-18 20:51:24,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 337 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:51:24,679 INFO L231 Difference]: Finished difference. Result has 340 places, 337 transitions, 695 flow [2022-11-18 20:51:24,680 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=340, PETRI_TRANSITIONS=337} [2022-11-18 20:51:24,681 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -108 predicate places. [2022-11-18 20:51:24,682 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 337 transitions, 695 flow [2022-11-18 20:51:24,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:24,682 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:24,683 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:24,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:51:24,683 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:24,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:24,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1356856705, now seen corresponding path program 1 times [2022-11-18 20:51:24,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:24,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979170867] [2022-11-18 20:51:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:24,764 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-18 20:51:24,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:24,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979170867] [2022-11-18 20:51:24,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979170867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:24,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:24,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:24,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809309675] [2022-11-18 20:51:24,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:24,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:24,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:24,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:24,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:24,769 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-18 20:51:24,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 337 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:24,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:24,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-18 20:51:24,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:25,149 INFO L130 PetriNetUnfolder]: 149/716 cut-off events. [2022-11-18 20:51:25,149 INFO L131 PetriNetUnfolder]: For 62/86 co-relation queries the response was YES. [2022-11-18 20:51:25,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 716 events. 149/716 cut-off events. For 62/86 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2311 event pairs, 86 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 964. Up to 233 conditions per place. [2022-11-18 20:51:25,155 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 19 selfloop transitions, 2 changer transitions 0/336 dead transitions. [2022-11-18 20:51:25,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 336 transitions, 735 flow [2022-11-18 20:51:25,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-18 20:51:25,159 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-18 20:51:25,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-18 20:51:25,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-18 20:51:25,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:25,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-18 20:51:25,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 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-18 20:51:25,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:25,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:25,167 INFO L175 Difference]: Start difference. First operand has 340 places, 337 transitions, 695 flow. Second operand 3 states and 1091 transitions. [2022-11-18 20:51:25,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 336 transitions, 735 flow [2022-11-18 20:51:25,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 336 transitions, 734 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:51:25,177 INFO L231 Difference]: Finished difference. Result has 340 places, 336 transitions, 696 flow [2022-11-18 20:51:25,178 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=340, PETRI_TRANSITIONS=336} [2022-11-18 20:51:25,179 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -108 predicate places. [2022-11-18 20:51:25,179 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 336 transitions, 696 flow [2022-11-18 20:51:25,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:25,180 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:25,180 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:25,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:51:25,180 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:25,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:25,181 INFO L85 PathProgramCache]: Analyzing trace with hash 597954493, now seen corresponding path program 1 times [2022-11-18 20:51:25,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:25,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754728621] [2022-11-18 20:51:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:25,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:25,251 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-18 20:51:25,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:25,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754728621] [2022-11-18 20:51:25,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754728621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:25,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:25,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:25,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916005325] [2022-11-18 20:51:25,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:25,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:25,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:25,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:25,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:25,255 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-18 20:51:25,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 336 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 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-18 20:51:25,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:25,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-18 20:51:25,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:25,707 INFO L130 PetriNetUnfolder]: 149/715 cut-off events. [2022-11-18 20:51:25,708 INFO L131 PetriNetUnfolder]: For 62/86 co-relation queries the response was YES. [2022-11-18 20:51:25,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 715 events. 149/715 cut-off events. For 62/86 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2329 event pairs, 86 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 968. Up to 236 conditions per place. [2022-11-18 20:51:25,715 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 22 selfloop transitions, 2 changer transitions 0/335 dead transitions. [2022-11-18 20:51:25,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 335 transitions, 742 flow [2022-11-18 20:51:25,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:25,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-18 20:51:25,720 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-18 20:51:25,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-18 20:51:25,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-18 20:51:25,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:25,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-18 20:51:25,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 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-18 20:51:25,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:25,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:25,730 INFO L175 Difference]: Start difference. First operand has 340 places, 336 transitions, 696 flow. Second operand 3 states and 1085 transitions. [2022-11-18 20:51:25,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 335 transitions, 742 flow [2022-11-18 20:51:25,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 335 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:51:25,740 INFO L231 Difference]: Finished difference. Result has 339 places, 335 transitions, 694 flow [2022-11-18 20:51:25,740 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=339, PETRI_TRANSITIONS=335} [2022-11-18 20:51:25,741 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -109 predicate places. [2022-11-18 20:51:25,741 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 335 transitions, 694 flow [2022-11-18 20:51:25,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 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-18 20:51:25,742 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:25,743 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:25,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:51:25,743 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:25,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1824779301, now seen corresponding path program 1 times [2022-11-18 20:51:25,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:25,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912560399] [2022-11-18 20:51:25,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:25,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:25,826 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-18 20:51:25,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:25,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912560399] [2022-11-18 20:51:25,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912560399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:25,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:25,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:25,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527376763] [2022-11-18 20:51:25,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:25,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:25,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:25,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:25,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:25,832 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-18 20:51:25,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 335 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:25,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:25,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-18 20:51:25,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:26,421 INFO L130 PetriNetUnfolder]: 223/1059 cut-off events. [2022-11-18 20:51:26,421 INFO L131 PetriNetUnfolder]: For 119/150 co-relation queries the response was YES. [2022-11-18 20:51:26,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 1059 events. 223/1059 cut-off events. For 119/150 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4923 event pairs, 32 based on Foata normal form. 3/967 useless extension candidates. Maximal degree in co-relation 1461. Up to 254 conditions per place. [2022-11-18 20:51:26,430 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 31 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2022-11-18 20:51:26,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 347 transitions, 796 flow [2022-11-18 20:51:26,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1101 transitions. [2022-11-18 20:51:26,434 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7661795407098121 [2022-11-18 20:51:26,434 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1101 transitions. [2022-11-18 20:51:26,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1101 transitions. [2022-11-18 20:51:26,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:26,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1101 transitions. [2022-11-18 20:51:26,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 0 states have call successors, (0), 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-18 20:51:26,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:26,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:26,442 INFO L175 Difference]: Start difference. First operand has 339 places, 335 transitions, 694 flow. Second operand 3 states and 1101 transitions. [2022-11-18 20:51:26,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 347 transitions, 796 flow [2022-11-18 20:51:26,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 347 transitions, 792 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:51:26,450 INFO L231 Difference]: Finished difference. Result has 339 places, 335 transitions, 698 flow [2022-11-18 20:51:26,451 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=339, PETRI_TRANSITIONS=335} [2022-11-18 20:51:26,452 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -109 predicate places. [2022-11-18 20:51:26,452 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 335 transitions, 698 flow [2022-11-18 20:51:26,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:26,453 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:26,453 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:26,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:51:26,453 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:26,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:26,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1330974816, now seen corresponding path program 1 times [2022-11-18 20:51:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:26,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841441377] [2022-11-18 20:51:26,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:26,521 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-18 20:51:26,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:26,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841441377] [2022-11-18 20:51:26,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841441377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:26,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:26,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:26,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323892519] [2022-11-18 20:51:26,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:26,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:26,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:26,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:26,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:26,526 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-18 20:51:26,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 335 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:26,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:26,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-18 20:51:26,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:27,084 INFO L130 PetriNetUnfolder]: 223/1030 cut-off events. [2022-11-18 20:51:27,084 INFO L131 PetriNetUnfolder]: For 166/202 co-relation queries the response was YES. [2022-11-18 20:51:27,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 1030 events. 223/1030 cut-off events. For 166/202 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4865 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1530. Up to 352 conditions per place. [2022-11-18 20:51:27,093 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/334 dead transitions. [2022-11-18 20:51:27,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 334 transitions, 740 flow [2022-11-18 20:51:27,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-18 20:51:27,097 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-18 20:51:27,097 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-18 20:51:27,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-18 20:51:27,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:27,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-18 20:51:27,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 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-18 20:51:27,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:27,105 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:27,105 INFO L175 Difference]: Start difference. First operand has 339 places, 335 transitions, 698 flow. Second operand 3 states and 1091 transitions. [2022-11-18 20:51:27,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 334 transitions, 740 flow [2022-11-18 20:51:27,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 334 transitions, 738 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:51:27,114 INFO L231 Difference]: Finished difference. Result has 339 places, 334 transitions, 698 flow [2022-11-18 20:51:27,114 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=339, PETRI_TRANSITIONS=334} [2022-11-18 20:51:27,115 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -109 predicate places. [2022-11-18 20:51:27,115 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 334 transitions, 698 flow [2022-11-18 20:51:27,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:27,116 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:27,116 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:27,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:51:27,117 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:27,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:27,117 INFO L85 PathProgramCache]: Analyzing trace with hash -998629159, now seen corresponding path program 1 times [2022-11-18 20:51:27,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:27,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850523304] [2022-11-18 20:51:27,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:27,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:27,191 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-18 20:51:27,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:27,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850523304] [2022-11-18 20:51:27,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850523304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:27,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:27,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:27,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819541208] [2022-11-18 20:51:27,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:27,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:27,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:27,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:27,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:27,196 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-18 20:51:27,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 334 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 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-18 20:51:27,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:27,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-18 20:51:27,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:27,772 INFO L130 PetriNetUnfolder]: 223/1029 cut-off events. [2022-11-18 20:51:27,772 INFO L131 PetriNetUnfolder]: For 165/201 co-relation queries the response was YES. [2022-11-18 20:51:27,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 1029 events. 223/1029 cut-off events. For 165/201 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4836 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1501. Up to 355 conditions per place. [2022-11-18 20:51:27,784 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 23 selfloop transitions, 2 changer transitions 0/333 dead transitions. [2022-11-18 20:51:27,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 333 transitions, 746 flow [2022-11-18 20:51:27,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-18 20:51:27,788 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-18 20:51:27,788 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-18 20:51:27,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-18 20:51:27,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:27,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-18 20:51:27,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 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-18 20:51:27,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:27,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:27,796 INFO L175 Difference]: Start difference. First operand has 339 places, 334 transitions, 698 flow. Second operand 3 states and 1085 transitions. [2022-11-18 20:51:27,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 333 transitions, 746 flow [2022-11-18 20:51:27,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 333 transitions, 742 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:51:27,804 INFO L231 Difference]: Finished difference. Result has 338 places, 333 transitions, 696 flow [2022-11-18 20:51:27,805 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=338, PETRI_TRANSITIONS=333} [2022-11-18 20:51:27,805 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -110 predicate places. [2022-11-18 20:51:27,806 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 333 transitions, 696 flow [2022-11-18 20:51:27,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 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-18 20:51:27,806 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:27,807 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:27,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 20:51:27,807 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:27,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:27,808 INFO L85 PathProgramCache]: Analyzing trace with hash -905714229, now seen corresponding path program 1 times [2022-11-18 20:51:27,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:27,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133054737] [2022-11-18 20:51:27,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:27,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:27,890 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-18 20:51:27,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:27,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133054737] [2022-11-18 20:51:27,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133054737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:27,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:27,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141309975] [2022-11-18 20:51:27,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:27,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:27,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:27,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:27,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:27,896 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-18 20:51:27,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 333 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:27,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:27,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-18 20:51:27,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:28,453 INFO L130 PetriNetUnfolder]: 223/1028 cut-off events. [2022-11-18 20:51:28,453 INFO L131 PetriNetUnfolder]: For 166/202 co-relation queries the response was YES. [2022-11-18 20:51:28,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 1028 events. 223/1028 cut-off events. For 166/202 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4846 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1497. Up to 350 conditions per place. [2022-11-18 20:51:28,463 INFO L137 encePairwiseOnDemand]: 477/479 looper letters, 20 selfloop transitions, 1 changer transitions 0/332 dead transitions. [2022-11-18 20:51:28,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 332 transitions, 736 flow [2022-11-18 20:51:28,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2022-11-18 20:51:28,468 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7585247042449548 [2022-11-18 20:51:28,468 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1090 transitions. [2022-11-18 20:51:28,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1090 transitions. [2022-11-18 20:51:28,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:28,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1090 transitions. [2022-11-18 20:51:28,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 0 states have call successors, (0), 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-18 20:51:28,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:28,479 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:28,479 INFO L175 Difference]: Start difference. First operand has 338 places, 333 transitions, 696 flow. Second operand 3 states and 1090 transitions. [2022-11-18 20:51:28,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 332 transitions, 736 flow [2022-11-18 20:51:28,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 332 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:51:28,489 INFO L231 Difference]: Finished difference. Result has 337 places, 332 transitions, 692 flow [2022-11-18 20:51:28,490 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=692, PETRI_PLACES=337, PETRI_TRANSITIONS=332} [2022-11-18 20:51:28,491 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -111 predicate places. [2022-11-18 20:51:28,491 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 332 transitions, 692 flow [2022-11-18 20:51:28,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:28,492 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:28,492 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:28,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 20:51:28,493 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:28,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1941591913, now seen corresponding path program 1 times [2022-11-18 20:51:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:28,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017811235] [2022-11-18 20:51:28,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:28,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:28,589 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-18 20:51:28,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:28,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017811235] [2022-11-18 20:51:28,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017811235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:28,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:28,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:28,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26929789] [2022-11-18 20:51:28,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:28,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:28,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:28,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:28,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:28,595 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-18 20:51:28,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 332 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:28,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:28,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-18 20:51:28,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:29,270 INFO L130 PetriNetUnfolder]: 223/1027 cut-off events. [2022-11-18 20:51:29,270 INFO L131 PetriNetUnfolder]: For 165/201 co-relation queries the response was YES. [2022-11-18 20:51:29,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 1027 events. 223/1027 cut-off events. For 165/201 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4815 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1495. Up to 352 conditions per place. [2022-11-18 20:51:29,280 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2022-11-18 20:51:29,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 331 transitions, 734 flow [2022-11-18 20:51:29,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-18 20:51:29,284 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-18 20:51:29,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-18 20:51:29,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-18 20:51:29,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:29,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-18 20:51:29,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 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-18 20:51:29,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:29,293 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:29,293 INFO L175 Difference]: Start difference. First operand has 337 places, 332 transitions, 692 flow. Second operand 3 states and 1091 transitions. [2022-11-18 20:51:29,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 331 transitions, 734 flow [2022-11-18 20:51:29,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 331 transitions, 733 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:51:29,301 INFO L231 Difference]: Finished difference. Result has 337 places, 331 transitions, 693 flow [2022-11-18 20:51:29,301 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=337, PETRI_TRANSITIONS=331} [2022-11-18 20:51:29,302 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -111 predicate places. [2022-11-18 20:51:29,302 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 331 transitions, 693 flow [2022-11-18 20:51:29,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:29,303 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:29,303 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:29,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 20:51:29,304 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:29,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:29,304 INFO L85 PathProgramCache]: Analyzing trace with hash 618760609, now seen corresponding path program 1 times [2022-11-18 20:51:29,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:29,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103266565] [2022-11-18 20:51:29,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:29,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:29,390 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-18 20:51:29,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:29,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103266565] [2022-11-18 20:51:29,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103266565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:29,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:29,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:29,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156416463] [2022-11-18 20:51:29,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:29,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:29,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:29,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:29,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:29,395 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-18 20:51:29,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 331 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:29,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:29,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-18 20:51:29,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:29,941 INFO L130 PetriNetUnfolder]: 223/1026 cut-off events. [2022-11-18 20:51:29,942 INFO L131 PetriNetUnfolder]: For 165/201 co-relation queries the response was YES. [2022-11-18 20:51:29,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 1026 events. 223/1026 cut-off events. For 165/201 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4840 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1496. Up to 352 conditions per place. [2022-11-18 20:51:29,950 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2022-11-18 20:51:29,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 330 transitions, 735 flow [2022-11-18 20:51:29,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-18 20:51:29,955 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-18 20:51:29,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-18 20:51:29,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-18 20:51:29,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:29,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-18 20:51:29,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 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-18 20:51:29,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:29,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:29,964 INFO L175 Difference]: Start difference. First operand has 337 places, 331 transitions, 693 flow. Second operand 3 states and 1091 transitions. [2022-11-18 20:51:29,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 330 transitions, 735 flow [2022-11-18 20:51:29,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 330 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:51:29,971 INFO L231 Difference]: Finished difference. Result has 336 places, 330 transitions, 691 flow [2022-11-18 20:51:29,972 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=336, PETRI_TRANSITIONS=330} [2022-11-18 20:51:29,973 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -112 predicate places. [2022-11-18 20:51:29,973 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 330 transitions, 691 flow [2022-11-18 20:51:29,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:29,974 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:29,974 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:29,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 20:51:29,974 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:29,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:29,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1929497099, now seen corresponding path program 1 times [2022-11-18 20:51:29,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:29,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685964644] [2022-11-18 20:51:29,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:29,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:30,051 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-18 20:51:30,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:30,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685964644] [2022-11-18 20:51:30,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685964644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:30,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:30,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:30,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505095152] [2022-11-18 20:51:30,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:30,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:30,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:30,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:30,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:30,055 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-18 20:51:30,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 330 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:30,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:30,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-18 20:51:30,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:30,614 INFO L130 PetriNetUnfolder]: 223/1025 cut-off events. [2022-11-18 20:51:30,614 INFO L131 PetriNetUnfolder]: For 165/201 co-relation queries the response was YES. [2022-11-18 20:51:30,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 1025 events. 223/1025 cut-off events. For 165/201 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4812 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1495. Up to 352 conditions per place. [2022-11-18 20:51:30,621 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2022-11-18 20:51:30,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 329 transitions, 733 flow [2022-11-18 20:51:30,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-18 20:51:30,625 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-18 20:51:30,625 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-18 20:51:30,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-18 20:51:30,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:30,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-18 20:51:30,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 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-18 20:51:30,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:30,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:30,634 INFO L175 Difference]: Start difference. First operand has 336 places, 330 transitions, 691 flow. Second operand 3 states and 1091 transitions. [2022-11-18 20:51:30,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 329 transitions, 733 flow [2022-11-18 20:51:30,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 329 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:51:30,641 INFO L231 Difference]: Finished difference. Result has 335 places, 329 transitions, 689 flow [2022-11-18 20:51:30,642 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=335, PETRI_TRANSITIONS=329} [2022-11-18 20:51:30,642 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -113 predicate places. [2022-11-18 20:51:30,642 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 329 transitions, 689 flow [2022-11-18 20:51:30,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 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-18 20:51:30,643 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:30,644 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:51:30,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-18 20:51:30,644 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:30,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:30,645 INFO L85 PathProgramCache]: Analyzing trace with hash -626006107, now seen corresponding path program 1 times [2022-11-18 20:51:30,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:30,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608447987] [2022-11-18 20:51:30,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:30,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:31,460 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-18 20:51:31,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:31,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608447987] [2022-11-18 20:51:31,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608447987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:31,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:31,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:51:31,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417736690] [2022-11-18 20:51:31,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:31,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:51:31,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:31,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:51:31,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:51:31,470 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 479 [2022-11-18 20:51:31,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 329 transitions, 689 flow. Second operand has 6 states, 6 states have (on average 323.0) internal successors, (1938), 6 states have internal predecessors, (1938), 0 states have call successors, (0), 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-18 20:51:31,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:31,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 479 [2022-11-18 20:51:31,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:34,128 INFO L130 PetriNetUnfolder]: 1687/3138 cut-off events. [2022-11-18 20:51:34,129 INFO L131 PetriNetUnfolder]: For 882/882 co-relation queries the response was YES. [2022-11-18 20:51:34,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6531 conditions, 3138 events. 1687/3138 cut-off events. For 882/882 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 16001 event pairs, 233 based on Foata normal form. 0/3021 useless extension candidates. Maximal degree in co-relation 6464. Up to 1216 conditions per place. [2022-11-18 20:51:34,153 INFO L137 encePairwiseOnDemand]: 474/479 looper letters, 93 selfloop transitions, 4 changer transitions 0/372 dead transitions. [2022-11-18 20:51:34,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 372 transitions, 1017 flow [2022-11-18 20:51:34,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:51:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:51:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2009 transitions. [2022-11-18 20:51:34,160 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6990257480862909 [2022-11-18 20:51:34,160 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2009 transitions. [2022-11-18 20:51:34,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2009 transitions. [2022-11-18 20:51:34,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:34,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2009 transitions. [2022-11-18 20:51:34,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 334.8333333333333) internal successors, (2009), 6 states have internal predecessors, (2009), 0 states have call successors, (0), 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-18 20:51:34,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 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-18 20:51:34,175 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 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-18 20:51:34,175 INFO L175 Difference]: Start difference. First operand has 335 places, 329 transitions, 689 flow. Second operand 6 states and 2009 transitions. [2022-11-18 20:51:34,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 372 transitions, 1017 flow [2022-11-18 20:51:34,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 372 transitions, 1013 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:51:34,183 INFO L231 Difference]: Finished difference. Result has 337 places, 328 transitions, 691 flow [2022-11-18 20:51:34,184 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=691, PETRI_PLACES=337, PETRI_TRANSITIONS=328} [2022-11-18 20:51:34,185 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -111 predicate places. [2022-11-18 20:51:34,185 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 328 transitions, 691 flow [2022-11-18 20:51:34,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 323.0) internal successors, (1938), 6 states have internal predecessors, (1938), 0 states have call successors, (0), 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-18 20:51:34,186 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:34,186 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:51:34,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-18 20:51:34,187 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:34,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:34,188 INFO L85 PathProgramCache]: Analyzing trace with hash -490622007, now seen corresponding path program 1 times [2022-11-18 20:51:34,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:34,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13053366] [2022-11-18 20:51:34,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:34,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:35,016 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-18 20:51:35,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:35,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13053366] [2022-11-18 20:51:35,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13053366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:35,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:35,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:51:35,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837771070] [2022-11-18 20:51:35,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:35,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:51:35,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:35,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:51:35,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:51:35,022 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 479 [2022-11-18 20:51:35,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 328 transitions, 691 flow. Second operand has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 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-18 20:51:35,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:35,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 479 [2022-11-18 20:51:35,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:37,436 INFO L130 PetriNetUnfolder]: 1512/2940 cut-off events. [2022-11-18 20:51:37,436 INFO L131 PetriNetUnfolder]: For 901/901 co-relation queries the response was YES. [2022-11-18 20:51:37,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6248 conditions, 2940 events. 1512/2940 cut-off events. For 901/901 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14966 event pairs, 837 based on Foata normal form. 0/2815 useless extension candidates. Maximal degree in co-relation 6181. Up to 1608 conditions per place. [2022-11-18 20:51:37,459 INFO L137 encePairwiseOnDemand]: 474/479 looper letters, 72 selfloop transitions, 4 changer transitions 0/351 dead transitions. [2022-11-18 20:51:37,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 351 transitions, 921 flow [2022-11-18 20:51:37,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:51:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:51:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1992 transitions. [2022-11-18 20:51:37,467 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6931106471816284 [2022-11-18 20:51:37,467 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1992 transitions. [2022-11-18 20:51:37,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1992 transitions. [2022-11-18 20:51:37,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:37,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1992 transitions. [2022-11-18 20:51:37,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 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-18 20:51:37,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 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-18 20:51:37,485 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 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-18 20:51:37,485 INFO L175 Difference]: Start difference. First operand has 337 places, 328 transitions, 691 flow. Second operand 6 states and 1992 transitions. [2022-11-18 20:51:37,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 351 transitions, 921 flow [2022-11-18 20:51:37,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 351 transitions, 914 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 20:51:37,495 INFO L231 Difference]: Finished difference. Result has 337 places, 327 transitions, 690 flow [2022-11-18 20:51:37,496 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=690, PETRI_PLACES=337, PETRI_TRANSITIONS=327} [2022-11-18 20:51:37,496 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -111 predicate places. [2022-11-18 20:51:37,497 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 327 transitions, 690 flow [2022-11-18 20:51:37,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 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-18 20:51:37,498 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:37,498 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:51:37,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-18 20:51:37,499 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:37,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash -888181121, now seen corresponding path program 1 times [2022-11-18 20:51:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:37,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650338247] [2022-11-18 20:51:37,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:37,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:38,612 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-18 20:51:38,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:38,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650338247] [2022-11-18 20:51:38,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650338247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:38,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:38,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:51:38,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257656111] [2022-11-18 20:51:38,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:38,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:51:38,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:38,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:51:38,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:51:38,617 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 479 [2022-11-18 20:51:38,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 327 transitions, 690 flow. Second operand has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 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-18 20:51:38,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:38,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 479 [2022-11-18 20:51:38,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:40,632 INFO L130 PetriNetUnfolder]: 1489/2909 cut-off events. [2022-11-18 20:51:40,632 INFO L131 PetriNetUnfolder]: For 786/786 co-relation queries the response was YES. [2022-11-18 20:51:40,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6082 conditions, 2909 events. 1489/2909 cut-off events. For 786/786 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 14845 event pairs, 1015 based on Foata normal form. 0/2816 useless extension candidates. Maximal degree in co-relation 6015. Up to 1995 conditions per place. [2022-11-18 20:51:40,653 INFO L137 encePairwiseOnDemand]: 474/479 looper letters, 59 selfloop transitions, 4 changer transitions 0/338 dead transitions. [2022-11-18 20:51:40,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 338 transitions, 854 flow [2022-11-18 20:51:40,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:51:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:51:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1983 transitions. [2022-11-18 20:51:40,660 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6899791231732777 [2022-11-18 20:51:40,660 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1983 transitions. [2022-11-18 20:51:40,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1983 transitions. [2022-11-18 20:51:40,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:40,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1983 transitions. [2022-11-18 20:51:40,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 330.5) internal successors, (1983), 6 states have internal predecessors, (1983), 0 states have call successors, (0), 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-18 20:51:40,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 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-18 20:51:40,679 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 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-18 20:51:40,679 INFO L175 Difference]: Start difference. First operand has 337 places, 327 transitions, 690 flow. Second operand 6 states and 1983 transitions. [2022-11-18 20:51:40,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 338 transitions, 854 flow [2022-11-18 20:51:40,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 338 transitions, 847 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 20:51:40,687 INFO L231 Difference]: Finished difference. Result has 337 places, 326 transitions, 689 flow [2022-11-18 20:51:40,689 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=689, PETRI_PLACES=337, PETRI_TRANSITIONS=326} [2022-11-18 20:51:40,690 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -111 predicate places. [2022-11-18 20:51:40,690 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 326 transitions, 689 flow [2022-11-18 20:51:40,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 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-18 20:51:40,691 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:51:40,691 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:51:40,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-18 20:51:40,692 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-18 20:51:40,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:51:40,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1253771268, now seen corresponding path program 1 times [2022-11-18 20:51:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:51:40,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125491839] [2022-11-18 20:51:40,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:51:40,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:51:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:51:40,828 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-18 20:51:40,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:51:40,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125491839] [2022-11-18 20:51:40,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125491839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:51:40,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:51:40,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:51:40,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64192444] [2022-11-18 20:51:40,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:51:40,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:51:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:51:40,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:51:40,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:51:40,833 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-18 20:51:40,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 326 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 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-18 20:51:40,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:51:40,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-18 20:51:40,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:51:41,350 INFO L130 PetriNetUnfolder]: 223/1007 cut-off events. [2022-11-18 20:51:41,350 INFO L131 PetriNetUnfolder]: For 165/201 co-relation queries the response was YES. [2022-11-18 20:51:41,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 1007 events. 223/1007 cut-off events. For 165/201 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4697 event pairs, 146 based on Foata normal form. 8/926 useless extension candidates. Maximal degree in co-relation 1507. Up to 351 conditions per place. [2022-11-18 20:51:41,356 INFO L137 encePairwiseOnDemand]: 477/479 looper letters, 0 selfloop transitions, 0 changer transitions 325/325 dead transitions. [2022-11-18 20:51:41,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 325 transitions, 727 flow [2022-11-18 20:51:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:51:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:51:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1089 transitions. [2022-11-18 20:51:41,360 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7578288100208769 [2022-11-18 20:51:41,360 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1089 transitions. [2022-11-18 20:51:41,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1089 transitions. [2022-11-18 20:51:41,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:51:41,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1089 transitions. [2022-11-18 20:51:41,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 0 states have call successors, (0), 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-18 20:51:41,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:41,367 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 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-18 20:51:41,367 INFO L175 Difference]: Start difference. First operand has 337 places, 326 transitions, 689 flow. Second operand 3 states and 1089 transitions. [2022-11-18 20:51:41,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 325 transitions, 727 flow [2022-11-18 20:51:41,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 325 transitions, 720 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 20:51:41,373 INFO L231 Difference]: Finished difference. Result has 334 places, 0 transitions, 0 flow [2022-11-18 20:51:41,374 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=334, PETRI_TRANSITIONS=0} [2022-11-18 20:51:41,375 INFO L288 CegarLoopForPetriNet]: 448 programPoint places, -114 predicate places. [2022-11-18 20:51:41,375 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 0 transitions, 0 flow [2022-11-18 20:51:41,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 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-18 20:51:41,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (206 of 207 remaining) [2022-11-18 20:51:41,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (205 of 207 remaining) [2022-11-18 20:51:41,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (204 of 207 remaining) [2022-11-18 20:51:41,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (203 of 207 remaining) [2022-11-18 20:51:41,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (202 of 207 remaining) [2022-11-18 20:51:41,381 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (201 of 207 remaining) [2022-11-18 20:51:41,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (200 of 207 remaining) [2022-11-18 20:51:41,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (199 of 207 remaining) [2022-11-18 20:51:41,382 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (198 of 207 remaining) [2022-11-18 20:51:41,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (197 of 207 remaining) [2022-11-18 20:51:41,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (196 of 207 remaining) [2022-11-18 20:51:41,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (195 of 207 remaining) [2022-11-18 20:51:41,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (194 of 207 remaining) [2022-11-18 20:51:41,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (193 of 207 remaining) [2022-11-18 20:51:41,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (192 of 207 remaining) [2022-11-18 20:51:41,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (191 of 207 remaining) [2022-11-18 20:51:41,384 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (190 of 207 remaining) [2022-11-18 20:51:41,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (189 of 207 remaining) [2022-11-18 20:51:41,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (188 of 207 remaining) [2022-11-18 20:51:41,385 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (187 of 207 remaining) [2022-11-18 20:51:41,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (186 of 207 remaining) [2022-11-18 20:51:41,386 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (185 of 207 remaining) [2022-11-18 20:51:41,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (184 of 207 remaining) [2022-11-18 20:51:41,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (183 of 207 remaining) [2022-11-18 20:51:41,389 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (182 of 207 remaining) [2022-11-18 20:51:41,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (181 of 207 remaining) [2022-11-18 20:51:41,390 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (180 of 207 remaining) [2022-11-18 20:51:41,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (179 of 207 remaining) [2022-11-18 20:51:41,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (178 of 207 remaining) [2022-11-18 20:51:41,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (177 of 207 remaining) [2022-11-18 20:51:41,391 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (176 of 207 remaining) [2022-11-18 20:51:41,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (175 of 207 remaining) [2022-11-18 20:51:41,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (174 of 207 remaining) [2022-11-18 20:51:41,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (173 of 207 remaining) [2022-11-18 20:51:41,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (172 of 207 remaining) [2022-11-18 20:51:41,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (171 of 207 remaining) [2022-11-18 20:51:41,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (170 of 207 remaining) [2022-11-18 20:51:41,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (169 of 207 remaining) [2022-11-18 20:51:41,393 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (168 of 207 remaining) [2022-11-18 20:51:41,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (167 of 207 remaining) [2022-11-18 20:51:41,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (166 of 207 remaining) [2022-11-18 20:51:41,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (165 of 207 remaining) [2022-11-18 20:51:41,394 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (164 of 207 remaining) [2022-11-18 20:51:41,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (163 of 207 remaining) [2022-11-18 20:51:41,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (162 of 207 remaining) [2022-11-18 20:51:41,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (161 of 207 remaining) [2022-11-18 20:51:41,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (160 of 207 remaining) [2022-11-18 20:51:41,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (159 of 207 remaining) [2022-11-18 20:51:41,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (158 of 207 remaining) [2022-11-18 20:51:41,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (157 of 207 remaining) [2022-11-18 20:51:41,396 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (156 of 207 remaining) [2022-11-18 20:51:41,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (155 of 207 remaining) [2022-11-18 20:51:41,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (154 of 207 remaining) [2022-11-18 20:51:41,397 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (153 of 207 remaining) [2022-11-18 20:51:41,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (152 of 207 remaining) [2022-11-18 20:51:41,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (151 of 207 remaining) [2022-11-18 20:51:41,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (150 of 207 remaining) [2022-11-18 20:51:41,398 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (149 of 207 remaining) [2022-11-18 20:51:41,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (148 of 207 remaining) [2022-11-18 20:51:41,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (147 of 207 remaining) [2022-11-18 20:51:41,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (146 of 207 remaining) [2022-11-18 20:51:41,399 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (145 of 207 remaining) [2022-11-18 20:51:41,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (144 of 207 remaining) [2022-11-18 20:51:41,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (143 of 207 remaining) [2022-11-18 20:51:41,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (142 of 207 remaining) [2022-11-18 20:51:41,400 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (141 of 207 remaining) [2022-11-18 20:51:41,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (140 of 207 remaining) [2022-11-18 20:51:41,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (139 of 207 remaining) [2022-11-18 20:51:41,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (138 of 207 remaining) [2022-11-18 20:51:41,401 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (137 of 207 remaining) [2022-11-18 20:51:41,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (136 of 207 remaining) [2022-11-18 20:51:41,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (135 of 207 remaining) [2022-11-18 20:51:41,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (134 of 207 remaining) [2022-11-18 20:51:41,402 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (133 of 207 remaining) [2022-11-18 20:51:41,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (132 of 207 remaining) [2022-11-18 20:51:41,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (131 of 207 remaining) [2022-11-18 20:51:41,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (130 of 207 remaining) [2022-11-18 20:51:41,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (129 of 207 remaining) [2022-11-18 20:51:41,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (128 of 207 remaining) [2022-11-18 20:51:41,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (127 of 207 remaining) [2022-11-18 20:51:41,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (126 of 207 remaining) [2022-11-18 20:51:41,404 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (125 of 207 remaining) [2022-11-18 20:51:41,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (124 of 207 remaining) [2022-11-18 20:51:41,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (123 of 207 remaining) [2022-11-18 20:51:41,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (122 of 207 remaining) [2022-11-18 20:51:41,405 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (121 of 207 remaining) [2022-11-18 20:51:41,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (120 of 207 remaining) [2022-11-18 20:51:41,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (119 of 207 remaining) [2022-11-18 20:51:41,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (118 of 207 remaining) [2022-11-18 20:51:41,406 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (117 of 207 remaining) [2022-11-18 20:51:41,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (116 of 207 remaining) [2022-11-18 20:51:41,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (115 of 207 remaining) [2022-11-18 20:51:41,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (114 of 207 remaining) [2022-11-18 20:51:41,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (113 of 207 remaining) [2022-11-18 20:51:41,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (112 of 207 remaining) [2022-11-18 20:51:41,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (111 of 207 remaining) [2022-11-18 20:51:41,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (110 of 207 remaining) [2022-11-18 20:51:41,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (109 of 207 remaining) [2022-11-18 20:51:41,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (108 of 207 remaining) [2022-11-18 20:51:41,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (107 of 207 remaining) [2022-11-18 20:51:41,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (106 of 207 remaining) [2022-11-18 20:51:41,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (105 of 207 remaining) [2022-11-18 20:51:41,409 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (104 of 207 remaining) [2022-11-18 20:51:41,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (103 of 207 remaining) [2022-11-18 20:51:41,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (102 of 207 remaining) [2022-11-18 20:51:41,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (101 of 207 remaining) [2022-11-18 20:51:41,410 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (100 of 207 remaining) [2022-11-18 20:51:41,411 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (99 of 207 remaining) [2022-11-18 20:51:41,411 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (98 of 207 remaining) [2022-11-18 20:51:41,411 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (97 of 207 remaining) [2022-11-18 20:51:41,411 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (96 of 207 remaining) [2022-11-18 20:51:41,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (95 of 207 remaining) [2022-11-18 20:51:41,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (94 of 207 remaining) [2022-11-18 20:51:41,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (93 of 207 remaining) [2022-11-18 20:51:41,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (92 of 207 remaining) [2022-11-18 20:51:41,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (91 of 207 remaining) [2022-11-18 20:51:41,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 207 remaining) [2022-11-18 20:51:41,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (89 of 207 remaining) [2022-11-18 20:51:41,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (88 of 207 remaining) [2022-11-18 20:51:41,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (87 of 207 remaining) [2022-11-18 20:51:41,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (86 of 207 remaining) [2022-11-18 20:51:41,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (85 of 207 remaining) [2022-11-18 20:51:41,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (84 of 207 remaining) [2022-11-18 20:51:41,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (83 of 207 remaining) [2022-11-18 20:51:41,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (82 of 207 remaining) [2022-11-18 20:51:41,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (81 of 207 remaining) [2022-11-18 20:51:41,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (80 of 207 remaining) [2022-11-18 20:51:41,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (79 of 207 remaining) [2022-11-18 20:51:41,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (78 of 207 remaining) [2022-11-18 20:51:41,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (77 of 207 remaining) [2022-11-18 20:51:41,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (76 of 207 remaining) [2022-11-18 20:51:41,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (75 of 207 remaining) [2022-11-18 20:51:41,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (74 of 207 remaining) [2022-11-18 20:51:41,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (73 of 207 remaining) [2022-11-18 20:51:41,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (72 of 207 remaining) [2022-11-18 20:51:41,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (71 of 207 remaining) [2022-11-18 20:51:41,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (70 of 207 remaining) [2022-11-18 20:51:41,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (69 of 207 remaining) [2022-11-18 20:51:41,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (68 of 207 remaining) [2022-11-18 20:51:41,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (67 of 207 remaining) [2022-11-18 20:51:41,418 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (66 of 207 remaining) [2022-11-18 20:51:41,419 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (65 of 207 remaining) [2022-11-18 20:51:41,419 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (64 of 207 remaining) [2022-11-18 20:51:41,419 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (63 of 207 remaining) [2022-11-18 20:51:41,419 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (62 of 207 remaining) [2022-11-18 20:51:41,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (61 of 207 remaining) [2022-11-18 20:51:41,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (60 of 207 remaining) [2022-11-18 20:51:41,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (59 of 207 remaining) [2022-11-18 20:51:41,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (58 of 207 remaining) [2022-11-18 20:51:41,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (57 of 207 remaining) [2022-11-18 20:51:41,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (56 of 207 remaining) [2022-11-18 20:51:41,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (55 of 207 remaining) [2022-11-18 20:51:41,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (54 of 207 remaining) [2022-11-18 20:51:41,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (53 of 207 remaining) [2022-11-18 20:51:41,422 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (52 of 207 remaining) [2022-11-18 20:51:41,422 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (51 of 207 remaining) [2022-11-18 20:51:41,422 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (50 of 207 remaining) [2022-11-18 20:51:41,422 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (49 of 207 remaining) [2022-11-18 20:51:41,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (48 of 207 remaining) [2022-11-18 20:51:41,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (47 of 207 remaining) [2022-11-18 20:51:41,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (46 of 207 remaining) [2022-11-18 20:51:41,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (45 of 207 remaining) [2022-11-18 20:51:41,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (44 of 207 remaining) [2022-11-18 20:51:41,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 207 remaining) [2022-11-18 20:51:41,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 207 remaining) [2022-11-18 20:51:41,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 207 remaining) [2022-11-18 20:51:41,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 207 remaining) [2022-11-18 20:51:41,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 207 remaining) [2022-11-18 20:51:41,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (38 of 207 remaining) [2022-11-18 20:51:41,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (37 of 207 remaining) [2022-11-18 20:51:41,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (36 of 207 remaining) [2022-11-18 20:51:41,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (35 of 207 remaining) [2022-11-18 20:51:41,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (34 of 207 remaining) [2022-11-18 20:51:41,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (33 of 207 remaining) [2022-11-18 20:51:41,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (32 of 207 remaining) [2022-11-18 20:51:41,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (31 of 207 remaining) [2022-11-18 20:51:41,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (30 of 207 remaining) [2022-11-18 20:51:41,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (29 of 207 remaining) [2022-11-18 20:51:41,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (28 of 207 remaining) [2022-11-18 20:51:41,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (27 of 207 remaining) [2022-11-18 20:51:41,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (26 of 207 remaining) [2022-11-18 20:51:41,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (25 of 207 remaining) [2022-11-18 20:51:41,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (24 of 207 remaining) [2022-11-18 20:51:41,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (23 of 207 remaining) [2022-11-18 20:51:41,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (22 of 207 remaining) [2022-11-18 20:51:41,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (21 of 207 remaining) [2022-11-18 20:51:41,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (20 of 207 remaining) [2022-11-18 20:51:41,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (19 of 207 remaining) [2022-11-18 20:51:41,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (18 of 207 remaining) [2022-11-18 20:51:41,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (17 of 207 remaining) [2022-11-18 20:51:41,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (16 of 207 remaining) [2022-11-18 20:51:41,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (15 of 207 remaining) [2022-11-18 20:51:41,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (14 of 207 remaining) [2022-11-18 20:51:41,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (13 of 207 remaining) [2022-11-18 20:51:41,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (12 of 207 remaining) [2022-11-18 20:51:41,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (11 of 207 remaining) [2022-11-18 20:51:41,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (10 of 207 remaining) [2022-11-18 20:51:41,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (9 of 207 remaining) [2022-11-18 20:51:41,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (8 of 207 remaining) [2022-11-18 20:51:41,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (7 of 207 remaining) [2022-11-18 20:51:41,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (6 of 207 remaining) [2022-11-18 20:51:41,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (5 of 207 remaining) [2022-11-18 20:51:41,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (4 of 207 remaining) [2022-11-18 20:51:41,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (3 of 207 remaining) [2022-11-18 20:51:41,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (2 of 207 remaining) [2022-11-18 20:51:41,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (1 of 207 remaining) [2022-11-18 20:51:41,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (0 of 207 remaining) [2022-11-18 20:51:41,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-18 20:51:41,435 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:51:41,446 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 20:51:41,446 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:51:41,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:51:41 BasicIcfg [2022-11-18 20:51:41,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:51:41,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:51:41,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:51:41,454 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:51:41,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:51:15" (3/4) ... [2022-11-18 20:51:41,458 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 20:51:41,464 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-18 20:51:41,465 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-18 20:51:41,465 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-18 20:51:41,484 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2022-11-18 20:51:41,485 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-18 20:51:41,485 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-18 20:51:41,486 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:51:41,579 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:51:41,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:51:41,580 INFO L158 Benchmark]: Toolchain (without parser) took 29445.91ms. Allocated memory was 140.5MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 108.3MB in the beginning and 704.1MB in the end (delta: -595.8MB). Peak memory consumption was 471.5MB. Max. memory is 16.1GB. [2022-11-18 20:51:41,580 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 38.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:51:41,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 634.22ms. Allocated memory is still 140.5MB. Free memory was 108.3MB in the beginning and 111.3MB in the end (delta: -3.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:51:41,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.58ms. Allocated memory is still 140.5MB. Free memory was 111.3MB in the beginning and 106.5MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-18 20:51:41,581 INFO L158 Benchmark]: Boogie Preprocessor took 92.83ms. Allocated memory is still 140.5MB. Free memory was 106.5MB in the beginning and 102.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:51:41,582 INFO L158 Benchmark]: RCFGBuilder took 2963.43ms. Allocated memory was 140.5MB in the beginning and 174.1MB in the end (delta: 33.6MB). Free memory was 102.3MB in the beginning and 132.7MB in the end (delta: -30.3MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. [2022-11-18 20:51:41,582 INFO L158 Benchmark]: TraceAbstraction took 25517.79ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 131.6MB in the beginning and 709.4MB in the end (delta: -577.7MB). Peak memory consumption was 456.2MB. Max. memory is 16.1GB. [2022-11-18 20:51:41,583 INFO L158 Benchmark]: Witness Printer took 125.15ms. Allocated memory is still 1.2GB. Free memory was 709.4MB in the beginning and 704.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:51:41,585 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory is still 38.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 634.22ms. Allocated memory is still 140.5MB. Free memory was 108.3MB in the beginning and 111.3MB in the end (delta: -3.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.58ms. Allocated memory is still 140.5MB. Free memory was 111.3MB in the beginning and 106.5MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.83ms. Allocated memory is still 140.5MB. Free memory was 106.5MB in the beginning and 102.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2963.43ms. Allocated memory was 140.5MB in the beginning and 174.1MB in the end (delta: 33.6MB). Free memory was 102.3MB in the beginning and 132.7MB in the end (delta: -30.3MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. * TraceAbstraction took 25517.79ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 131.6MB in the beginning and 709.4MB in the end (delta: -577.7MB). Peak memory consumption was 456.2MB. Max. memory is 16.1GB. * Witness Printer took 125.15ms. Allocated memory is still 1.2GB. Free memory was 709.4MB in the beginning and 704.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 144]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 578 locations, 207 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.1s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1232 IncrementalHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 230 mSDtfsCounter, 1232 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=930occurred in iteration=0, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 3513 NumberOfCodeBlocks, 3513 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3487 ConstructedInterpolants, 0 QuantifiedInterpolants, 3889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 116 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-18 20:51:41,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f50d3ef3-8a12-4e2f-b282-b63c96964b55/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE