./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc --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 d721a74d879c75d156b7dfbd9383140c70ef6831602ea84a0f8988cd7fdc0c32 --- 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-5e519f3 [2022-11-02 20:12:39,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:12:39,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:12:39,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:12:39,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:12:39,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:12:39,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:12:39,264 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:12:39,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:12:39,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:12:39,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:12:39,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:12:39,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:12:39,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:12:39,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:12:39,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:12:39,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:12:39,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:12:39,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:12:39,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:12:39,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:12:39,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:12:39,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:12:39,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:12:39,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:12:39,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:12:39,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:12:39,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:12:39,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:12:39,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:12:39,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:12:39,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:12:39,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:12:39,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:12:39,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:12:39,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:12:39,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:12:39,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:12:39,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:12:39,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:12:39,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:12:39,307 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:12:39,342 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:12:39,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:12:39,344 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:12:39,344 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:12:39,345 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:12:39,345 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:12:39,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:12:39,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:12:39,347 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:12:39,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:12:39,347 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:12:39,348 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:12:39,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:12:39,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:12:39,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:12:39,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:12:39,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:12:39,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:12:39,358 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:12:39,358 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:12:39,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:12:39,359 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:12:39,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:12:39,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:12:39,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:12:39,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:12:39,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:12:39,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:12:39,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:12:39,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:12:39,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:12:39,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:12:39,363 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:12:39,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:12:39,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:12:39,364 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_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc/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_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc 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 -> d721a74d879c75d156b7dfbd9383140c70ef6831602ea84a0f8988cd7fdc0c32 [2022-11-02 20:12:39,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:12:39,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:12:39,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:12:39,753 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:12:39,754 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:12:39,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2022-11-02 20:12:39,849 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc/data/1841c58e8/260757de63b44c46ba5705efe69bf543/FLAG4adc8a12e [2022-11-02 20:12:40,398 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:12:40,399 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2022-11-02 20:12:40,418 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc/data/1841c58e8/260757de63b44c46ba5705efe69bf543/FLAG4adc8a12e [2022-11-02 20:12:40,745 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc/data/1841c58e8/260757de63b44c46ba5705efe69bf543 [2022-11-02 20:12:40,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:12:40,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:12:40,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:12:40,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:12:40,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:12:40,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:12:40" (1/1) ... [2022-11-02 20:12:40,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35cd2a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:40, skipping insertion in model container [2022-11-02 20:12:40,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:12:40" (1/1) ... [2022-11-02 20:12:40,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:12:40,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:12:41,171 WARN L230 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_0217e75a-bb52-42ee-bcf4-3ba29b738b53/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-11-02 20:12:41,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:12:41,203 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:12:41,279 WARN L230 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_0217e75a-bb52-42ee-bcf4-3ba29b738b53/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-11-02 20:12:41,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:12:41,319 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:12:41,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:41 WrapperNode [2022-11-02 20:12:41,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:12:41,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:12:41,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:12:41,321 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:12:41,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:41" (1/1) ... [2022-11-02 20:12:41,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:41" (1/1) ... [2022-11-02 20:12:41,400 INFO L138 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 419 [2022-11-02 20:12:41,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:12:41,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:12:41,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:12:41,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:12:41,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:41" (1/1) ... [2022-11-02 20:12:41,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:41" (1/1) ... [2022-11-02 20:12:41,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:41" (1/1) ... [2022-11-02 20:12:41,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:41" (1/1) ... [2022-11-02 20:12:41,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:41" (1/1) ... [2022-11-02 20:12:41,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:41" (1/1) ... [2022-11-02 20:12:41,482 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:41" (1/1) ... [2022-11-02 20:12:41,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:41" (1/1) ... [2022-11-02 20:12:41,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:12:41,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:12:41,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:12:41,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:12:41,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:41" (1/1) ... [2022-11-02 20:12:41,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:12:41,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:12:41,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:12:41,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:12:41,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:12:41,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:12:41,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:12:41,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:12:41,628 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:12:41,630 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:12:41,630 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:12:41,630 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:12:41,630 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:12:41,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-02 20:12:41,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-02 20:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:12:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:12:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:12:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:12:41,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:12:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:12:41,634 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:12:41,867 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:12:41,870 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:12:42,844 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:12:43,368 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:12:43,368 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:12:43,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:12:43 BoogieIcfgContainer [2022-11-02 20:12:43,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:12:43,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:12:43,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:12:43,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:12:43,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:12:40" (1/3) ... [2022-11-02 20:12:43,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb4a76c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:12:43, skipping insertion in model container [2022-11-02 20:12:43,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:12:41" (2/3) ... [2022-11-02 20:12:43,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb4a76c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:12:43, skipping insertion in model container [2022-11-02 20:12:43,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:12:43" (3/3) ... [2022-11-02 20:12:43,384 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2022-11-02 20:12:43,396 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:12:43,410 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:12:43,410 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2022-11-02 20:12:43,411 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:12:43,604 INFO L144 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2022-11-02 20:12:43,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 341 places, 342 transitions, 728 flow [2022-11-02 20:12:43,944 INFO L130 PetriNetUnfolder]: 14/321 cut-off events. [2022-11-02 20:12:43,944 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:12:43,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 321 events. 14/321 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 524 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 261. Up to 3 conditions per place. [2022-11-02 20:12:43,956 INFO L82 GeneralOperation]: Start removeDead. Operand has 341 places, 342 transitions, 728 flow [2022-11-02 20:12:43,972 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 303 places, 303 transitions, 636 flow [2022-11-02 20:12:43,996 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:12:44,009 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;@53e4e0c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:12:44,009 INFO L358 AbstractCegarLoop]: Starting to check reachability of 112 error locations. [2022-11-02 20:12:44,020 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-11-02 20:12:44,020 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:12:44,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:44,022 INFO L208 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] [2022-11-02 20:12:44,023 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:12:44,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:44,033 INFO L85 PathProgramCache]: Analyzing trace with hash -659159186, now seen corresponding path program 1 times [2022-11-02 20:12:44,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:44,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738872678] [2022-11-02 20:12:44,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:44,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:44,364 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-02 20:12:44,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:44,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738872678] [2022-11-02 20:12:44,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738872678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:44,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:44,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:12:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928705462] [2022-11-02 20:12:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:44,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:12:44,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:44,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:12:44,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:12:44,438 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 344 [2022-11-02 20:12:44,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 303 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:44,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:44,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 344 [2022-11-02 20:12:44,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:44,949 INFO L130 PetriNetUnfolder]: 191/781 cut-off events. [2022-11-02 20:12:44,949 INFO L131 PetriNetUnfolder]: For 144/276 co-relation queries the response was YES. [2022-11-02 20:12:44,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 781 events. 191/781 cut-off events. For 144/276 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3140 event pairs, 111 based on Foata normal form. 63/754 useless extension candidates. Maximal degree in co-relation 973. Up to 295 conditions per place. [2022-11-02 20:12:44,962 INFO L137 encePairwiseOnDemand]: 291/344 looper letters, 30 selfloop transitions, 2 changer transitions 3/252 dead transitions. [2022-11-02 20:12:44,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 252 transitions, 598 flow [2022-11-02 20:12:44,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:12:44,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:12:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2022-11-02 20:12:44,991 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8217054263565892 [2022-11-02 20:12:44,992 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 848 transitions. [2022-11-02 20:12:44,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 848 transitions. [2022-11-02 20:12:44,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:45,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 848 transitions. [2022-11-02 20:12:45,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:45,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:45,023 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:45,025 INFO L175 Difference]: Start difference. First operand has 303 places, 303 transitions, 636 flow. Second operand 3 states and 848 transitions. [2022-11-02 20:12:45,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 252 transitions, 598 flow [2022-11-02 20:12:45,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 252 transitions, 578 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-02 20:12:45,051 INFO L231 Difference]: Finished difference. Result has 253 places, 249 transitions, 512 flow [2022-11-02 20:12:45,054 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=253, PETRI_TRANSITIONS=249} [2022-11-02 20:12:45,059 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -50 predicate places. [2022-11-02 20:12:45,060 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 249 transitions, 512 flow [2022-11-02 20:12:45,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:45,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:45,061 INFO L208 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] [2022-11-02 20:12:45,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:12:45,062 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:12:45,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:45,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1489237360, now seen corresponding path program 1 times [2022-11-02 20:12:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:45,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325556385] [2022-11-02 20:12:45,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:45,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:45,203 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-02 20:12:45,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:45,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325556385] [2022-11-02 20:12:45,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325556385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:45,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:45,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:12:45,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774758052] [2022-11-02 20:12:45,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:45,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:12:45,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:45,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:12:45,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:12:45,209 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 344 [2022-11-02 20:12:45,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 249 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:45,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:45,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 344 [2022-11-02 20:12:45,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:45,516 INFO L130 PetriNetUnfolder]: 191/777 cut-off events. [2022-11-02 20:12:45,517 INFO L131 PetriNetUnfolder]: For 25/157 co-relation queries the response was YES. [2022-11-02 20:12:45,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 777 events. 191/777 cut-off events. For 25/157 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3153 event pairs, 111 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 1078. Up to 292 conditions per place. [2022-11-02 20:12:45,575 INFO L137 encePairwiseOnDemand]: 341/344 looper letters, 27 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2022-11-02 20:12:45,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 248 transitions, 568 flow [2022-11-02 20:12:45,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:12:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:12:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2022-11-02 20:12:45,580 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7790697674418605 [2022-11-02 20:12:45,581 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 804 transitions. [2022-11-02 20:12:45,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 804 transitions. [2022-11-02 20:12:45,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:45,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 804 transitions. [2022-11-02 20:12:45,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:45,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:45,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:45,590 INFO L175 Difference]: Start difference. First operand has 253 places, 249 transitions, 512 flow. Second operand 3 states and 804 transitions. [2022-11-02 20:12:45,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 248 transitions, 568 flow [2022-11-02 20:12:45,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 248 transitions, 564 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:12:45,605 INFO L231 Difference]: Finished difference. Result has 249 places, 248 transitions, 510 flow [2022-11-02 20:12:45,605 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=249, PETRI_TRANSITIONS=248} [2022-11-02 20:12:45,607 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -54 predicate places. [2022-11-02 20:12:45,607 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 248 transitions, 510 flow [2022-11-02 20:12:45,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:45,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:45,608 INFO L208 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] [2022-11-02 20:12:45,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:12:45,609 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:12:45,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:45,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1345399018, now seen corresponding path program 1 times [2022-11-02 20:12:45,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:45,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985783299] [2022-11-02 20:12:45,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:45,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:45,749 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-02 20:12:45,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:45,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985783299] [2022-11-02 20:12:45,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985783299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:45,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:45,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:12:45,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205526300] [2022-11-02 20:12:45,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:45,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:12:45,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:45,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:12:45,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:12:45,757 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 344 [2022-11-02 20:12:45,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 248 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:45,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:45,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 344 [2022-11-02 20:12:45,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:46,093 INFO L130 PetriNetUnfolder]: 191/776 cut-off events. [2022-11-02 20:12:46,093 INFO L131 PetriNetUnfolder]: For 25/157 co-relation queries the response was YES. [2022-11-02 20:12:46,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 776 events. 191/776 cut-off events. For 25/157 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3128 event pairs, 111 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 1067. Up to 289 conditions per place. [2022-11-02 20:12:46,102 INFO L137 encePairwiseOnDemand]: 341/344 looper letters, 24 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2022-11-02 20:12:46,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 247 transitions, 560 flow [2022-11-02 20:12:46,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:12:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:12:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2022-11-02 20:12:46,108 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7848837209302325 [2022-11-02 20:12:46,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 810 transitions. [2022-11-02 20:12:46,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 810 transitions. [2022-11-02 20:12:46,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:46,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 810 transitions. [2022-11-02 20:12:46,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:46,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:46,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:46,135 INFO L175 Difference]: Start difference. First operand has 249 places, 248 transitions, 510 flow. Second operand 3 states and 810 transitions. [2022-11-02 20:12:46,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 247 transitions, 560 flow [2022-11-02 20:12:46,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 247 transitions, 556 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:12:46,143 INFO L231 Difference]: Finished difference. Result has 248 places, 247 transitions, 508 flow [2022-11-02 20:12:46,144 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=248, PETRI_TRANSITIONS=247} [2022-11-02 20:12:46,145 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -55 predicate places. [2022-11-02 20:12:46,146 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 247 transitions, 508 flow [2022-11-02 20:12:46,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:46,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:46,147 INFO L208 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] [2022-11-02 20:12:46,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:12:46,148 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:12:46,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:46,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1642757566, now seen corresponding path program 1 times [2022-11-02 20:12:46,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:46,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647005727] [2022-11-02 20:12:46,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:46,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:46,213 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-02 20:12:46,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:46,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647005727] [2022-11-02 20:12:46,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647005727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:46,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:46,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:12:46,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442395828] [2022-11-02 20:12:46,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:46,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:12:46,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:46,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:12:46,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:12:46,219 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 344 [2022-11-02 20:12:46,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 247 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:46,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:46,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 344 [2022-11-02 20:12:46,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:46,527 INFO L130 PetriNetUnfolder]: 191/775 cut-off events. [2022-11-02 20:12:46,527 INFO L131 PetriNetUnfolder]: For 25/157 co-relation queries the response was YES. [2022-11-02 20:12:46,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 775 events. 191/775 cut-off events. For 25/157 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3143 event pairs, 111 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 1059. Up to 289 conditions per place. [2022-11-02 20:12:46,537 INFO L137 encePairwiseOnDemand]: 341/344 looper letters, 24 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2022-11-02 20:12:46,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 246 transitions, 558 flow [2022-11-02 20:12:46,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:12:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:12:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2022-11-02 20:12:46,542 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7848837209302325 [2022-11-02 20:12:46,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 810 transitions. [2022-11-02 20:12:46,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 810 transitions. [2022-11-02 20:12:46,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:46,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 810 transitions. [2022-11-02 20:12:46,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:46,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:46,551 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:46,552 INFO L175 Difference]: Start difference. First operand has 248 places, 247 transitions, 508 flow. Second operand 3 states and 810 transitions. [2022-11-02 20:12:46,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 246 transitions, 558 flow [2022-11-02 20:12:46,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 246 transitions, 554 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:12:46,560 INFO L231 Difference]: Finished difference. Result has 247 places, 246 transitions, 506 flow [2022-11-02 20:12:46,561 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=247, PETRI_TRANSITIONS=246} [2022-11-02 20:12:46,562 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -56 predicate places. [2022-11-02 20:12:46,562 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 246 transitions, 506 flow [2022-11-02 20:12:46,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:46,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:46,564 INFO L208 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] [2022-11-02 20:12:46,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:12:46,565 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:12:46,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:46,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2047707957, now seen corresponding path program 1 times [2022-11-02 20:12:46,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:46,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312832371] [2022-11-02 20:12:46,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:46,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:46,621 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-02 20:12:46,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:46,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312832371] [2022-11-02 20:12:46,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312832371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:46,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:46,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:12:46,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849591470] [2022-11-02 20:12:46,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:46,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:12:46,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:46,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:12:46,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:12:46,626 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 344 [2022-11-02 20:12:46,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 246 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:46,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:46,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 344 [2022-11-02 20:12:46,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:46,900 INFO L130 PetriNetUnfolder]: 191/774 cut-off events. [2022-11-02 20:12:46,900 INFO L131 PetriNetUnfolder]: For 25/157 co-relation queries the response was YES. [2022-11-02 20:12:46,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 774 events. 191/774 cut-off events. For 25/157 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3154 event pairs, 111 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 1051. Up to 289 conditions per place. [2022-11-02 20:12:46,908 INFO L137 encePairwiseOnDemand]: 341/344 looper letters, 24 selfloop transitions, 2 changer transitions 0/245 dead transitions. [2022-11-02 20:12:46,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 245 transitions, 556 flow [2022-11-02 20:12:46,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:12:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:12:46,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2022-11-02 20:12:46,912 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7848837209302325 [2022-11-02 20:12:46,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 810 transitions. [2022-11-02 20:12:46,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 810 transitions. [2022-11-02 20:12:46,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:46,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 810 transitions. [2022-11-02 20:12:46,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:46,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:46,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:46,920 INFO L175 Difference]: Start difference. First operand has 247 places, 246 transitions, 506 flow. Second operand 3 states and 810 transitions. [2022-11-02 20:12:46,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 245 transitions, 556 flow [2022-11-02 20:12:46,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 245 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:12:46,926 INFO L231 Difference]: Finished difference. Result has 246 places, 245 transitions, 504 flow [2022-11-02 20:12:46,927 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=246, PETRI_TRANSITIONS=245} [2022-11-02 20:12:46,931 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -57 predicate places. [2022-11-02 20:12:46,931 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 245 transitions, 504 flow [2022-11-02 20:12:46,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:46,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:46,933 INFO L208 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] [2022-11-02 20:12:46,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:12:46,933 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:12:46,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:46,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1400863303, now seen corresponding path program 1 times [2022-11-02 20:12:46,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:46,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818054568] [2022-11-02 20:12:46,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:46,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:47,054 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-02 20:12:47,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:47,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818054568] [2022-11-02 20:12:47,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818054568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:47,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:47,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:12:47,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233090028] [2022-11-02 20:12:47,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:47,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:12:47,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:47,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:12:47,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:12:47,059 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 344 [2022-11-02 20:12:47,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 245 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:47,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:47,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 344 [2022-11-02 20:12:47,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:47,326 INFO L130 PetriNetUnfolder]: 191/773 cut-off events. [2022-11-02 20:12:47,326 INFO L131 PetriNetUnfolder]: For 25/157 co-relation queries the response was YES. [2022-11-02 20:12:47,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 773 events. 191/773 cut-off events. For 25/157 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3145 event pairs, 111 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 1045. Up to 291 conditions per place. [2022-11-02 20:12:47,336 INFO L137 encePairwiseOnDemand]: 341/344 looper letters, 26 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2022-11-02 20:12:47,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 244 transitions, 558 flow [2022-11-02 20:12:47,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:12:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:12:47,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2022-11-02 20:12:47,340 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7781007751937985 [2022-11-02 20:12:47,340 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2022-11-02 20:12:47,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2022-11-02 20:12:47,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:47,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2022-11-02 20:12:47,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:47,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:47,348 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:47,348 INFO L175 Difference]: Start difference. First operand has 246 places, 245 transitions, 504 flow. Second operand 3 states and 803 transitions. [2022-11-02 20:12:47,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 244 transitions, 558 flow [2022-11-02 20:12:47,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 244 transitions, 554 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:12:47,354 INFO L231 Difference]: Finished difference. Result has 245 places, 244 transitions, 502 flow [2022-11-02 20:12:47,355 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=245, PETRI_TRANSITIONS=244} [2022-11-02 20:12:47,358 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -58 predicate places. [2022-11-02 20:12:47,359 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 244 transitions, 502 flow [2022-11-02 20:12:47,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:47,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:47,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:47,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:12:47,362 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:12:47,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:47,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1343961844, now seen corresponding path program 1 times [2022-11-02 20:12:47,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:47,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60343174] [2022-11-02 20:12:47,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:47,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:47,452 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-02 20:12:47,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:47,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60343174] [2022-11-02 20:12:47,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60343174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:47,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:47,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:12:47,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832614432] [2022-11-02 20:12:47,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:47,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:12:47,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:47,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:12:47,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:12:47,456 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 344 [2022-11-02 20:12:47,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 244 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:47,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:47,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 344 [2022-11-02 20:12:47,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:47,699 INFO L130 PetriNetUnfolder]: 191/772 cut-off events. [2022-11-02 20:12:47,699 INFO L131 PetriNetUnfolder]: For 25/157 co-relation queries the response was YES. [2022-11-02 20:12:47,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 772 events. 191/772 cut-off events. For 25/157 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3122 event pairs, 111 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 1035. Up to 289 conditions per place. [2022-11-02 20:12:47,709 INFO L137 encePairwiseOnDemand]: 341/344 looper letters, 24 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2022-11-02 20:12:47,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 243 transitions, 552 flow [2022-11-02 20:12:47,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:12:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:12:47,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2022-11-02 20:12:47,712 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7848837209302325 [2022-11-02 20:12:47,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 810 transitions. [2022-11-02 20:12:47,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 810 transitions. [2022-11-02 20:12:47,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:47,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 810 transitions. [2022-11-02 20:12:47,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:47,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:47,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:47,719 INFO L175 Difference]: Start difference. First operand has 245 places, 244 transitions, 502 flow. Second operand 3 states and 810 transitions. [2022-11-02 20:12:47,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 243 transitions, 552 flow [2022-11-02 20:12:47,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 243 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:12:47,726 INFO L231 Difference]: Finished difference. Result has 244 places, 243 transitions, 500 flow [2022-11-02 20:12:47,726 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=244, PETRI_TRANSITIONS=243} [2022-11-02 20:12:47,727 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -59 predicate places. [2022-11-02 20:12:47,727 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 243 transitions, 500 flow [2022-11-02 20:12:47,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:47,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:47,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:47,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:12:47,729 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:12:47,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:47,730 INFO L85 PathProgramCache]: Analyzing trace with hash 380598263, now seen corresponding path program 1 times [2022-11-02 20:12:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:47,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595881062] [2022-11-02 20:12:47,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:47,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:47,780 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-02 20:12:47,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:47,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595881062] [2022-11-02 20:12:47,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595881062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:47,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:47,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:12:47,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119275849] [2022-11-02 20:12:47,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:47,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:12:47,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:47,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:12:47,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:12:47,785 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 344 [2022-11-02 20:12:47,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 243 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:47,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:47,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 344 [2022-11-02 20:12:47,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:47,991 INFO L130 PetriNetUnfolder]: 191/771 cut-off events. [2022-11-02 20:12:47,991 INFO L131 PetriNetUnfolder]: For 25/157 co-relation queries the response was YES. [2022-11-02 20:12:47,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 771 events. 191/771 cut-off events. For 25/157 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3163 event pairs, 111 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 1027. Up to 289 conditions per place. [2022-11-02 20:12:48,000 INFO L137 encePairwiseOnDemand]: 341/344 looper letters, 24 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2022-11-02 20:12:48,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 242 transitions, 550 flow [2022-11-02 20:12:48,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:12:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:12:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2022-11-02 20:12:48,004 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7848837209302325 [2022-11-02 20:12:48,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 810 transitions. [2022-11-02 20:12:48,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 810 transitions. [2022-11-02 20:12:48,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:48,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 810 transitions. [2022-11-02 20:12:48,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:48,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:48,011 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:48,012 INFO L175 Difference]: Start difference. First operand has 244 places, 243 transitions, 500 flow. Second operand 3 states and 810 transitions. [2022-11-02 20:12:48,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 242 transitions, 550 flow [2022-11-02 20:12:48,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 242 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:12:48,018 INFO L231 Difference]: Finished difference. Result has 243 places, 242 transitions, 498 flow [2022-11-02 20:12:48,019 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=243, PETRI_TRANSITIONS=242} [2022-11-02 20:12:48,020 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -60 predicate places. [2022-11-02 20:12:48,020 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 242 transitions, 498 flow [2022-11-02 20:12:48,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:48,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:48,021 INFO L208 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] [2022-11-02 20:12:48,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:12:48,022 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:12:48,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:48,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1008928072, now seen corresponding path program 1 times [2022-11-02 20:12:48,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:48,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526617593] [2022-11-02 20:12:48,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:48,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:48,115 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-02 20:12:48,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:48,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526617593] [2022-11-02 20:12:48,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526617593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:48,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:48,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:12:48,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133515385] [2022-11-02 20:12:48,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:48,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:12:48,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:48,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:12:48,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:12:48,120 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 344 [2022-11-02 20:12:48,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 242 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:48,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:48,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 344 [2022-11-02 20:12:48,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:48,328 INFO L130 PetriNetUnfolder]: 191/769 cut-off events. [2022-11-02 20:12:48,329 INFO L131 PetriNetUnfolder]: For 25/157 co-relation queries the response was YES. [2022-11-02 20:12:48,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 769 events. 191/769 cut-off events. For 25/157 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3149 event pairs, 111 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 1018. Up to 289 conditions per place. [2022-11-02 20:12:48,340 INFO L137 encePairwiseOnDemand]: 341/344 looper letters, 26 selfloop transitions, 1 changer transitions 0/240 dead transitions. [2022-11-02 20:12:48,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 240 transitions, 548 flow [2022-11-02 20:12:48,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:12:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:12:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2022-11-02 20:12:48,344 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7781007751937985 [2022-11-02 20:12:48,344 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2022-11-02 20:12:48,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2022-11-02 20:12:48,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:48,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2022-11-02 20:12:48,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:48,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:48,352 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:48,352 INFO L175 Difference]: Start difference. First operand has 243 places, 242 transitions, 498 flow. Second operand 3 states and 803 transitions. [2022-11-02 20:12:48,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 240 transitions, 548 flow [2022-11-02 20:12:48,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 240 transitions, 544 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:12:48,359 INFO L231 Difference]: Finished difference. Result has 241 places, 240 transitions, 492 flow [2022-11-02 20:12:48,360 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=241, PETRI_TRANSITIONS=240} [2022-11-02 20:12:48,361 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -62 predicate places. [2022-11-02 20:12:48,362 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 240 transitions, 492 flow [2022-11-02 20:12:48,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:48,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:48,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:48,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:12:48,363 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:12:48,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:48,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1334570147, now seen corresponding path program 1 times [2022-11-02 20:12:48,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:48,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744846613] [2022-11-02 20:12:48,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:48,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:48,487 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-02 20:12:48,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:48,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744846613] [2022-11-02 20:12:48,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744846613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:48,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:48,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:12:48,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714086344] [2022-11-02 20:12:48,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:48,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:12:48,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:48,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:12:48,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:12:48,499 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 344 [2022-11-02 20:12:48,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 240 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:48,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:48,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 344 [2022-11-02 20:12:48,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:48,716 INFO L130 PetriNetUnfolder]: 191/768 cut-off events. [2022-11-02 20:12:48,717 INFO L131 PetriNetUnfolder]: For 25/157 co-relation queries the response was YES. [2022-11-02 20:12:48,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 768 events. 191/768 cut-off events. For 25/157 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3115 event pairs, 111 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 1016. Up to 289 conditions per place. [2022-11-02 20:12:48,725 INFO L137 encePairwiseOnDemand]: 341/344 looper letters, 24 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2022-11-02 20:12:48,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 239 transitions, 542 flow [2022-11-02 20:12:48,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:12:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:12:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2022-11-02 20:12:48,729 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7848837209302325 [2022-11-02 20:12:48,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 810 transitions. [2022-11-02 20:12:48,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 810 transitions. [2022-11-02 20:12:48,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:48,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 810 transitions. [2022-11-02 20:12:48,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:48,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:48,737 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:48,738 INFO L175 Difference]: Start difference. First operand has 241 places, 240 transitions, 492 flow. Second operand 3 states and 810 transitions. [2022-11-02 20:12:48,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 239 transitions, 542 flow [2022-11-02 20:12:48,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 239 transitions, 541 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:12:48,745 INFO L231 Difference]: Finished difference. Result has 241 places, 239 transitions, 493 flow [2022-11-02 20:12:48,747 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=241, PETRI_TRANSITIONS=239} [2022-11-02 20:12:48,748 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -62 predicate places. [2022-11-02 20:12:48,748 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 239 transitions, 493 flow [2022-11-02 20:12:48,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:48,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:48,749 INFO L208 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] [2022-11-02 20:12:48,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:12:48,750 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:12:48,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:48,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1214721743, now seen corresponding path program 1 times [2022-11-02 20:12:48,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:48,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777208182] [2022-11-02 20:12:48,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:48,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:49,553 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-02 20:12:49,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:49,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777208182] [2022-11-02 20:12:49,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777208182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:49,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:49,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:12:49,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745804185] [2022-11-02 20:12:49,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:49,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:12:49,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:49,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:12:49,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:12:49,560 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 344 [2022-11-02 20:12:49,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 239 transitions, 493 flow. Second operand has 6 states, 6 states have (on average 221.83333333333334) internal successors, (1331), 6 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:49,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:49,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 344 [2022-11-02 20:12:49,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:53,804 INFO L130 PetriNetUnfolder]: 9005/12604 cut-off events. [2022-11-02 20:12:53,805 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:12:53,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24476 conditions, 12604 events. 9005/12604 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 69520 event pairs, 6801 based on Foata normal form. 0/11649 useless extension candidates. Maximal degree in co-relation 24392. Up to 11655 conditions per place. [2022-11-02 20:12:53,937 INFO L137 encePairwiseOnDemand]: 338/344 looper letters, 56 selfloop transitions, 5 changer transitions 0/238 dead transitions. [2022-11-02 20:12:53,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 238 transitions, 613 flow [2022-11-02 20:12:53,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:12:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:12:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1382 transitions. [2022-11-02 20:12:53,942 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6695736434108527 [2022-11-02 20:12:53,943 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1382 transitions. [2022-11-02 20:12:53,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1382 transitions. [2022-11-02 20:12:53,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:53,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1382 transitions. [2022-11-02 20:12:53,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 230.33333333333334) internal successors, (1382), 6 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:53,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:53,954 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:53,954 INFO L175 Difference]: Start difference. First operand has 241 places, 239 transitions, 493 flow. Second operand 6 states and 1382 transitions. [2022-11-02 20:12:53,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 238 transitions, 613 flow [2022-11-02 20:12:53,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 238 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:12:53,962 INFO L231 Difference]: Finished difference. Result has 243 places, 238 transitions, 497 flow [2022-11-02 20:12:53,963 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=497, PETRI_PLACES=243, PETRI_TRANSITIONS=238} [2022-11-02 20:12:53,964 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -60 predicate places. [2022-11-02 20:12:53,964 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 238 transitions, 497 flow [2022-11-02 20:12:53,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 221.83333333333334) internal successors, (1331), 6 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:53,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:53,966 INFO L208 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] [2022-11-02 20:12:53,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:12:53,966 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:12:53,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:53,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1140007191, now seen corresponding path program 1 times [2022-11-02 20:12:53,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:53,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414214877] [2022-11-02 20:12:53,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:53,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:54,669 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-02 20:12:54,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:54,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414214877] [2022-11-02 20:12:54,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414214877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:54,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:54,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:12:54,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839414133] [2022-11-02 20:12:54,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:54,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:12:54,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:54,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:12:54,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:12:54,675 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 344 [2022-11-02 20:12:54,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 238 transitions, 497 flow. Second operand has 6 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:54,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:54,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 344 [2022-11-02 20:12:54,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:12:58,563 INFO L130 PetriNetUnfolder]: 9005/12223 cut-off events. [2022-11-02 20:12:58,564 INFO L131 PetriNetUnfolder]: For 85/105 co-relation queries the response was YES. [2022-11-02 20:12:58,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24090 conditions, 12223 events. 9005/12223 cut-off events. For 85/105 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 67291 event pairs, 1810 based on Foata normal form. 16/11680 useless extension candidates. Maximal degree in co-relation 24067. Up to 3377 conditions per place. [2022-11-02 20:12:58,679 INFO L137 encePairwiseOnDemand]: 339/344 looper letters, 165 selfloop transitions, 4 changer transitions 0/353 dead transitions. [2022-11-02 20:12:58,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 353 transitions, 1089 flow [2022-11-02 20:12:58,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:12:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:12:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1520 transitions. [2022-11-02 20:12:58,685 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7364341085271318 [2022-11-02 20:12:58,686 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1520 transitions. [2022-11-02 20:12:58,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1520 transitions. [2022-11-02 20:12:58,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:12:58,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1520 transitions. [2022-11-02 20:12:58,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:58,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:58,710 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:58,720 INFO L175 Difference]: Start difference. First operand has 243 places, 238 transitions, 497 flow. Second operand 6 states and 1520 transitions. [2022-11-02 20:12:58,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 353 transitions, 1089 flow [2022-11-02 20:12:58,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 353 transitions, 1079 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:12:58,728 INFO L231 Difference]: Finished difference. Result has 242 places, 237 transitions, 493 flow [2022-11-02 20:12:58,729 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=493, PETRI_PLACES=242, PETRI_TRANSITIONS=237} [2022-11-02 20:12:58,730 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -61 predicate places. [2022-11-02 20:12:58,732 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 237 transitions, 493 flow [2022-11-02 20:12:58,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:58,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:12:58,736 INFO L208 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] [2022-11-02 20:12:58,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:12:58,736 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:12:58,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:58,737 INFO L85 PathProgramCache]: Analyzing trace with hash 841345677, now seen corresponding path program 1 times [2022-11-02 20:12:58,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:58,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178425716] [2022-11-02 20:12:58,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:58,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:59,533 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-02 20:12:59,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:59,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178425716] [2022-11-02 20:12:59,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178425716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:12:59,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:12:59,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:12:59,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380577044] [2022-11-02 20:12:59,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:12:59,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:12:59,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:59,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:12:59,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:12:59,544 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 344 [2022-11-02 20:12:59,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 237 transitions, 493 flow. Second operand has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:12:59,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:12:59,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 344 [2022-11-02 20:12:59,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:13:02,339 INFO L130 PetriNetUnfolder]: 7885/10967 cut-off events. [2022-11-02 20:13:02,340 INFO L131 PetriNetUnfolder]: For 1355/1355 co-relation queries the response was YES. [2022-11-02 20:13:02,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22938 conditions, 10967 events. 7885/10967 cut-off events. For 1355/1355 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 57054 event pairs, 1461 based on Foata normal form. 0/10672 useless extension candidates. Maximal degree in co-relation 22854. Up to 4395 conditions per place. [2022-11-02 20:13:02,429 INFO L137 encePairwiseOnDemand]: 338/344 looper letters, 112 selfloop transitions, 5 changer transitions 0/300 dead transitions. [2022-11-02 20:13:02,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 300 transitions, 889 flow [2022-11-02 20:13:02,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:13:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:13:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1474 transitions. [2022-11-02 20:13:02,436 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7141472868217055 [2022-11-02 20:13:02,437 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1474 transitions. [2022-11-02 20:13:02,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1474 transitions. [2022-11-02 20:13:02,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:13:02,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1474 transitions. [2022-11-02 20:13:02,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 245.66666666666666) internal successors, (1474), 6 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:02,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:02,448 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:02,449 INFO L175 Difference]: Start difference. First operand has 242 places, 237 transitions, 493 flow. Second operand 6 states and 1474 transitions. [2022-11-02 20:13:02,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 300 transitions, 889 flow [2022-11-02 20:13:02,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 300 transitions, 854 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:13:02,459 INFO L231 Difference]: Finished difference. Result has 242 places, 236 transitions, 494 flow [2022-11-02 20:13:02,460 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=494, PETRI_PLACES=242, PETRI_TRANSITIONS=236} [2022-11-02 20:13:02,462 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -61 predicate places. [2022-11-02 20:13:02,462 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 236 transitions, 494 flow [2022-11-02 20:13:02,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:02,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:13:02,463 INFO L208 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] [2022-11-02 20:13:02,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:13:02,464 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:13:02,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:13:02,464 INFO L85 PathProgramCache]: Analyzing trace with hash 135967808, now seen corresponding path program 1 times [2022-11-02 20:13:02,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:13:02,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614828190] [2022-11-02 20:13:02,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:13:02,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:13:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:13:03,099 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-02 20:13:03,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:13:03,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614828190] [2022-11-02 20:13:03,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614828190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:13:03,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:13:03,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:13:03,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390747627] [2022-11-02 20:13:03,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:13:03,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:13:03,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:13:03,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:13:03,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:13:03,104 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 344 [2022-11-02 20:13:03,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 236 transitions, 494 flow. Second operand has 6 states, 6 states have (on average 229.16666666666666) internal successors, (1375), 6 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:03,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:13:03,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 344 [2022-11-02 20:13:03,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:13:05,864 INFO L130 PetriNetUnfolder]: 7195/10508 cut-off events. [2022-11-02 20:13:05,864 INFO L131 PetriNetUnfolder]: For 403/403 co-relation queries the response was YES. [2022-11-02 20:13:05,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21376 conditions, 10508 events. 7195/10508 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 59563 event pairs, 4527 based on Foata normal form. 0/10099 useless extension candidates. Maximal degree in co-relation 21292. Up to 7814 conditions per place. [2022-11-02 20:13:05,944 INFO L137 encePairwiseOnDemand]: 338/344 looper letters, 99 selfloop transitions, 5 changer transitions 0/287 dead transitions. [2022-11-02 20:13:05,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 287 transitions, 812 flow [2022-11-02 20:13:05,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:13:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:13:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1461 transitions. [2022-11-02 20:13:05,950 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7078488372093024 [2022-11-02 20:13:05,950 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1461 transitions. [2022-11-02 20:13:05,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1461 transitions. [2022-11-02 20:13:05,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:13:05,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1461 transitions. [2022-11-02 20:13:05,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:05,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:05,961 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:05,962 INFO L175 Difference]: Start difference. First operand has 242 places, 236 transitions, 494 flow. Second operand 6 states and 1461 transitions. [2022-11-02 20:13:05,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 287 transitions, 812 flow [2022-11-02 20:13:05,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 287 transitions, 802 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:13:05,977 INFO L231 Difference]: Finished difference. Result has 241 places, 235 transitions, 492 flow [2022-11-02 20:13:05,977 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=492, PETRI_PLACES=241, PETRI_TRANSITIONS=235} [2022-11-02 20:13:05,978 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -62 predicate places. [2022-11-02 20:13:05,978 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 235 transitions, 492 flow [2022-11-02 20:13:05,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 229.16666666666666) internal successors, (1375), 6 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:05,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:13:05,980 INFO L208 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] [2022-11-02 20:13:05,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:13:05,980 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:13:05,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:13:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash 870549237, now seen corresponding path program 1 times [2022-11-02 20:13:05,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:13:05,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461803296] [2022-11-02 20:13:05,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:13:05,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:13:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:13:06,908 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-02 20:13:06,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:13:06,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461803296] [2022-11-02 20:13:06,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461803296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:13:06,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:13:06,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:13:06,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926776605] [2022-11-02 20:13:06,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:13:06,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:13:06,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:13:06,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:13:06,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:13:06,913 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 344 [2022-11-02 20:13:06,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 235 transitions, 492 flow. Second operand has 6 states, 6 states have (on average 230.66666666666666) internal successors, (1384), 6 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:06,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:13:06,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 344 [2022-11-02 20:13:06,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:13:09,137 INFO L130 PetriNetUnfolder]: 6842/9806 cut-off events. [2022-11-02 20:13:09,137 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2022-11-02 20:13:09,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19548 conditions, 9806 events. 6842/9806 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 53370 event pairs, 5129 based on Foata normal form. 0/9609 useless extension candidates. Maximal degree in co-relation 19462. Up to 8865 conditions per place. [2022-11-02 20:13:09,217 INFO L137 encePairwiseOnDemand]: 339/344 looper letters, 62 selfloop transitions, 4 changer transitions 0/250 dead transitions. [2022-11-02 20:13:09,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 250 transitions, 654 flow [2022-11-02 20:13:09,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:13:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:13:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1417 transitions. [2022-11-02 20:13:09,222 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.686531007751938 [2022-11-02 20:13:09,222 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1417 transitions. [2022-11-02 20:13:09,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1417 transitions. [2022-11-02 20:13:09,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:13:09,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1417 transitions. [2022-11-02 20:13:09,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 236.16666666666666) internal successors, (1417), 6 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:09,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:09,233 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:09,233 INFO L175 Difference]: Start difference. First operand has 241 places, 235 transitions, 492 flow. Second operand 6 states and 1417 transitions. [2022-11-02 20:13:09,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 250 transitions, 654 flow [2022-11-02 20:13:09,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 250 transitions, 644 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:13:09,245 INFO L231 Difference]: Finished difference. Result has 240 places, 234 transitions, 488 flow [2022-11-02 20:13:09,246 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=240, PETRI_TRANSITIONS=234} [2022-11-02 20:13:09,247 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -63 predicate places. [2022-11-02 20:13:09,247 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 234 transitions, 488 flow [2022-11-02 20:13:09,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 230.66666666666666) internal successors, (1384), 6 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:09,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:13:09,248 INFO L208 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] [2022-11-02 20:13:09,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:13:09,249 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:13:09,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:13:09,249 INFO L85 PathProgramCache]: Analyzing trace with hash 289400354, now seen corresponding path program 1 times [2022-11-02 20:13:09,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:13:09,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177725883] [2022-11-02 20:13:09,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:13:09,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:13:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:13:09,559 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-02 20:13:09,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:13:09,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177725883] [2022-11-02 20:13:09,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177725883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:13:09,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:13:09,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:13:09,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164659786] [2022-11-02 20:13:09,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:13:09,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:13:09,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:13:09,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:13:09,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:13:09,562 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 344 [2022-11-02 20:13:09,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 234 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:09,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:13:09,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 344 [2022-11-02 20:13:09,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:13:09,748 INFO L130 PetriNetUnfolder]: 191/744 cut-off events. [2022-11-02 20:13:09,748 INFO L131 PetriNetUnfolder]: For 25/157 co-relation queries the response was YES. [2022-11-02 20:13:09,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 744 events. 191/744 cut-off events. For 25/157 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2961 event pairs, 111 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 1045. Up to 288 conditions per place. [2022-11-02 20:13:09,754 INFO L137 encePairwiseOnDemand]: 342/344 looper letters, 24 selfloop transitions, 1 changer transitions 0/233 dead transitions. [2022-11-02 20:13:09,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 233 transitions, 536 flow [2022-11-02 20:13:09,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:13:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:13:09,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 809 transitions. [2022-11-02 20:13:09,758 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7839147286821705 [2022-11-02 20:13:09,758 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 809 transitions. [2022-11-02 20:13:09,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 809 transitions. [2022-11-02 20:13:09,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:13:09,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 809 transitions. [2022-11-02 20:13:09,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.6666666666667) internal successors, (809), 3 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:09,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:09,764 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:09,766 INFO L175 Difference]: Start difference. First operand has 240 places, 234 transitions, 488 flow. Second operand 3 states and 809 transitions. [2022-11-02 20:13:09,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 233 transitions, 536 flow [2022-11-02 20:13:09,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 233 transitions, 529 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:13:09,772 INFO L231 Difference]: Finished difference. Result has 237 places, 233 transitions, 481 flow [2022-11-02 20:13:09,772 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=481, PETRI_PLACES=237, PETRI_TRANSITIONS=233} [2022-11-02 20:13:09,773 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -66 predicate places. [2022-11-02 20:13:09,776 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 233 transitions, 481 flow [2022-11-02 20:13:09,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:09,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:13:09,777 INFO L208 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] [2022-11-02 20:13:09,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:13:09,777 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-11-02 20:13:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:13:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2113240847, now seen corresponding path program 1 times [2022-11-02 20:13:09,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:13:09,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098822373] [2022-11-02 20:13:09,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:13:09,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:13:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:13:09,899 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-02 20:13:09,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:13:09,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098822373] [2022-11-02 20:13:09,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098822373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:13:09,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:13:09,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:13:09,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265012682] [2022-11-02 20:13:09,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:13:09,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:13:09,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:13:09,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:13:09,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:13:09,903 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 344 [2022-11-02 20:13:09,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 233 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:09,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:13:09,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 344 [2022-11-02 20:13:09,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:13:10,082 INFO L130 PetriNetUnfolder]: 191/743 cut-off events. [2022-11-02 20:13:10,085 INFO L131 PetriNetUnfolder]: For 25/157 co-relation queries the response was YES. [2022-11-02 20:13:10,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 743 events. 191/743 cut-off events. For 25/157 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2977 event pairs, 111 based on Foata normal form. 1/691 useless extension candidates. Maximal degree in co-relation 1072. Up to 288 conditions per place. [2022-11-02 20:13:10,089 INFO L137 encePairwiseOnDemand]: 342/344 looper letters, 0 selfloop transitions, 0 changer transitions 232/232 dead transitions. [2022-11-02 20:13:10,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 232 transitions, 527 flow [2022-11-02 20:13:10,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:13:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:13:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 808 transitions. [2022-11-02 20:13:10,093 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7829457364341085 [2022-11-02 20:13:10,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 808 transitions. [2022-11-02 20:13:10,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 808 transitions. [2022-11-02 20:13:10,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:13:10,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 808 transitions. [2022-11-02 20:13:10,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:10,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:10,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:10,100 INFO L175 Difference]: Start difference. First operand has 237 places, 233 transitions, 481 flow. Second operand 3 states and 808 transitions. [2022-11-02 20:13:10,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 232 transitions, 527 flow [2022-11-02 20:13:10,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 232 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:13:10,104 INFO L231 Difference]: Finished difference. Result has 237 places, 0 transitions, 0 flow [2022-11-02 20:13:10,105 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=237, PETRI_TRANSITIONS=0} [2022-11-02 20:13:10,106 INFO L287 CegarLoopForPetriNet]: 303 programPoint places, -66 predicate places. [2022-11-02 20:13:10,106 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 0 transitions, 0 flow [2022-11-02 20:13:10,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:13:10,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (111 of 112 remaining) [2022-11-02 20:13:10,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (110 of 112 remaining) [2022-11-02 20:13:10,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (109 of 112 remaining) [2022-11-02 20:13:10,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (108 of 112 remaining) [2022-11-02 20:13:10,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (107 of 112 remaining) [2022-11-02 20:13:10,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (106 of 112 remaining) [2022-11-02 20:13:10,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (105 of 112 remaining) [2022-11-02 20:13:10,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (104 of 112 remaining) [2022-11-02 20:13:10,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (103 of 112 remaining) [2022-11-02 20:13:10,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (102 of 112 remaining) [2022-11-02 20:13:10,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (101 of 112 remaining) [2022-11-02 20:13:10,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (100 of 112 remaining) [2022-11-02 20:13:10,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (99 of 112 remaining) [2022-11-02 20:13:10,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (98 of 112 remaining) [2022-11-02 20:13:10,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (97 of 112 remaining) [2022-11-02 20:13:10,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (96 of 112 remaining) [2022-11-02 20:13:10,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (95 of 112 remaining) [2022-11-02 20:13:10,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (94 of 112 remaining) [2022-11-02 20:13:10,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (93 of 112 remaining) [2022-11-02 20:13:10,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (92 of 112 remaining) [2022-11-02 20:13:10,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (91 of 112 remaining) [2022-11-02 20:13:10,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (90 of 112 remaining) [2022-11-02 20:13:10,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (89 of 112 remaining) [2022-11-02 20:13:10,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (88 of 112 remaining) [2022-11-02 20:13:10,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (87 of 112 remaining) [2022-11-02 20:13:10,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (86 of 112 remaining) [2022-11-02 20:13:10,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (85 of 112 remaining) [2022-11-02 20:13:10,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (84 of 112 remaining) [2022-11-02 20:13:10,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (83 of 112 remaining) [2022-11-02 20:13:10,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (82 of 112 remaining) [2022-11-02 20:13:10,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (81 of 112 remaining) [2022-11-02 20:13:10,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (80 of 112 remaining) [2022-11-02 20:13:10,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (79 of 112 remaining) [2022-11-02 20:13:10,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (78 of 112 remaining) [2022-11-02 20:13:10,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (77 of 112 remaining) [2022-11-02 20:13:10,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (76 of 112 remaining) [2022-11-02 20:13:10,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (75 of 112 remaining) [2022-11-02 20:13:10,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (74 of 112 remaining) [2022-11-02 20:13:10,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (73 of 112 remaining) [2022-11-02 20:13:10,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (72 of 112 remaining) [2022-11-02 20:13:10,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (71 of 112 remaining) [2022-11-02 20:13:10,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (70 of 112 remaining) [2022-11-02 20:13:10,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (69 of 112 remaining) [2022-11-02 20:13:10,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (68 of 112 remaining) [2022-11-02 20:13:10,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (67 of 112 remaining) [2022-11-02 20:13:10,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (66 of 112 remaining) [2022-11-02 20:13:10,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (65 of 112 remaining) [2022-11-02 20:13:10,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (64 of 112 remaining) [2022-11-02 20:13:10,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (63 of 112 remaining) [2022-11-02 20:13:10,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (62 of 112 remaining) [2022-11-02 20:13:10,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (61 of 112 remaining) [2022-11-02 20:13:10,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (60 of 112 remaining) [2022-11-02 20:13:10,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (59 of 112 remaining) [2022-11-02 20:13:10,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (58 of 112 remaining) [2022-11-02 20:13:10,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (57 of 112 remaining) [2022-11-02 20:13:10,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (56 of 112 remaining) [2022-11-02 20:13:10,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (55 of 112 remaining) [2022-11-02 20:13:10,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (54 of 112 remaining) [2022-11-02 20:13:10,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (53 of 112 remaining) [2022-11-02 20:13:10,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (52 of 112 remaining) [2022-11-02 20:13:10,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (51 of 112 remaining) [2022-11-02 20:13:10,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (50 of 112 remaining) [2022-11-02 20:13:10,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (49 of 112 remaining) [2022-11-02 20:13:10,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (48 of 112 remaining) [2022-11-02 20:13:10,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (47 of 112 remaining) [2022-11-02 20:13:10,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (46 of 112 remaining) [2022-11-02 20:13:10,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (45 of 112 remaining) [2022-11-02 20:13:10,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (44 of 112 remaining) [2022-11-02 20:13:10,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (43 of 112 remaining) [2022-11-02 20:13:10,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork2Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 112 remaining) [2022-11-02 20:13:10,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork2Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 112 remaining) [2022-11-02 20:13:10,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (40 of 112 remaining) [2022-11-02 20:13:10,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (39 of 112 remaining) [2022-11-02 20:13:10,127 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (38 of 112 remaining) [2022-11-02 20:13:10,127 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 112 remaining) [2022-11-02 20:13:10,127 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 112 remaining) [2022-11-02 20:13:10,127 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (35 of 112 remaining) [2022-11-02 20:13:10,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (34 of 112 remaining) [2022-11-02 20:13:10,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (33 of 112 remaining) [2022-11-02 20:13:10,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 112 remaining) [2022-11-02 20:13:10,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (31 of 112 remaining) [2022-11-02 20:13:10,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (30 of 112 remaining) [2022-11-02 20:13:10,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (29 of 112 remaining) [2022-11-02 20:13:10,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (28 of 112 remaining) [2022-11-02 20:13:10,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (27 of 112 remaining) [2022-11-02 20:13:10,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (26 of 112 remaining) [2022-11-02 20:13:10,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (25 of 112 remaining) [2022-11-02 20:13:10,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (24 of 112 remaining) [2022-11-02 20:13:10,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (23 of 112 remaining) [2022-11-02 20:13:10,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (22 of 112 remaining) [2022-11-02 20:13:10,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (21 of 112 remaining) [2022-11-02 20:13:10,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (20 of 112 remaining) [2022-11-02 20:13:10,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (19 of 112 remaining) [2022-11-02 20:13:10,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (18 of 112 remaining) [2022-11-02 20:13:10,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (17 of 112 remaining) [2022-11-02 20:13:10,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (16 of 112 remaining) [2022-11-02 20:13:10,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (15 of 112 remaining) [2022-11-02 20:13:10,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (14 of 112 remaining) [2022-11-02 20:13:10,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (13 of 112 remaining) [2022-11-02 20:13:10,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (12 of 112 remaining) [2022-11-02 20:13:10,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (11 of 112 remaining) [2022-11-02 20:13:10,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (10 of 112 remaining) [2022-11-02 20:13:10,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (9 of 112 remaining) [2022-11-02 20:13:10,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (8 of 112 remaining) [2022-11-02 20:13:10,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (7 of 112 remaining) [2022-11-02 20:13:10,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 112 remaining) [2022-11-02 20:13:10,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (5 of 112 remaining) [2022-11-02 20:13:10,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (4 of 112 remaining) [2022-11-02 20:13:10,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (3 of 112 remaining) [2022-11-02 20:13:10,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (2 of 112 remaining) [2022-11-02 20:13:10,135 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (1 of 112 remaining) [2022-11-02 20:13:10,135 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (0 of 112 remaining) [2022-11-02 20:13:10,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:13:10,135 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:13:10,145 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:13:10,145 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:13:10,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:13:10 BasicIcfg [2022-11-02 20:13:10,153 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:13:10,157 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:13:10,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:13:10,157 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:13:10,158 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:12:43" (3/4) ... [2022-11-02 20:13:10,161 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:13:10,168 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:13:10,168 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:13:10,168 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:13:10,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2022-11-02 20:13:10,177 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-11-02 20:13:10,178 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:13:10,178 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:13:10,178 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:13:10,258 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:13:10,258 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:13:10,260 INFO L158 Benchmark]: Toolchain (without parser) took 29506.62ms. Allocated memory was 119.5MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 74.6MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 789.1MB. Max. memory is 16.1GB. [2022-11-02 20:13:10,260 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 119.5MB. Free memory was 91.1MB in the beginning and 90.9MB in the end (delta: 121.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:13:10,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.11ms. Allocated memory is still 119.5MB. Free memory was 74.3MB in the beginning and 90.0MB in the end (delta: -15.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:13:10,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.56ms. Allocated memory is still 119.5MB. Free memory was 89.5MB in the beginning and 86.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:13:10,262 INFO L158 Benchmark]: Boogie Preprocessor took 87.13ms. Allocated memory is still 119.5MB. Free memory was 86.2MB in the beginning and 83.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:13:10,262 INFO L158 Benchmark]: RCFGBuilder took 1882.35ms. Allocated memory was 119.5MB in the beginning and 161.5MB in the end (delta: 41.9MB). Free memory was 83.2MB in the beginning and 93.3MB in the end (delta: -10.1MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2022-11-02 20:13:10,263 INFO L158 Benchmark]: TraceAbstraction took 26778.78ms. Allocated memory was 161.5MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 92.2MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 759.8MB. Max. memory is 16.1GB. [2022-11-02 20:13:10,263 INFO L158 Benchmark]: Witness Printer took 101.85ms. Allocated memory is still 7.0GB. Free memory was 6.2GB in the beginning and 6.2GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:13:10,267 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.36ms. Allocated memory is still 119.5MB. Free memory was 91.1MB in the beginning and 90.9MB in the end (delta: 121.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.11ms. Allocated memory is still 119.5MB. Free memory was 74.3MB in the beginning and 90.0MB in the end (delta: -15.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.56ms. Allocated memory is still 119.5MB. Free memory was 89.5MB in the beginning and 86.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.13ms. Allocated memory is still 119.5MB. Free memory was 86.2MB in the beginning and 83.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1882.35ms. Allocated memory was 119.5MB in the beginning and 161.5MB in the end (delta: 41.9MB). Free memory was 83.2MB in the beginning and 93.3MB in the end (delta: -10.1MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. * TraceAbstraction took 26778.78ms. Allocated memory was 161.5MB in the beginning and 7.0GB in the end (delta: 6.9GB). Free memory was 92.2MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 759.8MB. Max. memory is 16.1GB. * Witness Printer took 101.85ms. Allocated memory is still 7.0GB. Free memory was 6.2GB in the beginning and 6.2GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: 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: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: 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: 73]: 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: 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: 130]: 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: 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: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: 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: 143]: 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: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: 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: 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: 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: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: 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 9 procedures, 429 locations, 112 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 187 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 514 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1712 IncrementalHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 187 mSDtfsCounter, 1712 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=636occurred in iteration=0, InterpolantAutomatonStates: 66, 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.7s InterpolantComputationTime, 1780 NumberOfCodeBlocks, 1780 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1763 ConstructedInterpolants, 0 QuantifiedInterpolants, 2226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 61 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:13:10,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0217e75a-bb52-42ee-bcf4-3ba29b738b53/bin/uautomizer-Dbtcem3rbc/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