./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN --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 846c6ea342419c7ea85c72de8af40f1cf8af72c22131b8a3f2ebdacec113c699 --- 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-6b4ec56 [2022-11-20 11:15:01,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:15:01,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:15:01,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:15:01,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:15:01,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:15:01,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:15:01,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:15:01,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:15:01,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:15:01,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:15:01,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:15:01,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:15:01,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:15:01,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:15:01,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:15:01,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:15:01,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:15:01,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:15:01,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:15:01,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:15:01,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:15:01,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:15:01,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:15:01,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:15:01,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:15:01,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:15:01,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:15:01,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:15:01,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:15:01,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:15:01,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:15:01,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:15:01,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:15:01,553 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:15:01,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:15:01,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:15:01,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:15:01,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:15:01,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:15:01,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:15:01,558 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-20 11:15:01,600 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:15:01,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:15:01,601 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:15:01,601 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:15:01,602 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:15:01,603 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:15:01,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:15:01,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:15:01,604 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:15:01,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:15:01,605 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:15:01,605 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:15:01,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:15:01,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:15:01,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:15:01,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:15:01,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:15:01,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:15:01,607 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-20 11:15:01,607 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:15:01,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:15:01,608 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:15:01,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:15:01,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:15:01,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:15:01,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:15:01,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:15:01,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:15:01,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:15:01,609 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:15:01,609 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:15:01,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:15:01,610 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:15:01,610 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:15:01,610 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:15:01,611 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_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN/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_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN 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 -> 846c6ea342419c7ea85c72de8af40f1cf8af72c22131b8a3f2ebdacec113c699 [2022-11-20 11:15:01,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:15:01,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:15:01,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:15:01,955 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:15:01,955 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:15:01,956 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2022-11-20 11:15:05,032 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:15:05,339 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:15:05,340 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e5e006-eba9-4c02-b547-dcb39bd0f770/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2022-11-20 11:15:05,349 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN/data/1804cee96/b407b6b4b8fd4bfa88a96ede5de0943a/FLAGe2d25a034 [2022-11-20 11:15:05,369 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN/data/1804cee96/b407b6b4b8fd4bfa88a96ede5de0943a [2022-11-20 11:15:05,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:15:05,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:15:05,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:15:05,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:15:05,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:15:05,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:15:05" (1/1) ... [2022-11-20 11:15:05,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22314464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:05, skipping insertion in model container [2022-11-20 11:15:05,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:15:05" (1/1) ... [2022-11-20 11:15:05,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:15:05,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:15:05,636 WARN L237 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_c7e5e006-eba9-4c02-b547-dcb39bd0f770/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c[2495,2508] [2022-11-20 11:15:05,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:15:05,651 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:15:05,687 WARN L237 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_c7e5e006-eba9-4c02-b547-dcb39bd0f770/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c[2495,2508] [2022-11-20 11:15:05,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:15:05,708 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:15:05,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:05 WrapperNode [2022-11-20 11:15:05,708 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:15:05,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:15:05,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:15:05,710 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:15:05,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:05" (1/1) ... [2022-11-20 11:15:05,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:05" (1/1) ... [2022-11-20 11:15:05,767 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 240 [2022-11-20 11:15:05,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:15:05,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:15:05,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:15:05,768 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:15:05,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:05" (1/1) ... [2022-11-20 11:15:05,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:05" (1/1) ... [2022-11-20 11:15:05,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:05" (1/1) ... [2022-11-20 11:15:05,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:05" (1/1) ... [2022-11-20 11:15:05,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:05" (1/1) ... [2022-11-20 11:15:05,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:05" (1/1) ... [2022-11-20 11:15:05,810 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:05" (1/1) ... [2022-11-20 11:15:05,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:05" (1/1) ... [2022-11-20 11:15:05,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:15:05,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:15:05,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:15:05,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:15:05,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:05" (1/1) ... [2022-11-20 11:15:05,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:15:05,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:15:05,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:15:05,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:15:05,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:15:05,908 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 11:15:05,908 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 11:15:05,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 11:15:05,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 11:15:05,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:15:05,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:15:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:15:05,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:15:05,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:15:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:15:05,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:15:05,922 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 11:15:06,148 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:15:06,151 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:15:06,871 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:15:06,890 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:15:06,893 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 11:15:06,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:15:06 BoogieIcfgContainer [2022-11-20 11:15:06,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:15:06,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:15:06,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:15:06,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:15:06,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:15:05" (1/3) ... [2022-11-20 11:15:06,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c37e1a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:15:06, skipping insertion in model container [2022-11-20 11:15:06,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:05" (2/3) ... [2022-11-20 11:15:06,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c37e1a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:15:06, skipping insertion in model container [2022-11-20 11:15:06,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:15:06" (3/3) ... [2022-11-20 11:15:06,913 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-symm.wvr.c [2022-11-20 11:15:06,924 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 11:15:06,937 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:15:06,938 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-11-20 11:15:06,938 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 11:15:07,057 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 11:15:07,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 322 transitions, 660 flow [2022-11-20 11:15:07,281 INFO L130 PetriNetUnfolder]: 18/320 cut-off events. [2022-11-20 11:15:07,281 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 11:15:07,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 320 events. 18/320 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 653 event pairs, 0 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 177. Up to 2 conditions per place. [2022-11-20 11:15:07,294 INFO L82 GeneralOperation]: Start removeDead. Operand has 311 places, 322 transitions, 660 flow [2022-11-20 11:15:07,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 290 places, 299 transitions, 610 flow [2022-11-20 11:15:07,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:15:07,374 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;@7e4c8786, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:15:07,374 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-11-20 11:15:07,381 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-11-20 11:15:07,381 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 11:15:07,381 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:07,382 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:07,394 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:07,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:07,400 INFO L85 PathProgramCache]: Analyzing trace with hash 556002390, now seen corresponding path program 1 times [2022-11-20 11:15:07,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:07,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312629070] [2022-11-20 11:15:07,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:07,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:07,674 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-20 11:15:07,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:07,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312629070] [2022-11-20 11:15:07,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312629070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:07,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:07,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:15:07,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501538028] [2022-11-20 11:15:07,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:07,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:15:07,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:07,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:15:07,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:15:07,730 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2022-11-20 11:15:07,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 299 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 299.3333333333333) internal successors, (898), 3 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:07,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:07,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2022-11-20 11:15:07,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:07,953 INFO L130 PetriNetUnfolder]: 34/629 cut-off events. [2022-11-20 11:15:07,953 INFO L131 PetriNetUnfolder]: For 36/37 co-relation queries the response was YES. [2022-11-20 11:15:07,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 629 events. 34/629 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2707 event pairs, 15 based on Foata normal form. 18/555 useless extension candidates. Maximal degree in co-relation 485. Up to 49 conditions per place. [2022-11-20 11:15:07,965 INFO L137 encePairwiseOnDemand]: 313/322 looper letters, 13 selfloop transitions, 2 changer transitions 2/292 dead transitions. [2022-11-20 11:15:07,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 292 transitions, 626 flow [2022-11-20 11:15:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:15:07,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:15:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2022-11-20 11:15:07,993 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.94824016563147 [2022-11-20 11:15:07,995 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 916 transitions. [2022-11-20 11:15:07,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 916 transitions. [2022-11-20 11:15:08,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:08,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 916 transitions. [2022-11-20 11:15:08,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:08,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:08,026 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:08,028 INFO L175 Difference]: Start difference. First operand has 290 places, 299 transitions, 610 flow. Second operand 3 states and 916 transitions. [2022-11-20 11:15:08,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 292 transitions, 626 flow [2022-11-20 11:15:08,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 292 transitions, 618 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 11:15:08,049 INFO L231 Difference]: Finished difference. Result has 287 places, 290 transitions, 588 flow [2022-11-20 11:15:08,052 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=287, PETRI_TRANSITIONS=290} [2022-11-20 11:15:08,059 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -3 predicate places. [2022-11-20 11:15:08,059 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 290 transitions, 588 flow [2022-11-20 11:15:08,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.3333333333333) internal successors, (898), 3 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:08,061 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:08,061 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:08,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:15:08,062 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:08,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:08,064 INFO L85 PathProgramCache]: Analyzing trace with hash 96040970, now seen corresponding path program 1 times [2022-11-20 11:15:08,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:08,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623228862] [2022-11-20 11:15:08,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:08,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:08,219 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-20 11:15:08,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:08,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623228862] [2022-11-20 11:15:08,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623228862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:08,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:08,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:15:08,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625823270] [2022-11-20 11:15:08,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:08,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:15:08,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:08,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:15:08,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:15:08,228 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2022-11-20 11:15:08,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 290 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 299.3333333333333) internal successors, (898), 3 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:08,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:08,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2022-11-20 11:15:08,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:08,427 INFO L130 PetriNetUnfolder]: 34/629 cut-off events. [2022-11-20 11:15:08,428 INFO L131 PetriNetUnfolder]: For 10/11 co-relation queries the response was YES. [2022-11-20 11:15:08,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 629 events. 34/629 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2709 event pairs, 15 based on Foata normal form. 0/539 useless extension candidates. Maximal degree in co-relation 654. Up to 49 conditions per place. [2022-11-20 11:15:08,434 INFO L137 encePairwiseOnDemand]: 319/322 looper letters, 13 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2022-11-20 11:15:08,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 289 transitions, 616 flow [2022-11-20 11:15:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:15:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:15:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2022-11-20 11:15:08,439 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9420289855072463 [2022-11-20 11:15:08,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 910 transitions. [2022-11-20 11:15:08,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 910 transitions. [2022-11-20 11:15:08,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:08,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 910 transitions. [2022-11-20 11:15:08,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:08,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:08,447 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:08,447 INFO L175 Difference]: Start difference. First operand has 287 places, 290 transitions, 588 flow. Second operand 3 states and 910 transitions. [2022-11-20 11:15:08,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 289 transitions, 616 flow [2022-11-20 11:15:08,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 289 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:15:08,457 INFO L231 Difference]: Finished difference. Result has 284 places, 289 transitions, 586 flow [2022-11-20 11:15:08,458 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=284, PETRI_TRANSITIONS=289} [2022-11-20 11:15:08,459 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -6 predicate places. [2022-11-20 11:15:08,459 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 289 transitions, 586 flow [2022-11-20 11:15:08,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.3333333333333) internal successors, (898), 3 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:08,460 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:08,461 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:08,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:15:08,462 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:08,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:08,464 INFO L85 PathProgramCache]: Analyzing trace with hash -750980053, now seen corresponding path program 1 times [2022-11-20 11:15:08,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:08,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868550030] [2022-11-20 11:15:08,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:08,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:08,576 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-20 11:15:08,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:08,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868550030] [2022-11-20 11:15:08,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868550030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:08,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:08,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:15:08,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136440334] [2022-11-20 11:15:08,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:08,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:15:08,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:08,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:15:08,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:15:08,580 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 322 [2022-11-20 11:15:08,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 289 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:08,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:08,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 322 [2022-11-20 11:15:08,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:08,772 INFO L130 PetriNetUnfolder]: 65/844 cut-off events. [2022-11-20 11:15:08,773 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-20 11:15:08,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 844 events. 65/844 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4863 event pairs, 27 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 884. Up to 71 conditions per place. [2022-11-20 11:15:08,781 INFO L137 encePairwiseOnDemand]: 319/322 looper letters, 16 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2022-11-20 11:15:08,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 288 transitions, 620 flow [2022-11-20 11:15:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:15:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:15:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2022-11-20 11:15:08,786 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9358178053830227 [2022-11-20 11:15:08,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2022-11-20 11:15:08,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2022-11-20 11:15:08,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:08,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2022-11-20 11:15:08,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:08,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:08,818 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:08,819 INFO L175 Difference]: Start difference. First operand has 284 places, 289 transitions, 586 flow. Second operand 3 states and 904 transitions. [2022-11-20 11:15:08,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 288 transitions, 620 flow [2022-11-20 11:15:08,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 288 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:15:08,825 INFO L231 Difference]: Finished difference. Result has 283 places, 288 transitions, 584 flow [2022-11-20 11:15:08,826 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=283, PETRI_TRANSITIONS=288} [2022-11-20 11:15:08,829 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -7 predicate places. [2022-11-20 11:15:08,829 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 288 transitions, 584 flow [2022-11-20 11:15:08,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:08,830 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:08,831 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:08,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:15:08,831 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:08,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:08,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1456900638, now seen corresponding path program 1 times [2022-11-20 11:15:08,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:08,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857407562] [2022-11-20 11:15:08,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:08,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:08,934 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-20 11:15:08,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:08,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857407562] [2022-11-20 11:15:08,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857407562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:08,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:08,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:15:08,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004434859] [2022-11-20 11:15:08,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:08,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:15:08,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:08,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:15:08,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:15:08,943 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 322 [2022-11-20 11:15:08,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 288 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:08,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:08,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 322 [2022-11-20 11:15:08,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:09,128 INFO L130 PetriNetUnfolder]: 69/925 cut-off events. [2022-11-20 11:15:09,128 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-20 11:15:09,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 925 events. 69/925 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5677 event pairs, 27 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 962. Up to 71 conditions per place. [2022-11-20 11:15:09,139 INFO L137 encePairwiseOnDemand]: 319/322 looper letters, 16 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2022-11-20 11:15:09,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 287 transitions, 618 flow [2022-11-20 11:15:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:15:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:15:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2022-11-20 11:15:09,143 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9358178053830227 [2022-11-20 11:15:09,143 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2022-11-20 11:15:09,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2022-11-20 11:15:09,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:09,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2022-11-20 11:15:09,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,157 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,157 INFO L175 Difference]: Start difference. First operand has 283 places, 288 transitions, 584 flow. Second operand 3 states and 904 transitions. [2022-11-20 11:15:09,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 287 transitions, 618 flow [2022-11-20 11:15:09,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 287 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:15:09,164 INFO L231 Difference]: Finished difference. Result has 282 places, 287 transitions, 582 flow [2022-11-20 11:15:09,166 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=282, PETRI_TRANSITIONS=287} [2022-11-20 11:15:09,167 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -8 predicate places. [2022-11-20 11:15:09,168 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 287 transitions, 582 flow [2022-11-20 11:15:09,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,174 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:09,175 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:09,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:15:09,175 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:09,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:09,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1698260784, now seen corresponding path program 1 times [2022-11-20 11:15:09,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:09,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672261451] [2022-11-20 11:15:09,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:09,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:09,283 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-20 11:15:09,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:09,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672261451] [2022-11-20 11:15:09,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672261451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:09,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:09,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:15:09,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296880194] [2022-11-20 11:15:09,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:09,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:15:09,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:09,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:15:09,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:15:09,288 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 322 [2022-11-20 11:15:09,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 287 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:09,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 322 [2022-11-20 11:15:09,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:09,487 INFO L130 PetriNetUnfolder]: 61/758 cut-off events. [2022-11-20 11:15:09,487 INFO L131 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2022-11-20 11:15:09,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 758 events. 61/758 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4169 event pairs, 27 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 794. Up to 79 conditions per place. [2022-11-20 11:15:09,495 INFO L137 encePairwiseOnDemand]: 319/322 looper letters, 16 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2022-11-20 11:15:09,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 286 transitions, 616 flow [2022-11-20 11:15:09,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:15:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:15:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2022-11-20 11:15:09,499 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9358178053830227 [2022-11-20 11:15:09,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2022-11-20 11:15:09,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2022-11-20 11:15:09,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:09,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2022-11-20 11:15:09,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,506 INFO L175 Difference]: Start difference. First operand has 282 places, 287 transitions, 582 flow. Second operand 3 states and 904 transitions. [2022-11-20 11:15:09,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 286 transitions, 616 flow [2022-11-20 11:15:09,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 286 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:15:09,513 INFO L231 Difference]: Finished difference. Result has 281 places, 286 transitions, 580 flow [2022-11-20 11:15:09,514 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=281, PETRI_TRANSITIONS=286} [2022-11-20 11:15:09,515 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -9 predicate places. [2022-11-20 11:15:09,515 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 286 transitions, 580 flow [2022-11-20 11:15:09,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,516 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:09,516 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:09,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:15:09,517 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:09,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:09,518 INFO L85 PathProgramCache]: Analyzing trace with hash 697501214, now seen corresponding path program 1 times [2022-11-20 11:15:09,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:09,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034827289] [2022-11-20 11:15:09,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:09,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:09,571 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-20 11:15:09,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:09,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034827289] [2022-11-20 11:15:09,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034827289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:09,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:09,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:15:09,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338618139] [2022-11-20 11:15:09,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:09,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:15:09,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:09,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:15:09,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:15:09,576 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 322 [2022-11-20 11:15:09,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 286 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:09,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 322 [2022-11-20 11:15:09,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:09,719 INFO L130 PetriNetUnfolder]: 64/907 cut-off events. [2022-11-20 11:15:09,720 INFO L131 PetriNetUnfolder]: For 10/12 co-relation queries the response was YES. [2022-11-20 11:15:09,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 907 events. 64/907 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5562 event pairs, 27 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 937. Up to 76 conditions per place. [2022-11-20 11:15:09,728 INFO L137 encePairwiseOnDemand]: 319/322 looper letters, 16 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2022-11-20 11:15:09,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 285 transitions, 614 flow [2022-11-20 11:15:09,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:15:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:15:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2022-11-20 11:15:09,731 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9358178053830227 [2022-11-20 11:15:09,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2022-11-20 11:15:09,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2022-11-20 11:15:09,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:09,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2022-11-20 11:15:09,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,738 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,738 INFO L175 Difference]: Start difference. First operand has 281 places, 286 transitions, 580 flow. Second operand 3 states and 904 transitions. [2022-11-20 11:15:09,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 285 transitions, 614 flow [2022-11-20 11:15:09,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 285 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:15:09,744 INFO L231 Difference]: Finished difference. Result has 280 places, 285 transitions, 578 flow [2022-11-20 11:15:09,744 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=280, PETRI_TRANSITIONS=285} [2022-11-20 11:15:09,745 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -10 predicate places. [2022-11-20 11:15:09,745 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 285 transitions, 578 flow [2022-11-20 11:15:09,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,746 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:09,747 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:09,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:15:09,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:09,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash -635525162, now seen corresponding path program 1 times [2022-11-20 11:15:09,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:09,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804652262] [2022-11-20 11:15:09,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:09,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:09,824 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-20 11:15:09,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:09,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804652262] [2022-11-20 11:15:09,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804652262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:09,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:09,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:15:09,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012387925] [2022-11-20 11:15:09,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:09,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:15:09,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:09,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:15:09,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:15:09,837 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2022-11-20 11:15:09,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 285 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:09,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2022-11-20 11:15:09,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:09,951 INFO L130 PetriNetUnfolder]: 48/746 cut-off events. [2022-11-20 11:15:09,951 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-20 11:15:09,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 746 events. 48/746 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4022 event pairs, 8 based on Foata normal form. 0/628 useless extension candidates. Maximal degree in co-relation 728. Up to 36 conditions per place. [2022-11-20 11:15:09,957 INFO L137 encePairwiseOnDemand]: 316/322 looper letters, 13 selfloop transitions, 3 changer transitions 0/286 dead transitions. [2022-11-20 11:15:09,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 286 transitions, 613 flow [2022-11-20 11:15:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:15:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:15:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2022-11-20 11:15:09,960 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9451345755693582 [2022-11-20 11:15:09,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 913 transitions. [2022-11-20 11:15:09,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 913 transitions. [2022-11-20 11:15:09,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:09,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 913 transitions. [2022-11-20 11:15:09,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,966 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,966 INFO L175 Difference]: Start difference. First operand has 280 places, 285 transitions, 578 flow. Second operand 3 states and 913 transitions. [2022-11-20 11:15:09,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 286 transitions, 613 flow [2022-11-20 11:15:09,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 286 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:15:09,972 INFO L231 Difference]: Finished difference. Result has 278 places, 285 transitions, 589 flow [2022-11-20 11:15:09,973 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=589, PETRI_PLACES=278, PETRI_TRANSITIONS=285} [2022-11-20 11:15:09,973 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -12 predicate places. [2022-11-20 11:15:09,974 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 285 transitions, 589 flow [2022-11-20 11:15:09,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,974 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:09,975 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:09,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:15:09,975 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:09,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash -713516550, now seen corresponding path program 1 times [2022-11-20 11:15:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:09,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714893234] [2022-11-20 11:15:09,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:09,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:10,057 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-20 11:15:10,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:10,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714893234] [2022-11-20 11:15:10,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714893234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:10,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:10,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:15:10,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896890884] [2022-11-20 11:15:10,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:10,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:15:10,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:10,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:15:10,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:15:10,060 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2022-11-20 11:15:10,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 285 transitions, 589 flow. Second operand has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:10,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2022-11-20 11:15:10,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:10,183 INFO L130 PetriNetUnfolder]: 54/823 cut-off events. [2022-11-20 11:15:10,183 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-20 11:15:10,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 823 events. 54/823 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4778 event pairs, 8 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 740. Up to 36 conditions per place. [2022-11-20 11:15:10,190 INFO L137 encePairwiseOnDemand]: 316/322 looper letters, 13 selfloop transitions, 3 changer transitions 0/286 dead transitions. [2022-11-20 11:15:10,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 286 transitions, 624 flow [2022-11-20 11:15:10,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:15:10,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:15:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2022-11-20 11:15:10,193 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9451345755693582 [2022-11-20 11:15:10,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 913 transitions. [2022-11-20 11:15:10,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 913 transitions. [2022-11-20 11:15:10,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:10,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 913 transitions. [2022-11-20 11:15:10,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,198 INFO L175 Difference]: Start difference. First operand has 278 places, 285 transitions, 589 flow. Second operand 3 states and 913 transitions. [2022-11-20 11:15:10,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 286 transitions, 624 flow [2022-11-20 11:15:10,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 286 transitions, 624 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:15:10,204 INFO L231 Difference]: Finished difference. Result has 278 places, 285 transitions, 604 flow [2022-11-20 11:15:10,205 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=604, PETRI_PLACES=278, PETRI_TRANSITIONS=285} [2022-11-20 11:15:10,208 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -12 predicate places. [2022-11-20 11:15:10,209 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 285 transitions, 604 flow [2022-11-20 11:15:10,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,209 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:10,209 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:10,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:15:10,210 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:10,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:10,210 INFO L85 PathProgramCache]: Analyzing trace with hash -548027105, now seen corresponding path program 1 times [2022-11-20 11:15:10,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:10,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936545609] [2022-11-20 11:15:10,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:10,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:10,260 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-20 11:15:10,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:10,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936545609] [2022-11-20 11:15:10,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936545609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:10,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:10,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:15:10,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571057675] [2022-11-20 11:15:10,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:10,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:15:10,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:10,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:15:10,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:15:10,265 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2022-11-20 11:15:10,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 285 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:10,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2022-11-20 11:15:10,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:10,410 INFO L130 PetriNetUnfolder]: 56/979 cut-off events. [2022-11-20 11:15:10,410 INFO L131 PetriNetUnfolder]: For 13/14 co-relation queries the response was YES. [2022-11-20 11:15:10,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 979 events. 56/979 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6082 event pairs, 4 based on Foata normal form. 0/856 useless extension candidates. Maximal degree in co-relation 903. Up to 55 conditions per place. [2022-11-20 11:15:10,418 INFO L137 encePairwiseOnDemand]: 316/322 looper letters, 15 selfloop transitions, 3 changer transitions 0/288 dead transitions. [2022-11-20 11:15:10,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 288 transitions, 649 flow [2022-11-20 11:15:10,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:15:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:15:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 915 transitions. [2022-11-20 11:15:10,421 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9472049689440993 [2022-11-20 11:15:10,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 915 transitions. [2022-11-20 11:15:10,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 915 transitions. [2022-11-20 11:15:10,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:10,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 915 transitions. [2022-11-20 11:15:10,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,426 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,426 INFO L175 Difference]: Start difference. First operand has 278 places, 285 transitions, 604 flow. Second operand 3 states and 915 transitions. [2022-11-20 11:15:10,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 288 transitions, 649 flow [2022-11-20 11:15:10,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 288 transitions, 649 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:15:10,435 INFO L231 Difference]: Finished difference. Result has 278 places, 285 transitions, 619 flow [2022-11-20 11:15:10,435 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=619, PETRI_PLACES=278, PETRI_TRANSITIONS=285} [2022-11-20 11:15:10,436 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -12 predicate places. [2022-11-20 11:15:10,436 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 285 transitions, 619 flow [2022-11-20 11:15:10,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,437 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:10,437 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:10,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:15:10,438 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:10,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:10,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1062527774, now seen corresponding path program 1 times [2022-11-20 11:15:10,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:10,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747974255] [2022-11-20 11:15:10,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:10,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:10,519 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-20 11:15:10,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:10,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747974255] [2022-11-20 11:15:10,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747974255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:10,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:10,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:15:10,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529783737] [2022-11-20 11:15:10,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:10,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:15:10,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:10,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:15:10,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:15:10,525 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 322 [2022-11-20 11:15:10,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 285 transitions, 619 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:10,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 322 [2022-11-20 11:15:10,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:10,659 INFO L130 PetriNetUnfolder]: 42/822 cut-off events. [2022-11-20 11:15:10,659 INFO L131 PetriNetUnfolder]: For 4/8 co-relation queries the response was YES. [2022-11-20 11:15:10,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 822 events. 42/822 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4876 event pairs, 4 based on Foata normal form. 1/727 useless extension candidates. Maximal degree in co-relation 775. Up to 37 conditions per place. [2022-11-20 11:15:10,667 INFO L137 encePairwiseOnDemand]: 319/322 looper letters, 16 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2022-11-20 11:15:10,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 285 transitions, 656 flow [2022-11-20 11:15:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:15:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:15:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 907 transitions. [2022-11-20 11:15:10,670 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9389233954451346 [2022-11-20 11:15:10,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 907 transitions. [2022-11-20 11:15:10,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 907 transitions. [2022-11-20 11:15:10,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:10,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 907 transitions. [2022-11-20 11:15:10,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,677 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,677 INFO L175 Difference]: Start difference. First operand has 278 places, 285 transitions, 619 flow. Second operand 3 states and 907 transitions. [2022-11-20 11:15:10,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 285 transitions, 656 flow [2022-11-20 11:15:10,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 285 transitions, 656 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:15:10,686 INFO L231 Difference]: Finished difference. Result has 279 places, 284 transitions, 621 flow [2022-11-20 11:15:10,687 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=621, PETRI_PLACES=279, PETRI_TRANSITIONS=284} [2022-11-20 11:15:10,688 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -11 predicate places. [2022-11-20 11:15:10,688 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 284 transitions, 621 flow [2022-11-20 11:15:10,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,689 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:10,689 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:10,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 11:15:10,689 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:10,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:10,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1104030203, now seen corresponding path program 1 times [2022-11-20 11:15:10,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:10,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722603114] [2022-11-20 11:15:10,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:10,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:10,757 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-20 11:15:10,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:10,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722603114] [2022-11-20 11:15:10,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722603114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:10,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:10,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:15:10,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190682475] [2022-11-20 11:15:10,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:10,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:15:10,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:10,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:15:10,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:15:10,761 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2022-11-20 11:15:10,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 284 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:10,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2022-11-20 11:15:10,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:10,938 INFO L130 PetriNetUnfolder]: 60/1101 cut-off events. [2022-11-20 11:15:10,939 INFO L131 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-11-20 11:15:10,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 1101 events. 60/1101 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7306 event pairs, 7 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 1062. Up to 47 conditions per place. [2022-11-20 11:15:10,949 INFO L137 encePairwiseOnDemand]: 316/322 looper letters, 15 selfloop transitions, 3 changer transitions 0/287 dead transitions. [2022-11-20 11:15:10,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 287 transitions, 666 flow [2022-11-20 11:15:10,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:15:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:15:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 915 transitions. [2022-11-20 11:15:10,952 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9472049689440993 [2022-11-20 11:15:10,952 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 915 transitions. [2022-11-20 11:15:10,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 915 transitions. [2022-11-20 11:15:10,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:10,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 915 transitions. [2022-11-20 11:15:10,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,959 INFO L175 Difference]: Start difference. First operand has 279 places, 284 transitions, 621 flow. Second operand 3 states and 915 transitions. [2022-11-20 11:15:10,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 287 transitions, 666 flow [2022-11-20 11:15:10,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 287 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:15:10,966 INFO L231 Difference]: Finished difference. Result has 277 places, 284 transitions, 632 flow [2022-11-20 11:15:10,966 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=277, PETRI_TRANSITIONS=284} [2022-11-20 11:15:10,967 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -13 predicate places. [2022-11-20 11:15:10,967 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 284 transitions, 632 flow [2022-11-20 11:15:10,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:10,968 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:10,968 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:10,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 11:15:10,969 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:10,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:10,969 INFO L85 PathProgramCache]: Analyzing trace with hash -90796265, now seen corresponding path program 1 times [2022-11-20 11:15:10,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:10,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644770795] [2022-11-20 11:15:10,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:10,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:11,348 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-20 11:15:11,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:11,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644770795] [2022-11-20 11:15:11,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644770795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:11,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:11,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:15:11,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006630060] [2022-11-20 11:15:11,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:11,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:15:11,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:11,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:15:11,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:15:11,353 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 322 [2022-11-20 11:15:11,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 284 transitions, 632 flow. Second operand has 6 states, 6 states have (on average 293.8333333333333) internal successors, (1763), 6 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:11,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:11,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 322 [2022-11-20 11:15:11,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:11,530 INFO L130 PetriNetUnfolder]: 35/784 cut-off events. [2022-11-20 11:15:11,530 INFO L131 PetriNetUnfolder]: For 2/16 co-relation queries the response was YES. [2022-11-20 11:15:11,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 784 events. 35/784 cut-off events. For 2/16 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4360 event pairs, 0 based on Foata normal form. 8/705 useless extension candidates. Maximal degree in co-relation 714. Up to 20 conditions per place. [2022-11-20 11:15:11,538 INFO L137 encePairwiseOnDemand]: 317/322 looper letters, 15 selfloop transitions, 4 changer transitions 0/283 dead transitions. [2022-11-20 11:15:11,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 283 transitions, 668 flow [2022-11-20 11:15:11,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:15:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 11:15:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1772 transitions. [2022-11-20 11:15:11,542 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.917184265010352 [2022-11-20 11:15:11,543 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1772 transitions. [2022-11-20 11:15:11,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1772 transitions. [2022-11-20 11:15:11,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:11,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1772 transitions. [2022-11-20 11:15:11,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 295.3333333333333) internal successors, (1772), 6 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:11,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 322.0) internal successors, (2254), 7 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:11,571 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 322.0) internal successors, (2254), 7 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:11,572 INFO L175 Difference]: Start difference. First operand has 277 places, 284 transitions, 632 flow. Second operand 6 states and 1772 transitions. [2022-11-20 11:15:11,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 283 transitions, 668 flow [2022-11-20 11:15:11,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 283 transitions, 668 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:15:11,578 INFO L231 Difference]: Finished difference. Result has 281 places, 283 transitions, 638 flow [2022-11-20 11:15:11,578 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=638, PETRI_PLACES=281, PETRI_TRANSITIONS=283} [2022-11-20 11:15:11,579 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -9 predicate places. [2022-11-20 11:15:11,579 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 283 transitions, 638 flow [2022-11-20 11:15:11,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 293.8333333333333) internal successors, (1763), 6 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:11,580 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:11,580 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:11,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:15:11,581 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:11,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:11,581 INFO L85 PathProgramCache]: Analyzing trace with hash 726164107, now seen corresponding path program 1 times [2022-11-20 11:15:11,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:11,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210660414] [2022-11-20 11:15:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:11,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:11,625 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-20 11:15:11,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:11,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210660414] [2022-11-20 11:15:11,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210660414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:11,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:11,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:15:11,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981278075] [2022-11-20 11:15:11,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:11,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:15:11,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:11,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:15:11,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:15:11,629 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 322 [2022-11-20 11:15:11,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 283 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 302.6666666666667) internal successors, (908), 3 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:11,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:11,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 322 [2022-11-20 11:15:11,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:11,835 INFO L130 PetriNetUnfolder]: 45/1188 cut-off events. [2022-11-20 11:15:11,835 INFO L131 PetriNetUnfolder]: For 16/18 co-relation queries the response was YES. [2022-11-20 11:15:11,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 1188 events. 45/1188 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7374 event pairs, 2 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 1174. Up to 42 conditions per place. [2022-11-20 11:15:11,844 INFO L137 encePairwiseOnDemand]: 318/322 looper letters, 13 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2022-11-20 11:15:11,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 286 transitions, 677 flow [2022-11-20 11:15:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:15:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:15:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 920 transitions. [2022-11-20 11:15:11,848 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2022-11-20 11:15:11,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 920 transitions. [2022-11-20 11:15:11,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 920 transitions. [2022-11-20 11:15:11,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:11,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 920 transitions. [2022-11-20 11:15:11,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:11,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:11,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:11,855 INFO L175 Difference]: Start difference. First operand has 281 places, 283 transitions, 638 flow. Second operand 3 states and 920 transitions. [2022-11-20 11:15:11,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 286 transitions, 677 flow [2022-11-20 11:15:11,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 286 transitions, 670 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 11:15:11,863 INFO L231 Difference]: Finished difference. Result has 278 places, 283 transitions, 641 flow [2022-11-20 11:15:11,864 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=641, PETRI_PLACES=278, PETRI_TRANSITIONS=283} [2022-11-20 11:15:11,865 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -12 predicate places. [2022-11-20 11:15:11,865 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 283 transitions, 641 flow [2022-11-20 11:15:11,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.6666666666667) internal successors, (908), 3 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:11,866 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:11,866 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:11,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:15:11,866 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:11,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:11,867 INFO L85 PathProgramCache]: Analyzing trace with hash 447383561, now seen corresponding path program 1 times [2022-11-20 11:15:11,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:11,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987985016] [2022-11-20 11:15:11,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:11,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:11,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-20 11:15:11,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:11,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987985016] [2022-11-20 11:15:11,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987985016] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:11,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:11,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:15:11,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866877753] [2022-11-20 11:15:11,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:11,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:15:11,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:11,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:15:11,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:15:11,911 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 322 [2022-11-20 11:15:11,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 283 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:11,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:11,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 322 [2022-11-20 11:15:11,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:12,073 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][167], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 233#L50-39true, Black: 357#true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 374#true]) [2022-11-20 11:15:12,074 INFO L383 tUnfolder$Statistics]: this new event has 177 ancestors and is cut-off event [2022-11-20 11:15:12,074 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 11:15:12,074 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-20 11:15:12,074 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-20 11:15:12,078 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][169], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 376#(= |#race~result_7~0| |thread2Thread1of1ForFork1_#t~nondet12#1|), Black: 357#true, 66#L50-40true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0)]) [2022-11-20 11:15:12,078 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-11-20 11:15:12,078 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-20 11:15:12,079 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-20 11:15:12,079 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-20 11:15:12,085 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][169], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 376#(= |#race~result_7~0| |thread2Thread1of1ForFork1_#t~nondet12#1|), Black: 357#true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 293#L50-41true]) [2022-11-20 11:15:12,085 INFO L383 tUnfolder$Statistics]: this new event has 179 ancestors and is cut-off event [2022-11-20 11:15:12,085 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-20 11:15:12,085 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-20 11:15:12,085 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-20 11:15:12,091 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([812] L50-38-->L50-39: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet12#1=|v_thread2Thread1of1ForFork1_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet12#1][133], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 233#L50-39true, Black: 357#true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 374#true]) [2022-11-20 11:15:12,091 INFO L383 tUnfolder$Statistics]: this new event has 149 ancestors and is cut-off event [2022-11-20 11:15:12,091 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-20 11:15:12,091 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 11:15:12,091 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 11:15:12,092 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([812] L50-38-->L50-39: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~nondet12#1=|v_thread2Thread1of1ForFork1_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~nondet12#1][133], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 233#L50-39true, Black: 357#true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 374#true]) [2022-11-20 11:15:12,092 INFO L383 tUnfolder$Statistics]: this new event has 177 ancestors and is cut-off event [2022-11-20 11:15:12,092 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-20 11:15:12,092 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 11:15:12,092 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-20 11:15:12,092 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-20 11:15:12,096 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][167], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), Black: 357#true, 345#(= |#race~isNull_3~0| 0), 25#L52true, Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 374#true]) [2022-11-20 11:15:12,096 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-20 11:15:12,096 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-20 11:15:12,096 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-11-20 11:15:12,096 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-11-20 11:15:12,106 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][167], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 233#L50-39true, Black: 357#true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 374#true]) [2022-11-20 11:15:12,107 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is not cut-off event [2022-11-20 11:15:12,107 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is not cut-off event [2022-11-20 11:15:12,107 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is not cut-off event [2022-11-20 11:15:12,107 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is not cut-off event [2022-11-20 11:15:12,107 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is not cut-off event [2022-11-20 11:15:12,108 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][169], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 376#(= |#race~result_7~0| |thread2Thread1of1ForFork1_#t~nondet12#1|), 359#(= |#race~filename_5~0| 0), Black: 357#true, 66#L50-40true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0)]) [2022-11-20 11:15:12,108 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-11-20 11:15:12,108 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-20 11:15:12,108 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-11-20 11:15:12,108 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-20 11:15:12,108 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-20 11:15:12,109 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][169], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 376#(= |#race~result_7~0| |thread2Thread1of1ForFork1_#t~nondet12#1|), 359#(= |#race~filename_5~0| 0), Black: 357#true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 293#L50-41true]) [2022-11-20 11:15:12,110 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-20 11:15:12,110 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-20 11:15:12,110 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-20 11:15:12,110 INFO L386 tUnfolder$Statistics]: existing Event has 179 ancestors and is cut-off event [2022-11-20 11:15:12,110 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-20 11:15:12,116 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][167], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), Black: 357#true, 345#(= |#race~isNull_3~0| 0), 25#L52true, Black: 369#true, Black: 338#true, Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 374#true]) [2022-11-20 11:15:12,116 INFO L383 tUnfolder$Statistics]: this new event has 149 ancestors and is not cut-off event [2022-11-20 11:15:12,116 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is not cut-off event [2022-11-20 11:15:12,116 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is not cut-off event [2022-11-20 11:15:12,117 INFO L386 tUnfolder$Statistics]: existing Event has 185 ancestors and is not cut-off event [2022-11-20 11:15:12,117 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is not cut-off event [2022-11-20 11:15:12,129 INFO L130 PetriNetUnfolder]: 70/1081 cut-off events. [2022-11-20 11:15:12,129 INFO L131 PetriNetUnfolder]: For 42/45 co-relation queries the response was YES. [2022-11-20 11:15:12,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 1081 events. 70/1081 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6468 event pairs, 6 based on Foata normal form. 0/984 useless extension candidates. Maximal degree in co-relation 1248. Up to 101 conditions per place. [2022-11-20 11:15:12,138 INFO L137 encePairwiseOnDemand]: 319/322 looper letters, 15 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2022-11-20 11:15:12,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 283 transitions, 676 flow [2022-11-20 11:15:12,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:15:12,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:15:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2022-11-20 11:15:12,141 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.937888198757764 [2022-11-20 11:15:12,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 906 transitions. [2022-11-20 11:15:12,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 906 transitions. [2022-11-20 11:15:12,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:12,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 906 transitions. [2022-11-20 11:15:12,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:12,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:12,147 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:12,147 INFO L175 Difference]: Start difference. First operand has 278 places, 283 transitions, 641 flow. Second operand 3 states and 906 transitions. [2022-11-20 11:15:12,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 283 transitions, 676 flow [2022-11-20 11:15:12,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 283 transitions, 676 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:15:12,153 INFO L231 Difference]: Finished difference. Result has 279 places, 282 transitions, 643 flow [2022-11-20 11:15:12,154 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=643, PETRI_PLACES=279, PETRI_TRANSITIONS=282} [2022-11-20 11:15:12,155 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -11 predicate places. [2022-11-20 11:15:12,155 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 282 transitions, 643 flow [2022-11-20 11:15:12,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:12,156 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:12,156 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:12,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:15:12,156 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:12,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2059030222, now seen corresponding path program 1 times [2022-11-20 11:15:12,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:12,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801173810] [2022-11-20 11:15:12,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:12,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:12,206 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-20 11:15:12,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:12,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801173810] [2022-11-20 11:15:12,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801173810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:12,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:12,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:15:12,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091473289] [2022-11-20 11:15:12,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:12,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:15:12,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:12,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:15:12,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:15:12,210 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 322 [2022-11-20 11:15:12,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 282 transitions, 643 flow. Second operand has 3 states, 3 states have (on average 302.6666666666667) internal successors, (908), 3 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:12,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:12,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 322 [2022-11-20 11:15:12,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:12,471 INFO L130 PetriNetUnfolder]: 46/1212 cut-off events. [2022-11-20 11:15:12,471 INFO L131 PetriNetUnfolder]: For 16/18 co-relation queries the response was YES. [2022-11-20 11:15:12,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 1212 events. 46/1212 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7566 event pairs, 4 based on Foata normal form. 0/1127 useless extension candidates. Maximal degree in co-relation 1269. Up to 43 conditions per place. [2022-11-20 11:15:12,484 INFO L137 encePairwiseOnDemand]: 318/322 looper letters, 13 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2022-11-20 11:15:12,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 285 transitions, 682 flow [2022-11-20 11:15:12,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:15:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:15:12,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 920 transitions. [2022-11-20 11:15:12,487 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2022-11-20 11:15:12,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 920 transitions. [2022-11-20 11:15:12,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 920 transitions. [2022-11-20 11:15:12,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:12,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 920 transitions. [2022-11-20 11:15:12,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:12,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:12,494 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:12,494 INFO L175 Difference]: Start difference. First operand has 279 places, 282 transitions, 643 flow. Second operand 3 states and 920 transitions. [2022-11-20 11:15:12,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 285 transitions, 682 flow [2022-11-20 11:15:12,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 285 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:15:12,501 INFO L231 Difference]: Finished difference. Result has 278 places, 282 transitions, 649 flow [2022-11-20 11:15:12,502 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=649, PETRI_PLACES=278, PETRI_TRANSITIONS=282} [2022-11-20 11:15:12,503 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -12 predicate places. [2022-11-20 11:15:12,503 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 282 transitions, 649 flow [2022-11-20 11:15:12,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.6666666666667) internal successors, (908), 3 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:12,504 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:12,504 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:12,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:15:12,504 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:12,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:12,505 INFO L85 PathProgramCache]: Analyzing trace with hash -686853333, now seen corresponding path program 1 times [2022-11-20 11:15:12,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:12,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882402221] [2022-11-20 11:15:12,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:12,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:13,069 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-20 11:15:13,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:13,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882402221] [2022-11-20 11:15:13,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882402221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:13,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:13,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:15:13,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741505079] [2022-11-20 11:15:13,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:13,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:15:13,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:13,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:15:13,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:15:13,074 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 322 [2022-11-20 11:15:13,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 282 transitions, 649 flow. Second operand has 6 states, 6 states have (on average 294.8333333333333) internal successors, (1769), 6 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:13,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:13,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 322 [2022-11-20 11:15:13,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:13,272 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([879] thread2EXIT-->L69-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][233], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 359#(= |#race~filename_5~0| 0), Black: 357#true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, 380#(= |#race~filename_4~0| 0), 371#(= |#race~filename_1~0| 0), Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 340#(= |#race~isNull_0~0| 0), 121#L69-7true, Black: 378#true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|))))]) [2022-11-20 11:15:13,272 INFO L383 tUnfolder$Statistics]: this new event has 159 ancestors and is cut-off event [2022-11-20 11:15:13,273 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-20 11:15:13,273 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-20 11:15:13,273 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-20 11:15:13,279 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([879] thread2EXIT-->L69-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][233], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 359#(= |#race~filename_5~0| 0), Black: 357#true, 345#(= |#race~isNull_3~0| 0), Black: 369#true, Black: 338#true, 380#(= |#race~filename_4~0| 0), Black: 343#true, 371#(= |#race~filename_1~0| 0), 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 340#(= |#race~isNull_0~0| 0), Black: 378#true, 121#L69-7true, 388#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|))))]) [2022-11-20 11:15:13,279 INFO L383 tUnfolder$Statistics]: this new event has 159 ancestors and is not cut-off event [2022-11-20 11:15:13,280 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is not cut-off event [2022-11-20 11:15:13,280 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is not cut-off event [2022-11-20 11:15:13,280 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is not cut-off event [2022-11-20 11:15:13,280 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is not cut-off event [2022-11-20 11:15:13,286 INFO L130 PetriNetUnfolder]: 35/1018 cut-off events. [2022-11-20 11:15:13,287 INFO L131 PetriNetUnfolder]: For 5/50 co-relation queries the response was YES. [2022-11-20 11:15:13,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 1018 events. 35/1018 cut-off events. For 5/50 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5828 event pairs, 0 based on Foata normal form. 8/955 useless extension candidates. Maximal degree in co-relation 1075. Up to 24 conditions per place. [2022-11-20 11:15:13,299 INFO L137 encePairwiseOnDemand]: 317/322 looper letters, 14 selfloop transitions, 4 changer transitions 0/281 dead transitions. [2022-11-20 11:15:13,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 281 transitions, 683 flow [2022-11-20 11:15:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:15:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 11:15:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1771 transitions. [2022-11-20 11:15:13,305 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2022-11-20 11:15:13,305 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1771 transitions. [2022-11-20 11:15:13,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1771 transitions. [2022-11-20 11:15:13,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:13,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1771 transitions. [2022-11-20 11:15:13,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 295.1666666666667) internal successors, (1771), 6 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:13,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 322.0) internal successors, (2254), 7 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:13,317 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 322.0) internal successors, (2254), 7 states have internal predecessors, (2254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:13,317 INFO L175 Difference]: Start difference. First operand has 278 places, 282 transitions, 649 flow. Second operand 6 states and 1771 transitions. [2022-11-20 11:15:13,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 281 transitions, 683 flow [2022-11-20 11:15:13,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 281 transitions, 683 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:15:13,325 INFO L231 Difference]: Finished difference. Result has 282 places, 281 transitions, 655 flow [2022-11-20 11:15:13,325 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=655, PETRI_PLACES=282, PETRI_TRANSITIONS=281} [2022-11-20 11:15:13,326 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -8 predicate places. [2022-11-20 11:15:13,326 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 281 transitions, 655 flow [2022-11-20 11:15:13,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 294.8333333333333) internal successors, (1769), 6 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:13,328 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:13,328 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:13,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 11:15:13,328 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:13,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:13,329 INFO L85 PathProgramCache]: Analyzing trace with hash 610750687, now seen corresponding path program 1 times [2022-11-20 11:15:13,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:13,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761280972] [2022-11-20 11:15:13,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:13,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:15:13,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:13,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761280972] [2022-11-20 11:15:13,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761280972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:13,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:13,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:15:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529340193] [2022-11-20 11:15:13,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:13,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:15:13,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:13,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:15:13,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:15:13,402 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2022-11-20 11:15:13,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 281 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:13,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:13,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2022-11-20 11:15:13,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:13,600 INFO L130 PetriNetUnfolder]: 46/1204 cut-off events. [2022-11-20 11:15:13,600 INFO L131 PetriNetUnfolder]: For 6/10 co-relation queries the response was YES. [2022-11-20 11:15:13,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 1204 events. 46/1204 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7620 event pairs, 6 based on Foata normal form. 0/1130 useless extension candidates. Maximal degree in co-relation 1234. Up to 30 conditions per place. [2022-11-20 11:15:13,612 INFO L137 encePairwiseOnDemand]: 318/322 looper letters, 11 selfloop transitions, 1 changer transitions 0/278 dead transitions. [2022-11-20 11:15:13,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 278 transitions, 673 flow [2022-11-20 11:15:13,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:15:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:15:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 909 transitions. [2022-11-20 11:15:13,616 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9409937888198758 [2022-11-20 11:15:13,616 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 909 transitions. [2022-11-20 11:15:13,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 909 transitions. [2022-11-20 11:15:13,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:13,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 909 transitions. [2022-11-20 11:15:13,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:13,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:13,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:13,622 INFO L175 Difference]: Start difference. First operand has 282 places, 281 transitions, 655 flow. Second operand 3 states and 909 transitions. [2022-11-20 11:15:13,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 278 transitions, 673 flow [2022-11-20 11:15:13,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 278 transitions, 666 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 11:15:13,629 INFO L231 Difference]: Finished difference. Result has 277 places, 278 transitions, 644 flow [2022-11-20 11:15:13,629 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=277, PETRI_TRANSITIONS=278} [2022-11-20 11:15:13,630 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -13 predicate places. [2022-11-20 11:15:13,630 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 278 transitions, 644 flow [2022-11-20 11:15:13,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:13,631 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:13,631 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:13,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 11:15:13,632 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-20 11:15:13,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:13,632 INFO L85 PathProgramCache]: Analyzing trace with hash -209060698, now seen corresponding path program 1 times [2022-11-20 11:15:13,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:13,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878016749] [2022-11-20 11:15:13,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:13,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:13,700 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-20 11:15:13,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:13,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878016749] [2022-11-20 11:15:13,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878016749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:13,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:13,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:15:13,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794381114] [2022-11-20 11:15:13,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:13,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:15:13,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:13,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:15:13,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:15:13,704 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 322 [2022-11-20 11:15:13,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 278 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:13,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:13,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 322 [2022-11-20 11:15:13,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:13,858 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][166], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 394#true, Black: 357#true, 66#L50-40true, 345#(= |#race~isNull_3~0| 0), 390#true, Black: 369#true, Black: 338#true, 380#(= |#race~filename_4~0| 0), Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), Black: 378#true]) [2022-11-20 11:15:13,859 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-11-20 11:15:13,859 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-20 11:15:13,859 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-20 11:15:13,859 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-20 11:15:13,862 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][166], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 394#true, Black: 357#true, 345#(= |#race~isNull_3~0| 0), 390#true, Black: 369#true, Black: 338#true, 380#(= |#race~filename_4~0| 0), Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), 293#L50-41true, Black: 378#true]) [2022-11-20 11:15:13,862 INFO L383 tUnfolder$Statistics]: this new event has 179 ancestors and is cut-off event [2022-11-20 11:15:13,862 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-20 11:15:13,863 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-20 11:15:13,863 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-20 11:15:13,867 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([816] L50-39-->L50-40: Formula: (= |v_thread2Thread1of1ForFork1_#t~nondet12#1_3| |v_#race~result_7~0_1|) InVars {thread2Thread1of1ForFork1_#t~nondet12#1=|v_thread2Thread1of1ForFork1_#t~nondet12#1_3|} OutVars{#race~result_7~0=|v_#race~result_7~0_1|, thread2Thread1of1ForFork1_#t~nondet12#1=|v_thread2Thread1of1ForFork1_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_7~0][140], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), Black: 357#true, 394#true, 66#L50-40true, 345#(= |#race~isNull_3~0| 0), 390#true, Black: 369#true, Black: 338#true, 380#(= |#race~filename_4~0| 0), Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), Black: 378#true]) [2022-11-20 11:15:13,867 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-11-20 11:15:13,867 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-20 11:15:13,867 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-11-20 11:15:13,868 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-20 11:15:13,868 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([816] L50-39-->L50-40: Formula: (= |v_thread2Thread1of1ForFork1_#t~nondet12#1_3| |v_#race~result_7~0_1|) InVars {thread2Thread1of1ForFork1_#t~nondet12#1=|v_thread2Thread1of1ForFork1_#t~nondet12#1_3|} OutVars{#race~result_7~0=|v_#race~result_7~0_1|, thread2Thread1of1ForFork1_#t~nondet12#1=|v_thread2Thread1of1ForFork1_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_7~0][140], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 394#true, Black: 357#true, 66#L50-40true, 345#(= |#race~isNull_3~0| 0), 390#true, Black: 369#true, Black: 338#true, 380#(= |#race~filename_4~0| 0), Black: 343#true, 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 371#(= |#race~filename_1~0| 0), 340#(= |#race~isNull_0~0| 0), Black: 378#true]) [2022-11-20 11:15:13,868 INFO L383 tUnfolder$Statistics]: this new event has 150 ancestors and is cut-off event [2022-11-20 11:15:13,868 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-20 11:15:13,868 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-11-20 11:15:13,869 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-20 11:15:13,869 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-20 11:15:13,885 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][166], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 394#true, Black: 357#true, 66#L50-40true, 345#(= |#race~isNull_3~0| 0), 390#true, Black: 369#true, Black: 338#true, 380#(= |#race~filename_4~0| 0), Black: 343#true, 371#(= |#race~filename_1~0| 0), 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 340#(= |#race~isNull_0~0| 0), Black: 378#true]) [2022-11-20 11:15:13,885 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is not cut-off event [2022-11-20 11:15:13,885 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is not cut-off event [2022-11-20 11:15:13,886 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is not cut-off event [2022-11-20 11:15:13,886 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is not cut-off event [2022-11-20 11:15:13,886 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is not cut-off event [2022-11-20 11:15:13,888 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([878] thread1EXIT-->L68-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4, ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_5|} AuxVars[] AssignedVars[][166], [Black: 348#true, 350#(= |#race~filename_2~0| 0), 2#L68-7true, 359#(= |#race~filename_5~0| 0), 394#true, Black: 357#true, 345#(= |#race~isNull_3~0| 0), 390#true, Black: 369#true, Black: 338#true, 380#(= |#race~filename_4~0| 0), Black: 343#true, 371#(= |#race~filename_1~0| 0), 367#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 340#(= |#race~isNull_0~0| 0), Black: 378#true, 293#L50-41true]) [2022-11-20 11:15:13,888 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is not cut-off event [2022-11-20 11:15:13,888 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is not cut-off event [2022-11-20 11:15:13,888 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is not cut-off event [2022-11-20 11:15:13,888 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is not cut-off event [2022-11-20 11:15:13,889 INFO L386 tUnfolder$Statistics]: existing Event has 179 ancestors and is not cut-off event [2022-11-20 11:15:13,934 INFO L130 PetriNetUnfolder]: 56/1135 cut-off events. [2022-11-20 11:15:13,935 INFO L131 PetriNetUnfolder]: For 24/27 co-relation queries the response was YES. [2022-11-20 11:15:13,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 1135 events. 56/1135 cut-off events. For 24/27 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6674 event pairs, 6 based on Foata normal form. 3/1071 useless extension candidates. Maximal degree in co-relation 1268. Up to 79 conditions per place. [2022-11-20 11:15:13,940 INFO L137 encePairwiseOnDemand]: 316/322 looper letters, 0 selfloop transitions, 0 changer transitions 277/277 dead transitions. [2022-11-20 11:15:13,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 277 transitions, 668 flow [2022-11-20 11:15:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:15:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:15:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2022-11-20 11:15:13,943 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9420289855072463 [2022-11-20 11:15:13,943 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 910 transitions. [2022-11-20 11:15:13,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 910 transitions. [2022-11-20 11:15:13,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:13,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 910 transitions. [2022-11-20 11:15:13,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:13,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:13,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 322.0) internal successors, (1288), 4 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:13,949 INFO L175 Difference]: Start difference. First operand has 277 places, 278 transitions, 644 flow. Second operand 3 states and 910 transitions. [2022-11-20 11:15:13,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 277 transitions, 668 flow [2022-11-20 11:15:13,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 277 transitions, 667 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 11:15:13,953 INFO L231 Difference]: Finished difference. Result has 275 places, 0 transitions, 0 flow [2022-11-20 11:15:13,953 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=275, PETRI_TRANSITIONS=0} [2022-11-20 11:15:13,956 INFO L288 CegarLoopForPetriNet]: 290 programPoint places, -15 predicate places. [2022-11-20 11:15:13,956 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 0 transitions, 0 flow [2022-11-20 11:15:13,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:13,959 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (51 of 52 remaining) [2022-11-20 11:15:13,960 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (50 of 52 remaining) [2022-11-20 11:15:13,960 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (49 of 52 remaining) [2022-11-20 11:15:13,960 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (48 of 52 remaining) [2022-11-20 11:15:13,960 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (47 of 52 remaining) [2022-11-20 11:15:13,961 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (46 of 52 remaining) [2022-11-20 11:15:13,961 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 52 remaining) [2022-11-20 11:15:13,961 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (44 of 52 remaining) [2022-11-20 11:15:13,961 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 52 remaining) [2022-11-20 11:15:13,961 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (42 of 52 remaining) [2022-11-20 11:15:13,961 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 52 remaining) [2022-11-20 11:15:13,962 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (40 of 52 remaining) [2022-11-20 11:15:13,962 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 52 remaining) [2022-11-20 11:15:13,962 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (38 of 52 remaining) [2022-11-20 11:15:13,962 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (37 of 52 remaining) [2022-11-20 11:15:13,962 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (36 of 52 remaining) [2022-11-20 11:15:13,963 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (35 of 52 remaining) [2022-11-20 11:15:13,963 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (34 of 52 remaining) [2022-11-20 11:15:13,963 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (33 of 52 remaining) [2022-11-20 11:15:13,963 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (32 of 52 remaining) [2022-11-20 11:15:13,963 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (31 of 52 remaining) [2022-11-20 11:15:13,963 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 52 remaining) [2022-11-20 11:15:13,964 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 52 remaining) [2022-11-20 11:15:13,964 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (28 of 52 remaining) [2022-11-20 11:15:13,964 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 52 remaining) [2022-11-20 11:15:13,964 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (26 of 52 remaining) [2022-11-20 11:15:13,964 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (25 of 52 remaining) [2022-11-20 11:15:13,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (24 of 52 remaining) [2022-11-20 11:15:13,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (23 of 52 remaining) [2022-11-20 11:15:13,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (22 of 52 remaining) [2022-11-20 11:15:13,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (21 of 52 remaining) [2022-11-20 11:15:13,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (20 of 52 remaining) [2022-11-20 11:15:13,966 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 52 remaining) [2022-11-20 11:15:13,967 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 52 remaining) [2022-11-20 11:15:13,967 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 52 remaining) [2022-11-20 11:15:13,967 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 52 remaining) [2022-11-20 11:15:13,967 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 52 remaining) [2022-11-20 11:15:13,967 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 52 remaining) [2022-11-20 11:15:13,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (13 of 52 remaining) [2022-11-20 11:15:13,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 52 remaining) [2022-11-20 11:15:13,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 52 remaining) [2022-11-20 11:15:13,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (10 of 52 remaining) [2022-11-20 11:15:13,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (9 of 52 remaining) [2022-11-20 11:15:13,968 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 52 remaining) [2022-11-20 11:15:13,969 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 52 remaining) [2022-11-20 11:15:13,969 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 52 remaining) [2022-11-20 11:15:13,969 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (5 of 52 remaining) [2022-11-20 11:15:13,969 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (4 of 52 remaining) [2022-11-20 11:15:13,969 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (3 of 52 remaining) [2022-11-20 11:15:13,970 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (2 of 52 remaining) [2022-11-20 11:15:13,970 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (1 of 52 remaining) [2022-11-20 11:15:13,970 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (0 of 52 remaining) [2022-11-20 11:15:13,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 11:15:13,971 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:13,978 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 11:15:13,979 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:15:13,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:15:13 BasicIcfg [2022-11-20 11:15:13,984 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:15:13,985 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:15:13,985 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:15:13,985 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:15:13,986 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:15:06" (3/4) ... [2022-11-20 11:15:13,989 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 11:15:13,996 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-20 11:15:13,996 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-20 11:15:14,005 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-20 11:15:14,006 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-20 11:15:14,006 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 11:15:14,007 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 11:15:14,076 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 11:15:14,076 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:15:14,077 INFO L158 Benchmark]: Toolchain (without parser) took 8702.33ms. Allocated memory was 151.0MB in the beginning and 237.0MB in the end (delta: 86.0MB). Free memory was 122.3MB in the beginning and 184.7MB in the end (delta: -62.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2022-11-20 11:15:14,077 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 70.1MB in the end (delta: 335.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:15:14,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.54ms. Allocated memory is still 151.0MB. Free memory was 121.9MB in the beginning and 110.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 11:15:14,078 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.56ms. Allocated memory is still 151.0MB. Free memory was 110.1MB in the beginning and 107.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:15:14,078 INFO L158 Benchmark]: Boogie Preprocessor took 47.49ms. Allocated memory is still 151.0MB. Free memory was 107.6MB in the beginning and 105.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:15:14,079 INFO L158 Benchmark]: RCFGBuilder took 1082.42ms. Allocated memory is still 151.0MB. Free memory was 105.9MB in the beginning and 82.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 11:15:14,079 INFO L158 Benchmark]: TraceAbstraction took 7081.65ms. Allocated memory was 151.0MB in the beginning and 237.0MB in the end (delta: 86.0MB). Free memory was 82.0MB in the beginning and 188.9MB in the end (delta: -106.9MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. [2022-11-20 11:15:14,080 INFO L158 Benchmark]: Witness Printer took 91.23ms. Allocated memory is still 237.0MB. Free memory was 188.9MB in the beginning and 184.7MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:15:14,084 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.24ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 70.1MB in the end (delta: 335.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.54ms. Allocated memory is still 151.0MB. Free memory was 121.9MB in the beginning and 110.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.56ms. Allocated memory is still 151.0MB. Free memory was 110.1MB in the beginning and 107.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.49ms. Allocated memory is still 151.0MB. Free memory was 107.6MB in the beginning and 105.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1082.42ms. Allocated memory is still 151.0MB. Free memory was 105.9MB in the beginning and 82.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7081.65ms. Allocated memory was 151.0MB in the beginning and 237.0MB in the end (delta: 86.0MB). Free memory was 82.0MB in the beginning and 188.9MB in the end (delta: -106.9MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. * Witness Printer took 91.23ms. Allocated memory is still 237.0MB. Free memory was 188.9MB in the beginning and 184.7MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: 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: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 455 locations, 52 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: 6.9s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 323 IncrementalHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 166 mSDtfsCounter, 323 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=655occurred in iteration=16, InterpolantAutomatonStates: 60, 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.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1289 NumberOfCodeBlocks, 1289 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1271 ConstructedInterpolants, 0 QuantifiedInterpolants, 1465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-20 11:15:14,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e5e006-eba9-4c02-b547-dcb39bd0f770/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE