./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/twostage_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/twostage_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/bin/uautomizer-TMbwUNV5ro/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9e65812efd79e833978ab1548160841e061a451f72b6ff490ed9b7c0a593a91c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 18:36:58,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:36:58,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:36:58,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:36:58,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:36:58,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:36:58,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:36:58,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:36:58,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:36:58,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:36:58,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:36:58,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:36:58,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:36:58,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:36:58,829 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:36:58,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:36:58,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:36:58,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:36:58,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:36:58,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:36:58,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:36:58,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:36:58,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:36:58,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:36:58,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:36:58,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:36:58,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:36:58,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:36:58,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:36:58,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:36:58,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:36:58,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:36:58,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:36:58,869 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:36:58,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:36:58,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:36:58,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:36:58,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:36:58,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:36:58,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:36:58,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:36:58,874 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/bin/uautomizer-TMbwUNV5ro/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-18 18:36:58,919 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:36:58,919 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:36:58,920 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:36:58,920 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:36:58,921 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:36:58,921 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:36:58,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:36:58,922 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:36:58,922 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:36:58,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:36:58,924 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:36:58,924 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 18:36:58,924 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:36:58,924 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:36:58,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:36:58,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 18:36:58,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:36:58,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 18:36:58,925 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-18 18:36:58,926 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:36:58,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 18:36:58,926 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:36:58,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 18:36:58,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:36:58,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:36:58,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:36:58,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:36:58,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:36:58,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:36:58,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 18:36:58,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 18:36:58,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 18:36:58,929 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 18:36:58,929 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 18:36:58,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 18:36:58,929 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_49ae9b75-dc1b-4a24-b98c-a73b42e00052/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9e65812efd79e833978ab1548160841e061a451f72b6ff490ed9b7c0a593a91c [2022-11-18 18:36:59,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:36:59,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:36:59,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:36:59,278 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:36:59,279 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:36:59,280 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread/twostage_3.i [2022-11-18 18:36:59,349 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/bin/uautomizer-TMbwUNV5ro/data/f1e509446/ee3b5706f5d34d3787f5403cf6cda6a5/FLAG65c46e934 [2022-11-18 18:36:59,962 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:36:59,966 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/sv-benchmarks/c/pthread/twostage_3.i [2022-11-18 18:36:59,991 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/bin/uautomizer-TMbwUNV5ro/data/f1e509446/ee3b5706f5d34d3787f5403cf6cda6a5/FLAG65c46e934 [2022-11-18 18:37:00,206 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/bin/uautomizer-TMbwUNV5ro/data/f1e509446/ee3b5706f5d34d3787f5403cf6cda6a5 [2022-11-18 18:37:00,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:37:00,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:37:00,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:37:00,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:37:00,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:37:00,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:37:00" (1/1) ... [2022-11-18 18:37:00,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb8c4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:00, skipping insertion in model container [2022-11-18 18:37:00,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:37:00" (1/1) ... [2022-11-18 18:37:00,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:37:00,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:37:01,041 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/sv-benchmarks/c/pthread/twostage_3.i[58991,59004] [2022-11-18 18:37:01,063 WARN L1568 CHandler]: Possible shadowing of function lock [2022-11-18 18:37:01,072 WARN L1568 CHandler]: Possible shadowing of function lock [2022-11-18 18:37:01,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:37:01,088 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:37:01,129 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/sv-benchmarks/c/pthread/twostage_3.i[58991,59004] [2022-11-18 18:37:01,145 WARN L1568 CHandler]: Possible shadowing of function lock [2022-11-18 18:37:01,146 WARN L1568 CHandler]: Possible shadowing of function lock [2022-11-18 18:37:01,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:37:01,249 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:37:01,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:01 WrapperNode [2022-11-18 18:37:01,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:37:01,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:37:01,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:37:01,251 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:37:01,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:01" (1/1) ... [2022-11-18 18:37:01,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:01" (1/1) ... [2022-11-18 18:37:01,335 INFO L138 Inliner]: procedures = 372, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 237 [2022-11-18 18:37:01,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:37:01,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:37:01,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:37:01,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:37:01,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:01" (1/1) ... [2022-11-18 18:37:01,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:01" (1/1) ... [2022-11-18 18:37:01,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:01" (1/1) ... [2022-11-18 18:37:01,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:01" (1/1) ... [2022-11-18 18:37:01,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:01" (1/1) ... [2022-11-18 18:37:01,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:01" (1/1) ... [2022-11-18 18:37:01,375 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:01" (1/1) ... [2022-11-18 18:37:01,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:01" (1/1) ... [2022-11-18 18:37:01,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:37:01,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:37:01,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:37:01,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:37:01,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:01" (1/1) ... [2022-11-18 18:37:01,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:37:01,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:37:01,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:37:01,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49ae9b75-dc1b-4a24-b98c-a73b42e00052/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:37:01,454 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2022-11-18 18:37:01,454 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2022-11-18 18:37:01,454 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2022-11-18 18:37:01,455 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2022-11-18 18:37:01,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 18:37:01,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 18:37:01,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 18:37:01,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 18:37:01,455 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-18 18:37:01,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 18:37:01,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:37:01,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 18:37:01,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:37:01,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:37:01,458 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 18:37:01,608 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:37:01,611 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:37:02,327 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:37:02,338 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:37:02,339 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 18:37:02,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:37:02 BoogieIcfgContainer [2022-11-18 18:37:02,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:37:02,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:37:02,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:37:02,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:37:02,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:37:00" (1/3) ... [2022-11-18 18:37:02,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629347c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:37:02, skipping insertion in model container [2022-11-18 18:37:02,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:37:01" (2/3) ... [2022-11-18 18:37:02,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@629347c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:37:02, skipping insertion in model container [2022-11-18 18:37:02,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:37:02" (3/3) ... [2022-11-18 18:37:02,351 INFO L112 eAbstractionObserver]: Analyzing ICFG twostage_3.i [2022-11-18 18:37:02,359 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 18:37:02,369 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:37:02,369 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2022-11-18 18:37:02,369 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 18:37:02,454 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-18 18:37:02,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 328 places, 341 transitions, 704 flow [2022-11-18 18:37:02,757 INFO L130 PetriNetUnfolder]: 39/662 cut-off events. [2022-11-18 18:37:02,757 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-18 18:37:02,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 662 events. 39/662 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2746 event pairs, 0 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 360. Up to 8 conditions per place. [2022-11-18 18:37:02,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 328 places, 341 transitions, 704 flow [2022-11-18 18:37:02,789 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 328 places, 341 transitions, 704 flow [2022-11-18 18:37:02,808 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:37:02,817 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;@145ddef1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:37:02,817 INFO L358 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2022-11-18 18:37:02,829 INFO L130 PetriNetUnfolder]: 0/48 cut-off events. [2022-11-18 18:37:02,829 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:37:02,830 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:02,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] [2022-11-18 18:37:02,832 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-18 18:37:02,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:02,839 INFO L85 PathProgramCache]: Analyzing trace with hash -307706405, now seen corresponding path program 1 times [2022-11-18 18:37:02,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:02,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120135879] [2022-11-18 18:37:02,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:02,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:03,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:03,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120135879] [2022-11-18 18:37:03,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120135879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:03,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:03,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:37:03,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965634621] [2022-11-18 18:37:03,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:03,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:37:03,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:03,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:37:03,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:37:03,224 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 341 [2022-11-18 18:37:03,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 341 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:03,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:03,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 341 [2022-11-18 18:37:03,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:03,445 INFO L130 PetriNetUnfolder]: 31/658 cut-off events. [2022-11-18 18:37:03,445 INFO L131 PetriNetUnfolder]: For 47/55 co-relation queries the response was YES. [2022-11-18 18:37:03,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 658 events. 31/658 cut-off events. For 47/55 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2720 event pairs, 8 based on Foata normal form. 62/638 useless extension candidates. Maximal degree in co-relation 371. Up to 68 conditions per place. [2022-11-18 18:37:03,452 INFO L137 encePairwiseOnDemand]: 313/341 looper letters, 15 selfloop transitions, 5 changer transitions 14/326 dead transitions. [2022-11-18 18:37:03,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 326 transitions, 736 flow [2022-11-18 18:37:03,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:37:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 18:37:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 945 transitions. [2022-11-18 18:37:03,478 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9237536656891495 [2022-11-18 18:37:03,478 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 945 transitions. [2022-11-18 18:37:03,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 945 transitions. [2022-11-18 18:37:03,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:03,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 945 transitions. [2022-11-18 18:37:03,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:03,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:03,501 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:03,504 INFO L175 Difference]: Start difference. First operand has 328 places, 341 transitions, 704 flow. Second operand 3 states and 945 transitions. [2022-11-18 18:37:03,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 326 transitions, 736 flow [2022-11-18 18:37:03,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 326 transitions, 736 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 18:37:03,520 INFO L231 Difference]: Finished difference. Result has 322 places, 310 transitions, 661 flow [2022-11-18 18:37:03,522 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=661, PETRI_PLACES=322, PETRI_TRANSITIONS=310} [2022-11-18 18:37:03,527 INFO L288 CegarLoopForPetriNet]: 328 programPoint places, -6 predicate places. [2022-11-18 18:37:03,527 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 310 transitions, 661 flow [2022-11-18 18:37:03,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:03,528 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:03,528 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] [2022-11-18 18:37:03,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 18:37:03,529 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-18 18:37:03,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:03,530 INFO L85 PathProgramCache]: Analyzing trace with hash -905314941, now seen corresponding path program 1 times [2022-11-18 18:37:03,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:03,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032779479] [2022-11-18 18:37:03,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:03,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:03,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:03,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032779479] [2022-11-18 18:37:03,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032779479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:03,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:03,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:37:03,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053537869] [2022-11-18 18:37:03,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:03,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:37:03,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:03,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:37:03,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:37:03,627 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 341 [2022-11-18 18:37:03,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 310 transitions, 661 flow. Second operand has 3 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-18 18:37:03,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:03,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 341 [2022-11-18 18:37:03,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:04,030 INFO L130 PetriNetUnfolder]: 69/1195 cut-off events. [2022-11-18 18:37:04,030 INFO L131 PetriNetUnfolder]: For 160/502 co-relation queries the response was YES. [2022-11-18 18:37:04,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 1195 events. 69/1195 cut-off events. For 160/502 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6861 event pairs, 39 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 1285. Up to 115 conditions per place. [2022-11-18 18:37:04,042 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 21 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2022-11-18 18:37:04,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 309 transitions, 705 flow [2022-11-18 18:37:04,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:37:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 18:37:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 936 transitions. [2022-11-18 18:37:04,048 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9149560117302052 [2022-11-18 18:37:04,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 936 transitions. [2022-11-18 18:37:04,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 936 transitions. [2022-11-18 18:37:04,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:04,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 936 transitions. [2022-11-18 18:37:04,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:04,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:04,055 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:04,055 INFO L175 Difference]: Start difference. First operand has 322 places, 310 transitions, 661 flow. Second operand 3 states and 936 transitions. [2022-11-18 18:37:04,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 309 transitions, 705 flow [2022-11-18 18:37:04,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 309 transitions, 705 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 18:37:04,065 INFO L231 Difference]: Finished difference. Result has 311 places, 309 transitions, 663 flow [2022-11-18 18:37:04,066 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=663, PETRI_PLACES=311, PETRI_TRANSITIONS=309} [2022-11-18 18:37:04,067 INFO L288 CegarLoopForPetriNet]: 328 programPoint places, -17 predicate places. [2022-11-18 18:37:04,067 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 309 transitions, 663 flow [2022-11-18 18:37:04,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-18 18:37:04,068 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:04,068 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:37:04,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 18:37:04,069 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-18 18:37:04,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:04,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2122158736, now seen corresponding path program 1 times [2022-11-18 18:37:04,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:04,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604069159] [2022-11-18 18:37:04,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:04,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:04,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:04,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604069159] [2022-11-18 18:37:04,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604069159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:04,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:04,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:37:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854149281] [2022-11-18 18:37:04,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:04,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:37:04,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:04,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:37:04,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:37:04,676 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 341 [2022-11-18 18:37:04,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 309 transitions, 663 flow. Second operand has 6 states, 6 states have (on average 254.66666666666666) internal successors, (1528), 6 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:04,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:04,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 341 [2022-11-18 18:37:04,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:05,060 INFO L130 PetriNetUnfolder]: 13/614 cut-off events. [2022-11-18 18:37:05,060 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-18 18:37:05,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 614 events. 13/614 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2344 event pairs, 0 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 780. Up to 175 conditions per place. [2022-11-18 18:37:05,068 INFO L137 encePairwiseOnDemand]: 335/341 looper letters, 69 selfloop transitions, 5 changer transitions 0/308 dead transitions. [2022-11-18 18:37:05,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 308 transitions, 809 flow [2022-11-18 18:37:05,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:37:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 18:37:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1593 transitions. [2022-11-18 18:37:05,074 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7785923753665689 [2022-11-18 18:37:05,074 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1593 transitions. [2022-11-18 18:37:05,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1593 transitions. [2022-11-18 18:37:05,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:05,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1593 transitions. [2022-11-18 18:37:05,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 265.5) internal successors, (1593), 6 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:05,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:05,085 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:05,086 INFO L175 Difference]: Start difference. First operand has 311 places, 309 transitions, 663 flow. Second operand 6 states and 1593 transitions. [2022-11-18 18:37:05,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 308 transitions, 809 flow [2022-11-18 18:37:05,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 308 transitions, 805 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 18:37:05,093 INFO L231 Difference]: Finished difference. Result has 313 places, 308 transitions, 667 flow [2022-11-18 18:37:05,094 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=667, PETRI_PLACES=313, PETRI_TRANSITIONS=308} [2022-11-18 18:37:05,096 INFO L288 CegarLoopForPetriNet]: 328 programPoint places, -15 predicate places. [2022-11-18 18:37:05,097 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 308 transitions, 667 flow [2022-11-18 18:37:05,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 254.66666666666666) internal successors, (1528), 6 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:05,098 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:05,098 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] [2022-11-18 18:37:05,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 18:37:05,099 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-18 18:37:05,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:05,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1975987095, now seen corresponding path program 1 times [2022-11-18 18:37:05,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:05,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495526045] [2022-11-18 18:37:05,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:05,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:05,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:05,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495526045] [2022-11-18 18:37:05,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495526045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:05,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:05,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:37:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522128932] [2022-11-18 18:37:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:05,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:37:05,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:05,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:37:05,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:37:05,162 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 341 [2022-11-18 18:37:05,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 308 transitions, 667 flow. Second operand has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:05,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:05,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 341 [2022-11-18 18:37:05,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:05,347 INFO L130 PetriNetUnfolder]: 49/797 cut-off events. [2022-11-18 18:37:05,347 INFO L131 PetriNetUnfolder]: For 118/158 co-relation queries the response was YES. [2022-11-18 18:37:05,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 797 events. 49/797 cut-off events. For 118/158 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3660 event pairs, 24 based on Foata normal form. 0/688 useless extension candidates. Maximal degree in co-relation 954. Up to 83 conditions per place. [2022-11-18 18:37:05,356 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 18 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2022-11-18 18:37:05,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 307 transitions, 705 flow [2022-11-18 18:37:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:37:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 18:37:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 942 transitions. [2022-11-18 18:37:05,363 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9208211143695014 [2022-11-18 18:37:05,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 942 transitions. [2022-11-18 18:37:05,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 942 transitions. [2022-11-18 18:37:05,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:05,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 942 transitions. [2022-11-18 18:37:05,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:05,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:05,372 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:05,372 INFO L175 Difference]: Start difference. First operand has 313 places, 308 transitions, 667 flow. Second operand 3 states and 942 transitions. [2022-11-18 18:37:05,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 307 transitions, 705 flow [2022-11-18 18:37:05,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 307 transitions, 695 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 18:37:05,385 INFO L231 Difference]: Finished difference. Result has 309 places, 307 transitions, 659 flow [2022-11-18 18:37:05,386 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=659, PETRI_PLACES=309, PETRI_TRANSITIONS=307} [2022-11-18 18:37:05,387 INFO L288 CegarLoopForPetriNet]: 328 programPoint places, -19 predicate places. [2022-11-18 18:37:05,388 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 307 transitions, 659 flow [2022-11-18 18:37:05,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:05,389 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:05,389 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] [2022-11-18 18:37:05,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 18:37:05,390 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-18 18:37:05,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:05,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1618713773, now seen corresponding path program 1 times [2022-11-18 18:37:05,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:05,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031793767] [2022-11-18 18:37:05,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:05,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:05,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:05,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031793767] [2022-11-18 18:37:05,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031793767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:05,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:05,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:37:05,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602411855] [2022-11-18 18:37:05,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:05,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:37:05,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:05,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:37:05,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:37:05,449 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 341 [2022-11-18 18:37:05,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 307 transitions, 659 flow. Second operand has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:05,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:05,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 341 [2022-11-18 18:37:05,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:05,663 INFO L130 PetriNetUnfolder]: 49/1063 cut-off events. [2022-11-18 18:37:05,663 INFO L131 PetriNetUnfolder]: For 111/263 co-relation queries the response was YES. [2022-11-18 18:37:05,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 1063 events. 49/1063 cut-off events. For 111/263 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5555 event pairs, 22 based on Foata normal form. 0/930 useless extension candidates. Maximal degree in co-relation 1152. Up to 71 conditions per place. [2022-11-18 18:37:05,673 INFO L137 encePairwiseOnDemand]: 336/341 looper letters, 15 selfloop transitions, 1 changer transitions 0/303 dead transitions. [2022-11-18 18:37:05,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 303 transitions, 683 flow [2022-11-18 18:37:05,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:37:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 18:37:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 941 transitions. [2022-11-18 18:37:05,676 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9198435972629521 [2022-11-18 18:37:05,676 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 941 transitions. [2022-11-18 18:37:05,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 941 transitions. [2022-11-18 18:37:05,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:05,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 941 transitions. [2022-11-18 18:37:05,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:05,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:05,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:05,683 INFO L175 Difference]: Start difference. First operand has 309 places, 307 transitions, 659 flow. Second operand 3 states and 941 transitions. [2022-11-18 18:37:05,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 303 transitions, 683 flow [2022-11-18 18:37:05,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 303 transitions, 679 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 18:37:05,690 INFO L231 Difference]: Finished difference. Result has 305 places, 303 transitions, 649 flow [2022-11-18 18:37:05,691 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=649, PETRI_PLACES=305, PETRI_TRANSITIONS=303} [2022-11-18 18:37:05,693 INFO L288 CegarLoopForPetriNet]: 328 programPoint places, -23 predicate places. [2022-11-18 18:37:05,694 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 303 transitions, 649 flow [2022-11-18 18:37:05,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:05,695 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:05,695 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] [2022-11-18 18:37:05,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 18:37:05,696 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-18 18:37:05,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:05,697 INFO L85 PathProgramCache]: Analyzing trace with hash 922553132, now seen corresponding path program 1 times [2022-11-18 18:37:05,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:05,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013950547] [2022-11-18 18:37:05,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:05,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:06,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:06,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013950547] [2022-11-18 18:37:06,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013950547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:06,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:06,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:37:06,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077772803] [2022-11-18 18:37:06,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:06,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:37:06,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:06,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:37:06,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:37:06,071 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 341 [2022-11-18 18:37:06,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 303 transitions, 649 flow. Second operand has 6 states, 6 states have (on average 255.5) internal successors, (1533), 6 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:06,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:06,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 341 [2022-11-18 18:37:06,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:06,338 INFO L130 PetriNetUnfolder]: 13/606 cut-off events. [2022-11-18 18:37:06,339 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-18 18:37:06,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 606 events. 13/606 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2267 event pairs, 0 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 772. Up to 176 conditions per place. [2022-11-18 18:37:06,345 INFO L137 encePairwiseOnDemand]: 335/341 looper letters, 68 selfloop transitions, 5 changer transitions 0/302 dead transitions. [2022-11-18 18:37:06,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 302 transitions, 793 flow [2022-11-18 18:37:06,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:37:06,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 18:37:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1592 transitions. [2022-11-18 18:37:06,349 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7781036168132942 [2022-11-18 18:37:06,350 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1592 transitions. [2022-11-18 18:37:06,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1592 transitions. [2022-11-18 18:37:06,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:06,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1592 transitions. [2022-11-18 18:37:06,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 265.3333333333333) internal successors, (1592), 6 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:06,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:06,360 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:06,361 INFO L175 Difference]: Start difference. First operand has 305 places, 303 transitions, 649 flow. Second operand 6 states and 1592 transitions. [2022-11-18 18:37:06,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 302 transitions, 793 flow [2022-11-18 18:37:06,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 302 transitions, 792 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 18:37:06,372 INFO L231 Difference]: Finished difference. Result has 308 places, 302 transitions, 656 flow [2022-11-18 18:37:06,373 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=656, PETRI_PLACES=308, PETRI_TRANSITIONS=302} [2022-11-18 18:37:06,374 INFO L288 CegarLoopForPetriNet]: 328 programPoint places, -20 predicate places. [2022-11-18 18:37:06,374 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 302 transitions, 656 flow [2022-11-18 18:37:06,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.5) internal successors, (1533), 6 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:06,375 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:06,375 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] [2022-11-18 18:37:06,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 18:37:06,375 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-18 18:37:06,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:06,376 INFO L85 PathProgramCache]: Analyzing trace with hash 902402376, now seen corresponding path program 1 times [2022-11-18 18:37:06,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:06,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592301022] [2022-11-18 18:37:06,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:06,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:06,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:06,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592301022] [2022-11-18 18:37:06,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592301022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:06,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:06,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:37:06,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058572378] [2022-11-18 18:37:06,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:06,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:37:06,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:06,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:37:06,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:37:06,447 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 341 [2022-11-18 18:37:06,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 302 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:06,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:06,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 341 [2022-11-18 18:37:06,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:06,616 INFO L130 PetriNetUnfolder]: 36/753 cut-off events. [2022-11-18 18:37:06,616 INFO L131 PetriNetUnfolder]: For 89/115 co-relation queries the response was YES. [2022-11-18 18:37:06,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 753 events. 36/753 cut-off events. For 89/115 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3292 event pairs, 14 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 881. Up to 53 conditions per place. [2022-11-18 18:37:06,624 INFO L137 encePairwiseOnDemand]: 337/341 looper letters, 13 selfloop transitions, 1 changer transitions 0/299 dead transitions. [2022-11-18 18:37:06,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 299 transitions, 678 flow [2022-11-18 18:37:06,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:37:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 18:37:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 947 transitions. [2022-11-18 18:37:06,627 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9257086999022482 [2022-11-18 18:37:06,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 947 transitions. [2022-11-18 18:37:06,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 947 transitions. [2022-11-18 18:37:06,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:06,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 947 transitions. [2022-11-18 18:37:06,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:06,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:06,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:06,633 INFO L175 Difference]: Start difference. First operand has 308 places, 302 transitions, 656 flow. Second operand 3 states and 947 transitions. [2022-11-18 18:37:06,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 299 transitions, 678 flow [2022-11-18 18:37:06,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 299 transitions, 668 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 18:37:06,640 INFO L231 Difference]: Finished difference. Result has 302 places, 299 transitions, 642 flow [2022-11-18 18:37:06,641 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=302, PETRI_TRANSITIONS=299} [2022-11-18 18:37:06,643 INFO L288 CegarLoopForPetriNet]: 328 programPoint places, -26 predicate places. [2022-11-18 18:37:06,643 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 299 transitions, 642 flow [2022-11-18 18:37:06,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:06,644 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:06,644 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:37:06,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 18:37:06,644 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-18 18:37:06,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:06,645 INFO L85 PathProgramCache]: Analyzing trace with hash 201309120, now seen corresponding path program 1 times [2022-11-18 18:37:06,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:06,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560098071] [2022-11-18 18:37:06,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:06,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:06,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:06,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560098071] [2022-11-18 18:37:06,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560098071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:06,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:06,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:37:06,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145747068] [2022-11-18 18:37:06,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:06,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:37:06,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:06,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:37:06,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:37:06,999 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 341 [2022-11-18 18:37:07,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 299 transitions, 642 flow. Second operand has 6 states, 6 states have (on average 257.3333333333333) internal successors, (1544), 6 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:07,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:07,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 341 [2022-11-18 18:37:07,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:07,280 INFO L130 PetriNetUnfolder]: 13/595 cut-off events. [2022-11-18 18:37:07,280 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-18 18:37:07,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 595 events. 13/595 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2198 event pairs, 0 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 750. Up to 151 conditions per place. [2022-11-18 18:37:07,285 INFO L137 encePairwiseOnDemand]: 334/341 looper letters, 63 selfloop transitions, 4 changer transitions 0/296 dead transitions. [2022-11-18 18:37:07,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 296 transitions, 770 flow [2022-11-18 18:37:07,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:37:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 18:37:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1606 transitions. [2022-11-18 18:37:07,289 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7849462365591398 [2022-11-18 18:37:07,290 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1606 transitions. [2022-11-18 18:37:07,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1606 transitions. [2022-11-18 18:37:07,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:07,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1606 transitions. [2022-11-18 18:37:07,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 267.6666666666667) internal successors, (1606), 6 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:07,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:07,298 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:07,298 INFO L175 Difference]: Start difference. First operand has 302 places, 299 transitions, 642 flow. Second operand 6 states and 1606 transitions. [2022-11-18 18:37:07,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 296 transitions, 770 flow [2022-11-18 18:37:07,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 296 transitions, 769 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 18:37:07,304 INFO L231 Difference]: Finished difference. Result has 303 places, 296 transitions, 643 flow [2022-11-18 18:37:07,305 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=643, PETRI_PLACES=303, PETRI_TRANSITIONS=296} [2022-11-18 18:37:07,305 INFO L288 CegarLoopForPetriNet]: 328 programPoint places, -25 predicate places. [2022-11-18 18:37:07,305 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 296 transitions, 643 flow [2022-11-18 18:37:07,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.3333333333333) internal successors, (1544), 6 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:07,306 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:07,307 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-18 18:37:07,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 18:37:07,307 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-18 18:37:07,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:07,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1803236281, now seen corresponding path program 1 times [2022-11-18 18:37:07,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:07,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005303015] [2022-11-18 18:37:07,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:07,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:07,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:07,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005303015] [2022-11-18 18:37:07,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005303015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:07,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:07,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:37:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954380673] [2022-11-18 18:37:07,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:07,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:37:07,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:07,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:37:07,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:37:07,672 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 341 [2022-11-18 18:37:07,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 296 transitions, 643 flow. Second operand has 6 states, 6 states have (on average 258.1666666666667) internal successors, (1549), 6 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:07,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:07,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 341 [2022-11-18 18:37:07,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:07,933 INFO L130 PetriNetUnfolder]: 13/586 cut-off events. [2022-11-18 18:37:07,933 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-11-18 18:37:07,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 586 events. 13/586 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2143 event pairs, 0 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 738. Up to 139 conditions per place. [2022-11-18 18:37:07,939 INFO L137 encePairwiseOnDemand]: 334/341 looper letters, 60 selfloop transitions, 4 changer transitions 0/293 dead transitions. [2022-11-18 18:37:07,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 293 transitions, 765 flow [2022-11-18 18:37:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:37:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 18:37:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1603 transitions. [2022-11-18 18:37:07,943 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7834799608993157 [2022-11-18 18:37:07,943 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1603 transitions. [2022-11-18 18:37:07,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1603 transitions. [2022-11-18 18:37:07,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:07,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1603 transitions. [2022-11-18 18:37:07,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 267.1666666666667) internal successors, (1603), 6 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:07,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:07,952 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:07,952 INFO L175 Difference]: Start difference. First operand has 303 places, 296 transitions, 643 flow. Second operand 6 states and 1603 transitions. [2022-11-18 18:37:07,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 293 transitions, 765 flow [2022-11-18 18:37:07,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 293 transitions, 758 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 18:37:07,958 INFO L231 Difference]: Finished difference. Result has 301 places, 293 transitions, 638 flow [2022-11-18 18:37:07,959 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=638, PETRI_PLACES=301, PETRI_TRANSITIONS=293} [2022-11-18 18:37:07,960 INFO L288 CegarLoopForPetriNet]: 328 programPoint places, -27 predicate places. [2022-11-18 18:37:07,960 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 293 transitions, 638 flow [2022-11-18 18:37:07,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 258.1666666666667) internal successors, (1549), 6 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:07,961 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:07,961 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:37:07,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 18:37:07,961 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting funcAErr0ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-18 18:37:07,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:07,962 INFO L85 PathProgramCache]: Analyzing trace with hash -96770859, now seen corresponding path program 1 times [2022-11-18 18:37:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:07,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404975963] [2022-11-18 18:37:07,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:07,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:08,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:08,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404975963] [2022-11-18 18:37:08,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404975963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:08,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:08,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:37:08,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597415789] [2022-11-18 18:37:08,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:08,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:37:08,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:08,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:37:08,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:37:08,040 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 341 [2022-11-18 18:37:08,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 293 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:08,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:08,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 341 [2022-11-18 18:37:08,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:08,354 INFO L130 PetriNetUnfolder]: 137/1591 cut-off events. [2022-11-18 18:37:08,354 INFO L131 PetriNetUnfolder]: For 290/1702 co-relation queries the response was YES. [2022-11-18 18:37:08,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1992 conditions, 1591 events. 137/1591 cut-off events. For 290/1702 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10706 event pairs, 63 based on Foata normal form. 4/1392 useless extension candidates. Maximal degree in co-relation 1910. Up to 188 conditions per place. [2022-11-18 18:37:08,373 INFO L137 encePairwiseOnDemand]: 335/341 looper letters, 26 selfloop transitions, 5 changer transitions 0/304 dead transitions. [2022-11-18 18:37:08,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 304 transitions, 731 flow [2022-11-18 18:37:08,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:37:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 18:37:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2022-11-18 18:37:08,377 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9345063538611925 [2022-11-18 18:37:08,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 956 transitions. [2022-11-18 18:37:08,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 956 transitions. [2022-11-18 18:37:08,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:08,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 956 transitions. [2022-11-18 18:37:08,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:08,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:08,383 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:08,383 INFO L175 Difference]: Start difference. First operand has 301 places, 293 transitions, 638 flow. Second operand 3 states and 956 transitions. [2022-11-18 18:37:08,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 304 transitions, 731 flow [2022-11-18 18:37:08,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 304 transitions, 724 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 18:37:08,389 INFO L231 Difference]: Finished difference. Result has 301 places, 297 transitions, 669 flow [2022-11-18 18:37:08,390 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=301, PETRI_TRANSITIONS=297} [2022-11-18 18:37:08,391 INFO L288 CegarLoopForPetriNet]: 328 programPoint places, -27 predicate places. [2022-11-18 18:37:08,391 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 297 transitions, 669 flow [2022-11-18 18:37:08,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:08,391 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:08,392 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-18 18:37:08,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 18:37:08,392 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting funcAErr2ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-18 18:37:08,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:08,392 INFO L85 PathProgramCache]: Analyzing trace with hash 158374074, now seen corresponding path program 1 times [2022-11-18 18:37:08,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:08,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030818496] [2022-11-18 18:37:08,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:08,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:08,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:08,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030818496] [2022-11-18 18:37:08,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030818496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:08,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:08,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:37:08,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673965452] [2022-11-18 18:37:08,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:08,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:37:08,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:08,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:37:08,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:37:08,468 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 341 [2022-11-18 18:37:08,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 297 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:08,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:08,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 341 [2022-11-18 18:37:08,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:08,793 INFO L130 PetriNetUnfolder]: 100/1680 cut-off events. [2022-11-18 18:37:08,793 INFO L131 PetriNetUnfolder]: For 308/1288 co-relation queries the response was YES. [2022-11-18 18:37:08,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2113 conditions, 1680 events. 100/1680 cut-off events. For 308/1288 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 11637 event pairs, 27 based on Foata normal form. 6/1523 useless extension candidates. Maximal degree in co-relation 2030. Up to 134 conditions per place. [2022-11-18 18:37:08,817 INFO L137 encePairwiseOnDemand]: 332/341 looper letters, 23 selfloop transitions, 8 changer transitions 0/307 dead transitions. [2022-11-18 18:37:08,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 307 transitions, 774 flow [2022-11-18 18:37:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:37:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 18:37:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2022-11-18 18:37:08,820 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2022-11-18 18:37:08,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 960 transitions. [2022-11-18 18:37:08,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 960 transitions. [2022-11-18 18:37:08,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:08,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 960 transitions. [2022-11-18 18:37:08,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 320.0) internal successors, (960), 3 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:08,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:08,871 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:08,871 INFO L175 Difference]: Start difference. First operand has 301 places, 297 transitions, 669 flow. Second operand 3 states and 960 transitions. [2022-11-18 18:37:08,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 307 transitions, 774 flow [2022-11-18 18:37:08,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 307 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 18:37:08,879 INFO L231 Difference]: Finished difference. Result has 302 places, 303 transitions, 729 flow [2022-11-18 18:37:08,880 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=729, PETRI_PLACES=302, PETRI_TRANSITIONS=303} [2022-11-18 18:37:08,881 INFO L288 CegarLoopForPetriNet]: 328 programPoint places, -26 predicate places. [2022-11-18 18:37:08,881 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 303 transitions, 729 flow [2022-11-18 18:37:08,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:08,881 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:08,882 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:37:08,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 18:37:08,882 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-18 18:37:08,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:08,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1008485893, now seen corresponding path program 1 times [2022-11-18 18:37:08,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:08,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233239081] [2022-11-18 18:37:08,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:08,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:37:08,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 18:37:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:37:09,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 18:37:09,031 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 18:37:09,032 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 47 remaining) [2022-11-18 18:37:09,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr0ASSERT_VIOLATIONDATA_RACE (45 of 47 remaining) [2022-11-18 18:37:09,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr1ASSERT_VIOLATIONDATA_RACE (44 of 47 remaining) [2022-11-18 18:37:09,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr2ASSERT_VIOLATIONDATA_RACE (43 of 47 remaining) [2022-11-18 18:37:09,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr3ASSERT_VIOLATIONDATA_RACE (42 of 47 remaining) [2022-11-18 18:37:09,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr4ASSERT_VIOLATIONDATA_RACE (41 of 47 remaining) [2022-11-18 18:37:09,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (40 of 47 remaining) [2022-11-18 18:37:09,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 47 remaining) [2022-11-18 18:37:09,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 47 remaining) [2022-11-18 18:37:09,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 47 remaining) [2022-11-18 18:37:09,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (36 of 47 remaining) [2022-11-18 18:37:09,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (35 of 47 remaining) [2022-11-18 18:37:09,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 47 remaining) [2022-11-18 18:37:09,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 47 remaining) [2022-11-18 18:37:09,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (32 of 47 remaining) [2022-11-18 18:37:09,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (31 of 47 remaining) [2022-11-18 18:37:09,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (30 of 47 remaining) [2022-11-18 18:37:09,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (29 of 47 remaining) [2022-11-18 18:37:09,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (28 of 47 remaining) [2022-11-18 18:37:09,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (27 of 47 remaining) [2022-11-18 18:37:09,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (26 of 47 remaining) [2022-11-18 18:37:09,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (25 of 47 remaining) [2022-11-18 18:37:09,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (24 of 47 remaining) [2022-11-18 18:37:09,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (23 of 47 remaining) [2022-11-18 18:37:09,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (22 of 47 remaining) [2022-11-18 18:37:09,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (21 of 47 remaining) [2022-11-18 18:37:09,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (20 of 47 remaining) [2022-11-18 18:37:09,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 47 remaining) [2022-11-18 18:37:09,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONDATA_RACE (18 of 47 remaining) [2022-11-18 18:37:09,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr1ASSERT_VIOLATIONDATA_RACE (17 of 47 remaining) [2022-11-18 18:37:09,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr2ASSERT_VIOLATIONDATA_RACE (16 of 47 remaining) [2022-11-18 18:37:09,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr3ASSERT_VIOLATIONDATA_RACE (15 of 47 remaining) [2022-11-18 18:37:09,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr4ASSERT_VIOLATIONDATA_RACE (14 of 47 remaining) [2022-11-18 18:37:09,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr5ASSERT_VIOLATIONDATA_RACE (13 of 47 remaining) [2022-11-18 18:37:09,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr6ASSERT_VIOLATIONDATA_RACE (12 of 47 remaining) [2022-11-18 18:37:09,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr0ASSERT_VIOLATIONDATA_RACE (11 of 47 remaining) [2022-11-18 18:37:09,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr1ASSERT_VIOLATIONDATA_RACE (10 of 47 remaining) [2022-11-18 18:37:09,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr2ASSERT_VIOLATIONDATA_RACE (9 of 47 remaining) [2022-11-18 18:37:09,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr3ASSERT_VIOLATIONDATA_RACE (8 of 47 remaining) [2022-11-18 18:37:09,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr4ASSERT_VIOLATIONDATA_RACE (7 of 47 remaining) [2022-11-18 18:37:09,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONDATA_RACE (6 of 47 remaining) [2022-11-18 18:37:09,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr1ASSERT_VIOLATIONDATA_RACE (5 of 47 remaining) [2022-11-18 18:37:09,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr2ASSERT_VIOLATIONDATA_RACE (4 of 47 remaining) [2022-11-18 18:37:09,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr3ASSERT_VIOLATIONDATA_RACE (3 of 47 remaining) [2022-11-18 18:37:09,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr4ASSERT_VIOLATIONDATA_RACE (2 of 47 remaining) [2022-11-18 18:37:09,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr5ASSERT_VIOLATIONDATA_RACE (1 of 47 remaining) [2022-11-18 18:37:09,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr6ASSERT_VIOLATIONDATA_RACE (0 of 47 remaining) [2022-11-18 18:37:09,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 18:37:09,043 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:37:09,046 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-18 18:37:09,046 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-18 18:37:09,119 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2022-11-18 18:37:09,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 405 places, 420 transitions, 888 flow [2022-11-18 18:37:09,578 INFO L130 PetriNetUnfolder]: 155/1973 cut-off events. [2022-11-18 18:37:09,578 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-11-18 18:37:09,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2070 conditions, 1973 events. 155/1973 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 12218 event pairs, 1 based on Foata normal form. 0/1654 useless extension candidates. Maximal degree in co-relation 1159. Up to 32 conditions per place. [2022-11-18 18:37:09,600 INFO L82 GeneralOperation]: Start removeDead. Operand has 405 places, 420 transitions, 888 flow [2022-11-18 18:37:09,618 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 405 places, 420 transitions, 888 flow [2022-11-18 18:37:09,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:37:09,621 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;@145ddef1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:37:09,621 INFO L358 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2022-11-18 18:37:09,625 INFO L130 PetriNetUnfolder]: 0/48 cut-off events. [2022-11-18 18:37:09,625 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:37:09,625 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:09,625 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] [2022-11-18 18:37:09,626 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2022-11-18 18:37:09,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:09,626 INFO L85 PathProgramCache]: Analyzing trace with hash 598732571, now seen corresponding path program 1 times [2022-11-18 18:37:09,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:09,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123700820] [2022-11-18 18:37:09,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:09,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:09,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:09,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:09,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123700820] [2022-11-18 18:37:09,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123700820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:09,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:09,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:37:09,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998314111] [2022-11-18 18:37:09,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:09,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:37:09,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:09,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:37:09,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:37:09,656 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 420 [2022-11-18 18:37:09,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 420 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 366.6666666666667) internal successors, (1100), 3 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:09,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:09,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 420 [2022-11-18 18:37:09,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:10,495 INFO L130 PetriNetUnfolder]: 526/2609 cut-off events. [2022-11-18 18:37:10,495 INFO L131 PetriNetUnfolder]: For 614/664 co-relation queries the response was YES. [2022-11-18 18:37:10,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3799 conditions, 2609 events. 526/2609 cut-off events. For 614/664 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 20552 event pairs, 201 based on Foata normal form. 551/2877 useless extension candidates. Maximal degree in co-relation 1900. Up to 874 conditions per place. [2022-11-18 18:37:10,540 INFO L137 encePairwiseOnDemand]: 389/420 looper letters, 32 selfloop transitions, 6 changer transitions 12/410 dead transitions. [2022-11-18 18:37:10,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 410 transitions, 985 flow [2022-11-18 18:37:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:37:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 18:37:10,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1167 transitions. [2022-11-18 18:37:10,544 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9261904761904762 [2022-11-18 18:37:10,544 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1167 transitions. [2022-11-18 18:37:10,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1167 transitions. [2022-11-18 18:37:10,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:10,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1167 transitions. [2022-11-18 18:37:10,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 389.0) internal successors, (1167), 3 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:10,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:10,551 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:10,551 INFO L175 Difference]: Start difference. First operand has 405 places, 420 transitions, 888 flow. Second operand 3 states and 1167 transitions. [2022-11-18 18:37:10,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 410 transitions, 985 flow [2022-11-18 18:37:10,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 410 transitions, 985 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 18:37:10,558 INFO L231 Difference]: Finished difference. Result has 397 places, 389 transitions, 854 flow [2022-11-18 18:37:10,559 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=397, PETRI_TRANSITIONS=389} [2022-11-18 18:37:10,560 INFO L288 CegarLoopForPetriNet]: 405 programPoint places, -8 predicate places. [2022-11-18 18:37:10,560 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 389 transitions, 854 flow [2022-11-18 18:37:10,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.6666666666667) internal successors, (1100), 3 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:10,560 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:10,560 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] [2022-11-18 18:37:10,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 18:37:10,561 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2022-11-18 18:37:10,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1424489957, now seen corresponding path program 1 times [2022-11-18 18:37:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:10,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083624791] [2022-11-18 18:37:10,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:10,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:10,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:10,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083624791] [2022-11-18 18:37:10,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083624791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:10,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:10,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:37:10,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079401348] [2022-11-18 18:37:10,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:10,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:37:10,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:10,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:37:10,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:37:10,592 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 420 [2022-11-18 18:37:10,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 389 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:10,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:10,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 420 [2022-11-18 18:37:10,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:20,830 INFO L130 PetriNetUnfolder]: 8093/42206 cut-off events. [2022-11-18 18:37:20,831 INFO L131 PetriNetUnfolder]: For 10481/75000 co-relation queries the response was YES. [2022-11-18 18:37:21,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57887 conditions, 42206 events. 8093/42206 cut-off events. For 10481/75000 co-relation queries the response was YES. Maximal size of possible extension queue 1575. Compared 619124 event pairs, 6073 based on Foata normal form. 0/34356 useless extension candidates. Maximal degree in co-relation 51445. Up to 9709 conditions per place. [2022-11-18 18:37:21,618 INFO L137 encePairwiseOnDemand]: 417/420 looper letters, 36 selfloop transitions, 2 changer transitions 0/388 dead transitions. [2022-11-18 18:37:21,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 388 transitions, 928 flow [2022-11-18 18:37:21,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:37:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 18:37:21,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2022-11-18 18:37:21,622 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9023809523809524 [2022-11-18 18:37:21,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1137 transitions. [2022-11-18 18:37:21,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1137 transitions. [2022-11-18 18:37:21,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:21,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1137 transitions. [2022-11-18 18:37:21,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 379.0) internal successors, (1137), 3 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:21,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:21,630 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:21,630 INFO L175 Difference]: Start difference. First operand has 397 places, 389 transitions, 854 flow. Second operand 3 states and 1137 transitions. [2022-11-18 18:37:21,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 388 transitions, 928 flow [2022-11-18 18:37:21,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 388 transitions, 928 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 18:37:21,658 INFO L231 Difference]: Finished difference. Result has 386 places, 388 transitions, 856 flow [2022-11-18 18:37:21,659 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=386, PETRI_TRANSITIONS=388} [2022-11-18 18:37:21,660 INFO L288 CegarLoopForPetriNet]: 405 programPoint places, -19 predicate places. [2022-11-18 18:37:21,661 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 388 transitions, 856 flow [2022-11-18 18:37:21,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:21,661 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:21,662 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:37:21,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 18:37:21,662 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2022-11-18 18:37:21,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:21,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1938408786, now seen corresponding path program 1 times [2022-11-18 18:37:21,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:21,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882712780] [2022-11-18 18:37:21,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:21,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:21,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:21,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882712780] [2022-11-18 18:37:21,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882712780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:21,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:21,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:37:21,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007887000] [2022-11-18 18:37:21,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:21,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:37:21,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:21,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:37:21,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:37:21,953 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 420 [2022-11-18 18:37:21,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 388 transitions, 856 flow. Second operand has 6 states, 6 states have (on average 325.6666666666667) internal successors, (1954), 6 states have internal predecessors, (1954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:21,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:21,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 420 [2022-11-18 18:37:21,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:22,763 INFO L130 PetriNetUnfolder]: 122/1971 cut-off events. [2022-11-18 18:37:22,763 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-11-18 18:37:22,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1971 events. 122/1971 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13317 event pairs, 10 based on Foata normal form. 0/1730 useless extension candidates. Maximal degree in co-relation 2750. Up to 573 conditions per place. [2022-11-18 18:37:22,795 INFO L137 encePairwiseOnDemand]: 414/420 looper letters, 75 selfloop transitions, 5 changer transitions 0/387 dead transitions. [2022-11-18 18:37:22,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 387 transitions, 1014 flow [2022-11-18 18:37:22,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:37:22,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 18:37:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2025 transitions. [2022-11-18 18:37:22,800 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8035714285714286 [2022-11-18 18:37:22,801 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2025 transitions. [2022-11-18 18:37:22,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2025 transitions. [2022-11-18 18:37:22,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:22,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2025 transitions. [2022-11-18 18:37:22,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 337.5) internal successors, (2025), 6 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:22,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:22,812 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:22,813 INFO L175 Difference]: Start difference. First operand has 386 places, 388 transitions, 856 flow. Second operand 6 states and 2025 transitions. [2022-11-18 18:37:22,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 387 transitions, 1014 flow [2022-11-18 18:37:22,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 387 transitions, 1010 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 18:37:22,821 INFO L231 Difference]: Finished difference. Result has 388 places, 387 transitions, 860 flow [2022-11-18 18:37:22,822 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=860, PETRI_PLACES=388, PETRI_TRANSITIONS=387} [2022-11-18 18:37:22,822 INFO L288 CegarLoopForPetriNet]: 405 programPoint places, -17 predicate places. [2022-11-18 18:37:22,823 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 387 transitions, 860 flow [2022-11-18 18:37:22,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 325.6666666666667) internal successors, (1954), 6 states have internal predecessors, (1954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:22,823 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:22,824 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] [2022-11-18 18:37:22,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 18:37:22,824 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2022-11-18 18:37:22,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:22,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1362415959, now seen corresponding path program 1 times [2022-11-18 18:37:22,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:22,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313788960] [2022-11-18 18:37:22,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:22,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:22,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:22,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313788960] [2022-11-18 18:37:22,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313788960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:22,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:22,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:37:22,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458484362] [2022-11-18 18:37:22,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:22,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:37:22,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:22,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:37:22,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:37:22,863 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 372 out of 420 [2022-11-18 18:37:22,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 387 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:22,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:22,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 372 of 420 [2022-11-18 18:37:22,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:25,735 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] funcBEXIT-->L1309-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} OutVars{funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} AuxVars[] AssignedVars[][368], [408#true, funcBThread1of2ForFork1InUse, 265#funcBENTRYtrue, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, 346#L1250-1true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 13#L1309-7true]) [2022-11-18 18:37:25,735 INFO L383 tUnfolder$Statistics]: this new event has 278 ancestors and is cut-off event [2022-11-18 18:37:25,736 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-18 18:37:25,736 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-18 18:37:25,736 INFO L386 tUnfolder$Statistics]: existing Event has 266 ancestors and is cut-off event [2022-11-18 18:37:25,765 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] funcBEXIT-->L1309-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} OutVars{funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} AuxVars[] AssignedVars[][368], [408#true, funcBThread1of2ForFork1InUse, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 13#L1309-7true, 386#funcBErr5ASSERT_VIOLATIONDATA_RACEtrue, 52#funcAENTRYtrue]) [2022-11-18 18:37:25,765 INFO L383 tUnfolder$Statistics]: this new event has 278 ancestors and is cut-off event [2022-11-18 18:37:25,765 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-18 18:37:25,765 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-18 18:37:25,766 INFO L386 tUnfolder$Statistics]: existing Event has 266 ancestors and is cut-off event [2022-11-18 18:37:25,767 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][326], [408#true, 417#true, 424#true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 131#L1265-2true, 13#L1309-7true, 52#funcAENTRYtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:25,768 INFO L383 tUnfolder$Statistics]: this new event has 278 ancestors and is cut-off event [2022-11-18 18:37:25,768 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-18 18:37:25,768 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-18 18:37:25,768 INFO L386 tUnfolder$Statistics]: existing Event has 266 ancestors and is cut-off event [2022-11-18 18:37:25,769 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][326], [408#true, 417#true, 424#true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 13#L1309-7true, 239#funcBErr5ASSERT_VIOLATIONDATA_RACEtrue, 52#funcAENTRYtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:25,769 INFO L383 tUnfolder$Statistics]: this new event has 278 ancestors and is cut-off event [2022-11-18 18:37:25,769 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-18 18:37:25,770 INFO L386 tUnfolder$Statistics]: existing Event has 266 ancestors and is cut-off event [2022-11-18 18:37:25,770 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-18 18:37:25,770 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][326], [408#true, 417#true, 424#true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 76#L1265-1true, 13#L1309-7true, 52#funcAENTRYtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:25,771 INFO L383 tUnfolder$Statistics]: this new event has 277 ancestors and is cut-off event [2022-11-18 18:37:25,771 INFO L386 tUnfolder$Statistics]: existing Event has 212 ancestors and is cut-off event [2022-11-18 18:37:25,771 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-18 18:37:25,771 INFO L386 tUnfolder$Statistics]: existing Event has 265 ancestors and is cut-off event [2022-11-18 18:37:25,772 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] funcBEXIT-->L1309-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} OutVars{funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} AuxVars[] AssignedVars[][368], [408#true, funcBThread1of2ForFork1InUse, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, 336#L1265-2true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 13#L1309-7true, 52#funcAENTRYtrue]) [2022-11-18 18:37:25,772 INFO L383 tUnfolder$Statistics]: this new event has 278 ancestors and is cut-off event [2022-11-18 18:37:25,772 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-18 18:37:25,773 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-18 18:37:25,773 INFO L386 tUnfolder$Statistics]: existing Event has 266 ancestors and is cut-off event [2022-11-18 18:37:25,779 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][326], [408#true, 417#true, 424#true, 346#L1250-1true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 13#L1309-7true, 133#funcBENTRYtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:25,779 INFO L383 tUnfolder$Statistics]: this new event has 278 ancestors and is cut-off event [2022-11-18 18:37:25,780 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-18 18:37:25,780 INFO L386 tUnfolder$Statistics]: existing Event has 266 ancestors and is cut-off event [2022-11-18 18:37:25,780 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-18 18:37:25,788 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] funcBEXIT-->L1309-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} OutVars{funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} AuxVars[] AssignedVars[][368], [408#true, funcBThread1of2ForFork1InUse, 265#funcBENTRYtrue, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 13#L1309-7true, 252#funcAErr4ASSERT_VIOLATIONDATA_RACEtrue]) [2022-11-18 18:37:25,788 INFO L383 tUnfolder$Statistics]: this new event has 279 ancestors and is cut-off event [2022-11-18 18:37:25,789 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-18 18:37:25,789 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-18 18:37:25,789 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-18 18:37:25,792 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] funcBEXIT-->L1309-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} OutVars{funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} AuxVars[] AssignedVars[][368], [408#true, funcBThread1of2ForFork1InUse, 265#funcBENTRYtrue, 417#true, 51#L1250-2true, funcBThread2of2ForFork1NotInUse, 424#true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 13#L1309-7true]) [2022-11-18 18:37:25,793 INFO L383 tUnfolder$Statistics]: this new event has 279 ancestors and is cut-off event [2022-11-18 18:37:25,793 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-18 18:37:25,793 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-18 18:37:25,793 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-18 18:37:25,841 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][326], [408#true, 417#true, 424#true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 133#funcBENTRYtrue, 13#L1309-7true, 252#funcAErr4ASSERT_VIOLATIONDATA_RACEtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:25,842 INFO L383 tUnfolder$Statistics]: this new event has 279 ancestors and is cut-off event [2022-11-18 18:37:25,842 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-18 18:37:25,842 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-18 18:37:25,843 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-18 18:37:25,845 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][326], [408#true, 417#true, 424#true, 51#L1250-2true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 133#funcBENTRYtrue, 13#L1309-7true, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:25,845 INFO L383 tUnfolder$Statistics]: this new event has 279 ancestors and is cut-off event [2022-11-18 18:37:25,846 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-18 18:37:25,846 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-18 18:37:25,846 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-18 18:37:26,081 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] funcBEXIT-->L1315-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_6 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][381], [408#true, funcBThread1of2ForFork1InUse, 265#funcBENTRYtrue, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, 346#L1250-1true, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse]) [2022-11-18 18:37:26,081 INFO L383 tUnfolder$Statistics]: this new event has 287 ancestors and is cut-off event [2022-11-18 18:37:26,081 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:37:26,082 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:26,082 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-18 18:37:26,093 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] funcBEXIT-->L1315-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_6 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][381], [408#true, funcBThread1of2ForFork1InUse, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, funcAThread1of2ForFork0InUse, 194#L1315-7true, funcAThread2of2ForFork0NotInUse, 386#funcBErr5ASSERT_VIOLATIONDATA_RACEtrue, 52#funcAENTRYtrue]) [2022-11-18 18:37:26,093 INFO L383 tUnfolder$Statistics]: this new event has 287 ancestors and is cut-off event [2022-11-18 18:37:26,093 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-18 18:37:26,093 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:37:26,094 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:26,095 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] funcBEXIT-->L1315-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_6 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][381], [408#true, funcBThread1of2ForFork1InUse, 424#true, 417#true, funcBThread2of2ForFork1NotInUse, 336#L1265-2true, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 52#funcAENTRYtrue]) [2022-11-18 18:37:26,095 INFO L383 tUnfolder$Statistics]: this new event has 287 ancestors and is cut-off event [2022-11-18 18:37:26,095 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-18 18:37:26,095 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:26,096 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:37:26,096 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][347], [408#true, 417#true, 424#true, funcBThread2of2ForFork1InUse, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 131#L1265-2true, 52#funcAENTRYtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,096 INFO L383 tUnfolder$Statistics]: this new event has 287 ancestors and is cut-off event [2022-11-18 18:37:26,096 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:26,097 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:37:26,097 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-18 18:37:26,097 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][347], [408#true, 417#true, 424#true, funcBThread2of2ForFork1InUse, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 239#funcBErr5ASSERT_VIOLATIONDATA_RACEtrue, 52#funcAENTRYtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,097 INFO L383 tUnfolder$Statistics]: this new event has 287 ancestors and is cut-off event [2022-11-18 18:37:26,097 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-18 18:37:26,098 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:37:26,098 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:26,098 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][347], [408#true, 417#true, 424#true, funcBThread2of2ForFork1InUse, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 76#L1265-1true, 52#funcAENTRYtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,098 INFO L383 tUnfolder$Statistics]: this new event has 286 ancestors and is cut-off event [2022-11-18 18:37:26,098 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-18 18:37:26,099 INFO L386 tUnfolder$Statistics]: existing Event has 221 ancestors and is cut-off event [2022-11-18 18:37:26,099 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-18 18:37:26,104 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][347], [408#true, 417#true, 424#true, 346#L1250-1true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, 194#L1315-7true, funcAThread2of2ForFork0NotInUse, 133#funcBENTRYtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,104 INFO L383 tUnfolder$Statistics]: this new event has 287 ancestors and is cut-off event [2022-11-18 18:37:26,104 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-18 18:37:26,105 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:37:26,105 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:26,108 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] funcBEXIT-->L1315-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_6 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][381], [408#true, funcBThread1of2ForFork1InUse, 265#funcBENTRYtrue, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 252#funcAErr4ASSERT_VIOLATIONDATA_RACEtrue]) [2022-11-18 18:37:26,109 INFO L383 tUnfolder$Statistics]: this new event has 288 ancestors and is cut-off event [2022-11-18 18:37:26,109 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-18 18:37:26,109 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-18 18:37:26,109 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-18 18:37:26,112 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] funcBEXIT-->L1315-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_6 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][381], [408#true, funcBThread1of2ForFork1InUse, 265#funcBENTRYtrue, 417#true, funcBThread2of2ForFork1NotInUse, 51#L1250-2true, 424#true, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse]) [2022-11-18 18:37:26,112 INFO L383 tUnfolder$Statistics]: this new event has 288 ancestors and is cut-off event [2022-11-18 18:37:26,112 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-18 18:37:26,112 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-18 18:37:26,112 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-18 18:37:26,139 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][347], [408#true, 417#true, 424#true, funcBThread2of2ForFork1InUse, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 133#funcBENTRYtrue, 252#funcAErr4ASSERT_VIOLATIONDATA_RACEtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,139 INFO L383 tUnfolder$Statistics]: this new event has 288 ancestors and is cut-off event [2022-11-18 18:37:26,139 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-18 18:37:26,139 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-18 18:37:26,140 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-18 18:37:26,142 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][347], [408#true, 424#true, 417#true, 51#L1250-2true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, 194#L1315-7true, funcAThread2of2ForFork0NotInUse, 133#funcBENTRYtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,142 INFO L383 tUnfolder$Statistics]: this new event has 288 ancestors and is cut-off event [2022-11-18 18:37:26,142 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-18 18:37:26,142 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-18 18:37:26,143 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-18 18:37:26,322 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] funcBEXIT-->L1309-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} OutVars{funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} AuxVars[] AssignedVars[][368], [408#true, funcBThread1of2ForFork1InUse, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, 346#L1250-1true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 13#L1309-7true, 386#funcBErr5ASSERT_VIOLATIONDATA_RACEtrue]) [2022-11-18 18:37:26,323 INFO L383 tUnfolder$Statistics]: this new event has 299 ancestors and is cut-off event [2022-11-18 18:37:26,323 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:26,323 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-18 18:37:26,323 INFO L386 tUnfolder$Statistics]: existing Event has 287 ancestors and is cut-off event [2022-11-18 18:37:26,324 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][326], [408#true, 417#true, 424#true, 346#L1250-1true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 76#L1265-1true, 13#L1309-7true, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,324 INFO L383 tUnfolder$Statistics]: this new event has 298 ancestors and is cut-off event [2022-11-18 18:37:26,324 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-18 18:37:26,324 INFO L386 tUnfolder$Statistics]: existing Event has 221 ancestors and is cut-off event [2022-11-18 18:37:26,324 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-18 18:37:26,324 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][326], [408#true, 417#true, 424#true, 346#L1250-1true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 13#L1309-7true, 239#funcBErr5ASSERT_VIOLATIONDATA_RACEtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,325 INFO L383 tUnfolder$Statistics]: this new event has 299 ancestors and is cut-off event [2022-11-18 18:37:26,325 INFO L386 tUnfolder$Statistics]: existing Event has 287 ancestors and is cut-off event [2022-11-18 18:37:26,325 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-18 18:37:26,325 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:26,325 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][326], [408#true, 417#true, 424#true, 346#L1250-1true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 131#L1265-2true, 13#L1309-7true, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,325 INFO L383 tUnfolder$Statistics]: this new event has 299 ancestors and is cut-off event [2022-11-18 18:37:26,325 INFO L386 tUnfolder$Statistics]: existing Event has 287 ancestors and is cut-off event [2022-11-18 18:37:26,325 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-18 18:37:26,325 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:26,326 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] funcBEXIT-->L1309-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} OutVars{funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} AuxVars[] AssignedVars[][368], [408#true, funcBThread1of2ForFork1InUse, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, 346#L1250-1true, 336#L1265-2true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 13#L1309-7true]) [2022-11-18 18:37:26,326 INFO L383 tUnfolder$Statistics]: this new event has 299 ancestors and is cut-off event [2022-11-18 18:37:26,326 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:26,326 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-18 18:37:26,326 INFO L386 tUnfolder$Statistics]: existing Event has 287 ancestors and is cut-off event [2022-11-18 18:37:26,339 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] funcBEXIT-->L1309-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} OutVars{funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} AuxVars[] AssignedVars[][368], [408#true, funcBThread1of2ForFork1InUse, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 13#L1309-7true, 386#funcBErr5ASSERT_VIOLATIONDATA_RACEtrue, 252#funcAErr4ASSERT_VIOLATIONDATA_RACEtrue]) [2022-11-18 18:37:26,339 INFO L383 tUnfolder$Statistics]: this new event has 300 ancestors and is cut-off event [2022-11-18 18:37:26,339 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-18 18:37:26,339 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-18 18:37:26,340 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 18:37:26,341 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][326], [408#true, 417#true, 424#true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 131#L1265-2true, 13#L1309-7true, 252#funcAErr4ASSERT_VIOLATIONDATA_RACEtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,341 INFO L383 tUnfolder$Statistics]: this new event has 300 ancestors and is cut-off event [2022-11-18 18:37:26,341 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-18 18:37:26,341 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-18 18:37:26,341 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 18:37:26,341 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][326], [408#true, 417#true, 424#true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 13#L1309-7true, 239#funcBErr5ASSERT_VIOLATIONDATA_RACEtrue, 252#funcAErr4ASSERT_VIOLATIONDATA_RACEtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,341 INFO L383 tUnfolder$Statistics]: this new event has 300 ancestors and is cut-off event [2022-11-18 18:37:26,342 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-18 18:37:26,342 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-18 18:37:26,342 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 18:37:26,342 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][326], [408#true, 417#true, 424#true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 76#L1265-1true, 13#L1309-7true, 252#funcAErr4ASSERT_VIOLATIONDATA_RACEtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,342 INFO L383 tUnfolder$Statistics]: this new event has 299 ancestors and is cut-off event [2022-11-18 18:37:26,342 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-18 18:37:26,342 INFO L386 tUnfolder$Statistics]: existing Event has 287 ancestors and is cut-off event [2022-11-18 18:37:26,342 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:26,343 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] funcBEXIT-->L1309-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} OutVars{funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} AuxVars[] AssignedVars[][368], [408#true, funcBThread1of2ForFork1InUse, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, 336#L1265-2true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 13#L1309-7true, 252#funcAErr4ASSERT_VIOLATIONDATA_RACEtrue]) [2022-11-18 18:37:26,343 INFO L383 tUnfolder$Statistics]: this new event has 300 ancestors and is cut-off event [2022-11-18 18:37:26,343 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-18 18:37:26,343 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-18 18:37:26,343 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 18:37:26,344 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] funcBEXIT-->L1309-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} OutVars{funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} AuxVars[] AssignedVars[][368], [408#true, funcBThread1of2ForFork1InUse, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, 51#L1250-2true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 13#L1309-7true, 386#funcBErr5ASSERT_VIOLATIONDATA_RACEtrue]) [2022-11-18 18:37:26,345 INFO L383 tUnfolder$Statistics]: this new event has 300 ancestors and is cut-off event [2022-11-18 18:37:26,345 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 18:37:26,345 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-18 18:37:26,345 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-18 18:37:26,347 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][326], [408#true, 417#true, 424#true, 51#L1250-2true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 76#L1265-1true, 13#L1309-7true, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,347 INFO L383 tUnfolder$Statistics]: this new event has 299 ancestors and is cut-off event [2022-11-18 18:37:26,347 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:26,347 INFO L386 tUnfolder$Statistics]: existing Event has 287 ancestors and is cut-off event [2022-11-18 18:37:26,347 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-18 18:37:26,348 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][326], [408#true, 417#true, 424#true, 51#L1250-2true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 131#L1265-2true, 13#L1309-7true, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,348 INFO L383 tUnfolder$Statistics]: this new event has 300 ancestors and is cut-off event [2022-11-18 18:37:26,348 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 18:37:26,348 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-18 18:37:26,348 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-18 18:37:26,349 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][326], [408#true, 417#true, 424#true, 51#L1250-2true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 13#L1309-7true, 239#funcBErr5ASSERT_VIOLATIONDATA_RACEtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,349 INFO L383 tUnfolder$Statistics]: this new event has 300 ancestors and is cut-off event [2022-11-18 18:37:26,349 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-18 18:37:26,349 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 18:37:26,349 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-18 18:37:26,350 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] funcBEXIT-->L1309-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} OutVars{funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} AuxVars[] AssignedVars[][368], [408#true, funcBThread1of2ForFork1InUse, 417#true, 51#L1250-2true, funcBThread2of2ForFork1NotInUse, 424#true, 336#L1265-2true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 13#L1309-7true]) [2022-11-18 18:37:26,350 INFO L383 tUnfolder$Statistics]: this new event has 300 ancestors and is cut-off event [2022-11-18 18:37:26,350 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-18 18:37:26,350 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-18 18:37:26,351 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 18:37:26,403 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] funcBEXIT-->L1315-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_6 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][381], [408#true, funcBThread1of2ForFork1InUse, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, 346#L1250-1true, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 386#funcBErr5ASSERT_VIOLATIONDATA_RACEtrue]) [2022-11-18 18:37:26,403 INFO L383 tUnfolder$Statistics]: this new event has 308 ancestors and is cut-off event [2022-11-18 18:37:26,403 INFO L386 tUnfolder$Statistics]: existing Event has 231 ancestors and is cut-off event [2022-11-18 18:37:26,403 INFO L386 tUnfolder$Statistics]: existing Event has 296 ancestors and is cut-off event [2022-11-18 18:37:26,403 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 18:37:26,404 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] funcBEXIT-->L1315-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_6 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][381], [408#true, funcBThread1of2ForFork1InUse, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, 346#L1250-1true, 336#L1265-2true, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse]) [2022-11-18 18:37:26,404 INFO L383 tUnfolder$Statistics]: this new event has 308 ancestors and is cut-off event [2022-11-18 18:37:26,404 INFO L386 tUnfolder$Statistics]: existing Event has 296 ancestors and is cut-off event [2022-11-18 18:37:26,404 INFO L386 tUnfolder$Statistics]: existing Event has 231 ancestors and is cut-off event [2022-11-18 18:37:26,404 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 18:37:26,405 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][347], [408#true, 417#true, 424#true, 346#L1250-1true, funcBThread2of2ForFork1InUse, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 76#L1265-1true, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,405 INFO L383 tUnfolder$Statistics]: this new event has 307 ancestors and is cut-off event [2022-11-18 18:37:26,405 INFO L386 tUnfolder$Statistics]: existing Event has 295 ancestors and is cut-off event [2022-11-18 18:37:26,405 INFO L386 tUnfolder$Statistics]: existing Event has 230 ancestors and is cut-off event [2022-11-18 18:37:26,405 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-18 18:37:26,405 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][347], [408#true, 417#true, 424#true, 346#L1250-1true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, 194#L1315-7true, funcAThread2of2ForFork0NotInUse, 239#funcBErr5ASSERT_VIOLATIONDATA_RACEtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,405 INFO L383 tUnfolder$Statistics]: this new event has 308 ancestors and is cut-off event [2022-11-18 18:37:26,405 INFO L386 tUnfolder$Statistics]: existing Event has 231 ancestors and is cut-off event [2022-11-18 18:37:26,405 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 18:37:26,406 INFO L386 tUnfolder$Statistics]: existing Event has 296 ancestors and is cut-off event [2022-11-18 18:37:26,406 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][347], [408#true, 424#true, 417#true, 346#L1250-1true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, 194#L1315-7true, funcAThread2of2ForFork0NotInUse, 131#L1265-2true, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,406 INFO L383 tUnfolder$Statistics]: this new event has 308 ancestors and is cut-off event [2022-11-18 18:37:26,406 INFO L386 tUnfolder$Statistics]: existing Event has 296 ancestors and is cut-off event [2022-11-18 18:37:26,406 INFO L386 tUnfolder$Statistics]: existing Event has 231 ancestors and is cut-off event [2022-11-18 18:37:26,406 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 18:37:26,410 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] funcBEXIT-->L1315-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_6 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][381], [408#true, funcBThread1of2ForFork1InUse, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 386#funcBErr5ASSERT_VIOLATIONDATA_RACEtrue, 252#funcAErr4ASSERT_VIOLATIONDATA_RACEtrue]) [2022-11-18 18:37:26,410 INFO L383 tUnfolder$Statistics]: this new event has 309 ancestors and is cut-off event [2022-11-18 18:37:26,410 INFO L386 tUnfolder$Statistics]: existing Event has 297 ancestors and is cut-off event [2022-11-18 18:37:26,410 INFO L386 tUnfolder$Statistics]: existing Event has 232 ancestors and is cut-off event [2022-11-18 18:37:26,410 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-18 18:37:26,411 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] funcBEXIT-->L1315-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_6 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][381], [408#true, funcBThread1of2ForFork1InUse, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, 336#L1265-2true, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 252#funcAErr4ASSERT_VIOLATIONDATA_RACEtrue]) [2022-11-18 18:37:26,411 INFO L383 tUnfolder$Statistics]: this new event has 309 ancestors and is cut-off event [2022-11-18 18:37:26,411 INFO L386 tUnfolder$Statistics]: existing Event has 297 ancestors and is cut-off event [2022-11-18 18:37:26,411 INFO L386 tUnfolder$Statistics]: existing Event has 232 ancestors and is cut-off event [2022-11-18 18:37:26,412 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-18 18:37:26,412 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][347], [408#true, 417#true, 424#true, funcBThread2of2ForFork1InUse, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 131#L1265-2true, 252#funcAErr4ASSERT_VIOLATIONDATA_RACEtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,412 INFO L383 tUnfolder$Statistics]: this new event has 309 ancestors and is cut-off event [2022-11-18 18:37:26,412 INFO L386 tUnfolder$Statistics]: existing Event has 297 ancestors and is cut-off event [2022-11-18 18:37:26,412 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-18 18:37:26,413 INFO L386 tUnfolder$Statistics]: existing Event has 232 ancestors and is cut-off event [2022-11-18 18:37:26,413 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][347], [408#true, 417#true, 424#true, funcBThread2of2ForFork1InUse, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 239#funcBErr5ASSERT_VIOLATIONDATA_RACEtrue, 252#funcAErr4ASSERT_VIOLATIONDATA_RACEtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,413 INFO L383 tUnfolder$Statistics]: this new event has 309 ancestors and is cut-off event [2022-11-18 18:37:26,413 INFO L386 tUnfolder$Statistics]: existing Event has 297 ancestors and is cut-off event [2022-11-18 18:37:26,413 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-18 18:37:26,414 INFO L386 tUnfolder$Statistics]: existing Event has 232 ancestors and is cut-off event [2022-11-18 18:37:26,414 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][347], [408#true, 417#true, 424#true, funcBThread2of2ForFork1InUse, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 76#L1265-1true, 252#funcAErr4ASSERT_VIOLATIONDATA_RACEtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,414 INFO L383 tUnfolder$Statistics]: this new event has 308 ancestors and is cut-off event [2022-11-18 18:37:26,414 INFO L386 tUnfolder$Statistics]: existing Event has 296 ancestors and is cut-off event [2022-11-18 18:37:26,414 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 18:37:26,415 INFO L386 tUnfolder$Statistics]: existing Event has 231 ancestors and is cut-off event [2022-11-18 18:37:26,416 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] funcBEXIT-->L1315-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_6 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][381], [408#true, funcBThread1of2ForFork1InUse, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, 51#L1250-2true, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 386#funcBErr5ASSERT_VIOLATIONDATA_RACEtrue]) [2022-11-18 18:37:26,416 INFO L383 tUnfolder$Statistics]: this new event has 309 ancestors and is cut-off event [2022-11-18 18:37:26,417 INFO L386 tUnfolder$Statistics]: existing Event has 297 ancestors and is cut-off event [2022-11-18 18:37:26,417 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-18 18:37:26,417 INFO L386 tUnfolder$Statistics]: existing Event has 232 ancestors and is cut-off event [2022-11-18 18:37:26,419 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] funcBEXIT-->L1315-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_6 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][381], [408#true, funcBThread1of2ForFork1InUse, 417#true, funcBThread2of2ForFork1NotInUse, 424#true, 51#L1250-2true, 336#L1265-2true, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse]) [2022-11-18 18:37:26,419 INFO L383 tUnfolder$Statistics]: this new event has 309 ancestors and is cut-off event [2022-11-18 18:37:26,419 INFO L386 tUnfolder$Statistics]: existing Event has 297 ancestors and is cut-off event [2022-11-18 18:37:26,419 INFO L386 tUnfolder$Statistics]: existing Event has 232 ancestors and is cut-off event [2022-11-18 18:37:26,420 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-18 18:37:26,420 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][347], [408#true, 417#true, 424#true, 51#L1250-2true, funcBThread2of2ForFork1InUse, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 76#L1265-1true, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,420 INFO L383 tUnfolder$Statistics]: this new event has 308 ancestors and is cut-off event [2022-11-18 18:37:26,420 INFO L386 tUnfolder$Statistics]: existing Event has 231 ancestors and is cut-off event [2022-11-18 18:37:26,420 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 18:37:26,421 INFO L386 tUnfolder$Statistics]: existing Event has 296 ancestors and is cut-off event [2022-11-18 18:37:26,421 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][347], [408#true, 417#true, 424#true, 51#L1250-2true, funcBThread2of2ForFork1InUse, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 131#L1265-2true, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,421 INFO L383 tUnfolder$Statistics]: this new event has 309 ancestors and is cut-off event [2022-11-18 18:37:26,421 INFO L386 tUnfolder$Statistics]: existing Event has 232 ancestors and is cut-off event [2022-11-18 18:37:26,421 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-18 18:37:26,422 INFO L386 tUnfolder$Statistics]: existing Event has 297 ancestors and is cut-off event [2022-11-18 18:37:26,422 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][347], [408#true, 417#true, 424#true, 51#L1250-2true, funcBThread2of2ForFork1InUse, 194#L1315-7true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 239#funcBErr5ASSERT_VIOLATIONDATA_RACEtrue, funcBThread1of2ForFork1NotInUse]) [2022-11-18 18:37:26,422 INFO L383 tUnfolder$Statistics]: this new event has 309 ancestors and is cut-off event [2022-11-18 18:37:26,422 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-18 18:37:26,423 INFO L386 tUnfolder$Statistics]: existing Event has 232 ancestors and is cut-off event [2022-11-18 18:37:26,423 INFO L386 tUnfolder$Statistics]: existing Event has 297 ancestors and is cut-off event [2022-11-18 18:37:26,428 INFO L130 PetriNetUnfolder]: 3728/13919 cut-off events. [2022-11-18 18:37:26,429 INFO L131 PetriNetUnfolder]: For 6036/9451 co-relation queries the response was YES. [2022-11-18 18:37:26,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21961 conditions, 13919 events. 3728/13919 cut-off events. For 6036/9451 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 148190 event pairs, 2323 based on Foata normal form. 0/11207 useless extension candidates. Maximal degree in co-relation 21930. Up to 4426 conditions per place. [2022-11-18 18:37:26,713 INFO L137 encePairwiseOnDemand]: 417/420 looper letters, 30 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2022-11-18 18:37:26,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 386 transitions, 922 flow [2022-11-18 18:37:26,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:37:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 18:37:26,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1149 transitions. [2022-11-18 18:37:26,724 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9119047619047619 [2022-11-18 18:37:26,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1149 transitions. [2022-11-18 18:37:26,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1149 transitions. [2022-11-18 18:37:26,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:26,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1149 transitions. [2022-11-18 18:37:26,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 383.0) internal successors, (1149), 3 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:26,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:26,732 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:26,733 INFO L175 Difference]: Start difference. First operand has 388 places, 387 transitions, 860 flow. Second operand 3 states and 1149 transitions. [2022-11-18 18:37:26,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 386 transitions, 922 flow [2022-11-18 18:37:26,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 386 transitions, 912 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 18:37:26,752 INFO L231 Difference]: Finished difference. Result has 384 places, 386 transitions, 852 flow [2022-11-18 18:37:26,758 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=852, PETRI_PLACES=384, PETRI_TRANSITIONS=386} [2022-11-18 18:37:26,760 INFO L288 CegarLoopForPetriNet]: 405 programPoint places, -21 predicate places. [2022-11-18 18:37:26,760 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 386 transitions, 852 flow [2022-11-18 18:37:26,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:26,761 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:26,765 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] [2022-11-18 18:37:26,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 18:37:26,766 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2022-11-18 18:37:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:26,766 INFO L85 PathProgramCache]: Analyzing trace with hash -459591827, now seen corresponding path program 1 times [2022-11-18 18:37:26,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:26,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441526764] [2022-11-18 18:37:26,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:26,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:26,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:26,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:26,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441526764] [2022-11-18 18:37:26,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441526764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:26,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:26,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:37:26,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331235962] [2022-11-18 18:37:26,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:26,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:37:26,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:26,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:37:26,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:37:26,838 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 420 [2022-11-18 18:37:26,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 386 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:26,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:26,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 420 [2022-11-18 18:37:26,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:31,512 INFO L130 PetriNetUnfolder]: 3252/22202 cut-off events. [2022-11-18 18:37:31,512 INFO L131 PetriNetUnfolder]: For 4756/19806 co-relation queries the response was YES. [2022-11-18 18:37:31,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28987 conditions, 22202 events. 3252/22202 cut-off events. For 4756/19806 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 298969 event pairs, 2096 based on Foata normal form. 0/19184 useless extension candidates. Maximal degree in co-relation 28900. Up to 3654 conditions per place. [2022-11-18 18:37:31,818 INFO L137 encePairwiseOnDemand]: 412/420 looper letters, 27 selfloop transitions, 1 changer transitions 0/379 dead transitions. [2022-11-18 18:37:31,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 379 transitions, 894 flow [2022-11-18 18:37:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:37:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 18:37:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1142 transitions. [2022-11-18 18:37:31,822 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9063492063492063 [2022-11-18 18:37:31,823 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1142 transitions. [2022-11-18 18:37:31,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1142 transitions. [2022-11-18 18:37:31,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:31,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1142 transitions. [2022-11-18 18:37:31,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 380.6666666666667) internal successors, (1142), 3 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:31,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:31,830 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:31,831 INFO L175 Difference]: Start difference. First operand has 384 places, 386 transitions, 852 flow. Second operand 3 states and 1142 transitions. [2022-11-18 18:37:31,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 379 transitions, 894 flow [2022-11-18 18:37:31,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 379 transitions, 890 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 18:37:31,847 INFO L231 Difference]: Finished difference. Result has 377 places, 379 transitions, 836 flow [2022-11-18 18:37:31,848 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=377, PETRI_TRANSITIONS=379} [2022-11-18 18:37:31,849 INFO L288 CegarLoopForPetriNet]: 405 programPoint places, -28 predicate places. [2022-11-18 18:37:31,849 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 379 transitions, 836 flow [2022-11-18 18:37:31,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:31,850 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:31,850 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] [2022-11-18 18:37:31,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 18:37:31,850 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2022-11-18 18:37:31,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:31,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1925589554, now seen corresponding path program 1 times [2022-11-18 18:37:31,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:31,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24368760] [2022-11-18 18:37:31,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:31,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:32,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:32,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24368760] [2022-11-18 18:37:32,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24368760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:32,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:32,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:37:32,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300306964] [2022-11-18 18:37:32,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:32,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:37:32,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:32,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:37:32,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:37:32,163 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 420 [2022-11-18 18:37:32,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 379 transitions, 836 flow. Second operand has 6 states, 6 states have (on average 326.5) internal successors, (1959), 6 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:32,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:32,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 420 [2022-11-18 18:37:32,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:32,814 INFO L130 PetriNetUnfolder]: 122/1954 cut-off events. [2022-11-18 18:37:32,814 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-11-18 18:37:32,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 1954 events. 122/1954 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13054 event pairs, 10 based on Foata normal form. 0/1730 useless extension candidates. Maximal degree in co-relation 2732. Up to 578 conditions per place. [2022-11-18 18:37:32,841 INFO L137 encePairwiseOnDemand]: 414/420 looper letters, 74 selfloop transitions, 5 changer transitions 0/378 dead transitions. [2022-11-18 18:37:32,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 378 transitions, 992 flow [2022-11-18 18:37:32,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:37:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 18:37:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2024 transitions. [2022-11-18 18:37:32,847 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8031746031746032 [2022-11-18 18:37:32,847 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2024 transitions. [2022-11-18 18:37:32,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2024 transitions. [2022-11-18 18:37:32,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:32,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2024 transitions. [2022-11-18 18:37:32,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 337.3333333333333) internal successors, (2024), 6 states have internal predecessors, (2024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:32,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:32,862 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:32,862 INFO L175 Difference]: Start difference. First operand has 377 places, 379 transitions, 836 flow. Second operand 6 states and 2024 transitions. [2022-11-18 18:37:32,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 378 transitions, 992 flow [2022-11-18 18:37:32,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 378 transitions, 991 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 18:37:32,871 INFO L231 Difference]: Finished difference. Result has 380 places, 378 transitions, 843 flow [2022-11-18 18:37:32,872 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=843, PETRI_PLACES=380, PETRI_TRANSITIONS=378} [2022-11-18 18:37:32,872 INFO L288 CegarLoopForPetriNet]: 405 programPoint places, -25 predicate places. [2022-11-18 18:37:32,873 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 378 transitions, 843 flow [2022-11-18 18:37:32,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 326.5) internal successors, (1959), 6 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:32,874 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:32,874 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] [2022-11-18 18:37:32,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 18:37:32,874 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2022-11-18 18:37:32,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:32,875 INFO L85 PathProgramCache]: Analyzing trace with hash -268537942, now seen corresponding path program 1 times [2022-11-18 18:37:32,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:32,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086879434] [2022-11-18 18:37:32,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:32,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:32,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:32,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086879434] [2022-11-18 18:37:32,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086879434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:32,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:32,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:37:32,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459085295] [2022-11-18 18:37:32,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:32,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:37:32,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:32,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:37:32,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:37:32,913 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 420 [2022-11-18 18:37:32,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 378 transitions, 843 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:32,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:32,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 420 [2022-11-18 18:37:32,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:34,686 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] funcBEXIT-->L1309-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} OutVars{funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} AuxVars[] AssignedVars[][355], [408#true, funcBThread1of2ForFork1InUse, 265#funcBENTRYtrue, funcBThread2of2ForFork1NotInUse, 346#L1250-1true, funcAThread1of2ForFork0InUse, 432#true, funcAThread2of2ForFork0NotInUse, 430#(= |#race~data1Lock~0| 0), 13#L1309-7true, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,687 INFO L383 tUnfolder$Statistics]: this new event has 278 ancestors and is cut-off event [2022-11-18 18:37:34,687 INFO L386 tUnfolder$Statistics]: existing Event has 266 ancestors and is cut-off event [2022-11-18 18:37:34,687 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-18 18:37:34,687 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-18 18:37:34,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][316], [408#true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, 432#true, funcAThread2of2ForFork0NotInUse, 76#L1265-1true, 13#L1309-7true, 430#(= |#race~data1Lock~0| 0), 52#funcAENTRYtrue, funcBThread1of2ForFork1NotInUse, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,696 INFO L383 tUnfolder$Statistics]: this new event has 277 ancestors and is cut-off event [2022-11-18 18:37:34,696 INFO L386 tUnfolder$Statistics]: existing Event has 265 ancestors and is cut-off event [2022-11-18 18:37:34,696 INFO L386 tUnfolder$Statistics]: existing Event has 212 ancestors and is cut-off event [2022-11-18 18:37:34,696 INFO L386 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-11-18 18:37:34,697 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][316], [408#true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, 432#true, funcAThread2of2ForFork0NotInUse, 131#L1265-2true, 13#L1309-7true, 430#(= |#race~data1Lock~0| 0), 52#funcAENTRYtrue, funcBThread1of2ForFork1NotInUse, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,697 INFO L383 tUnfolder$Statistics]: this new event has 278 ancestors and is cut-off event [2022-11-18 18:37:34,697 INFO L386 tUnfolder$Statistics]: existing Event has 266 ancestors and is cut-off event [2022-11-18 18:37:34,697 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-18 18:37:34,697 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-18 18:37:34,698 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] funcBEXIT-->L1309-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} OutVars{funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} AuxVars[] AssignedVars[][355], [408#true, funcBThread1of2ForFork1InUse, funcBThread2of2ForFork1NotInUse, 336#L1265-2true, funcAThread1of2ForFork0InUse, 432#true, funcAThread2of2ForFork0NotInUse, 13#L1309-7true, 430#(= |#race~data1Lock~0| 0), 52#funcAENTRYtrue, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,698 INFO L383 tUnfolder$Statistics]: this new event has 278 ancestors and is cut-off event [2022-11-18 18:37:34,698 INFO L386 tUnfolder$Statistics]: existing Event has 266 ancestors and is cut-off event [2022-11-18 18:37:34,698 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-18 18:37:34,698 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-18 18:37:34,701 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][316], [408#true, funcBThread2of2ForFork1InUse, 346#L1250-1true, funcAThread1of2ForFork0InUse, 432#true, funcAThread2of2ForFork0NotInUse, 430#(= |#race~data1Lock~0| 0), 13#L1309-7true, 133#funcBENTRYtrue, funcBThread1of2ForFork1NotInUse, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,701 INFO L383 tUnfolder$Statistics]: this new event has 278 ancestors and is cut-off event [2022-11-18 18:37:34,701 INFO L386 tUnfolder$Statistics]: existing Event has 266 ancestors and is cut-off event [2022-11-18 18:37:34,701 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-18 18:37:34,702 INFO L386 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-11-18 18:37:34,705 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] funcBEXIT-->L1309-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} OutVars{funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} AuxVars[] AssignedVars[][355], [408#true, funcBThread1of2ForFork1InUse, 265#funcBENTRYtrue, funcBThread2of2ForFork1NotInUse, 51#L1250-2true, funcAThread1of2ForFork0InUse, 432#true, funcAThread2of2ForFork0NotInUse, 13#L1309-7true, 430#(= |#race~data1Lock~0| 0), 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,705 INFO L383 tUnfolder$Statistics]: this new event has 279 ancestors and is cut-off event [2022-11-18 18:37:34,705 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-18 18:37:34,705 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-18 18:37:34,705 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-18 18:37:34,719 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][316], [408#true, 51#L1250-2true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, 432#true, funcAThread2of2ForFork0NotInUse, 133#funcBENTRYtrue, 430#(= |#race~data1Lock~0| 0), 13#L1309-7true, funcBThread1of2ForFork1NotInUse, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,719 INFO L383 tUnfolder$Statistics]: this new event has 279 ancestors and is cut-off event [2022-11-18 18:37:34,719 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-18 18:37:34,719 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-18 18:37:34,719 INFO L386 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-11-18 18:37:34,792 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] funcBEXIT-->L1315-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_6 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][368], [408#true, funcBThread1of2ForFork1InUse, 265#funcBENTRYtrue, funcBThread2of2ForFork1NotInUse, 346#L1250-1true, funcAThread1of2ForFork0InUse, 194#L1315-7true, 432#true, funcAThread2of2ForFork0NotInUse, 430#(= |#race~data1Lock~0| 0), 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,792 INFO L383 tUnfolder$Statistics]: this new event has 287 ancestors and is cut-off event [2022-11-18 18:37:34,792 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-18 18:37:34,792 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:37:34,792 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:34,797 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] funcBEXIT-->L1315-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_6 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][368], [408#true, funcBThread1of2ForFork1InUse, funcBThread2of2ForFork1NotInUse, 336#L1265-2true, funcAThread1of2ForFork0InUse, 194#L1315-7true, 432#true, funcAThread2of2ForFork0NotInUse, 430#(= |#race~data1Lock~0| 0), 52#funcAENTRYtrue, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,797 INFO L383 tUnfolder$Statistics]: this new event has 287 ancestors and is cut-off event [2022-11-18 18:37:34,797 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:37:34,797 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:34,797 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-18 18:37:34,797 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][335], [408#true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, 194#L1315-7true, 432#true, funcAThread2of2ForFork0NotInUse, 76#L1265-1true, 430#(= |#race~data1Lock~0| 0), 52#funcAENTRYtrue, funcBThread1of2ForFork1NotInUse, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,797 INFO L383 tUnfolder$Statistics]: this new event has 286 ancestors and is cut-off event [2022-11-18 18:37:34,797 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-18 18:37:34,798 INFO L386 tUnfolder$Statistics]: existing Event has 274 ancestors and is cut-off event [2022-11-18 18:37:34,798 INFO L386 tUnfolder$Statistics]: existing Event has 221 ancestors and is cut-off event [2022-11-18 18:37:34,798 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][335], [408#true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, 194#L1315-7true, 432#true, funcAThread2of2ForFork0NotInUse, 131#L1265-2true, 430#(= |#race~data1Lock~0| 0), 52#funcAENTRYtrue, funcBThread1of2ForFork1NotInUse, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,798 INFO L383 tUnfolder$Statistics]: this new event has 287 ancestors and is cut-off event [2022-11-18 18:37:34,798 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-18 18:37:34,798 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:37:34,799 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:34,802 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][335], [408#true, funcBThread2of2ForFork1InUse, 346#L1250-1true, funcAThread1of2ForFork0InUse, 194#L1315-7true, 432#true, funcAThread2of2ForFork0NotInUse, 430#(= |#race~data1Lock~0| 0), 133#funcBENTRYtrue, funcBThread1of2ForFork1NotInUse, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,802 INFO L383 tUnfolder$Statistics]: this new event has 287 ancestors and is cut-off event [2022-11-18 18:37:34,802 INFO L386 tUnfolder$Statistics]: existing Event has 275 ancestors and is cut-off event [2022-11-18 18:37:34,803 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:34,803 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-18 18:37:34,806 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] funcBEXIT-->L1315-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_6 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][368], [408#true, funcBThread1of2ForFork1InUse, 265#funcBENTRYtrue, funcBThread2of2ForFork1NotInUse, 51#L1250-2true, 194#L1315-7true, funcAThread1of2ForFork0InUse, 432#true, funcAThread2of2ForFork0NotInUse, 430#(= |#race~data1Lock~0| 0), 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,807 INFO L383 tUnfolder$Statistics]: this new event has 288 ancestors and is cut-off event [2022-11-18 18:37:34,807 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-18 18:37:34,807 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-18 18:37:34,807 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-18 18:37:34,816 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][335], [408#true, 51#L1250-2true, funcBThread2of2ForFork1InUse, 194#L1315-7true, funcAThread1of2ForFork0InUse, 432#true, funcAThread2of2ForFork0NotInUse, 133#funcBENTRYtrue, 430#(= |#race~data1Lock~0| 0), funcBThread1of2ForFork1NotInUse, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,817 INFO L383 tUnfolder$Statistics]: this new event has 288 ancestors and is cut-off event [2022-11-18 18:37:34,817 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-18 18:37:34,817 INFO L386 tUnfolder$Statistics]: existing Event has 276 ancestors and is cut-off event [2022-11-18 18:37:34,817 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-18 18:37:34,887 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][316], [408#true, funcBThread2of2ForFork1InUse, 346#L1250-1true, funcAThread1of2ForFork0InUse, 432#true, funcAThread2of2ForFork0NotInUse, 76#L1265-1true, 430#(= |#race~data1Lock~0| 0), 13#L1309-7true, funcBThread1of2ForFork1NotInUse, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,887 INFO L383 tUnfolder$Statistics]: this new event has 298 ancestors and is cut-off event [2022-11-18 18:37:34,887 INFO L386 tUnfolder$Statistics]: existing Event has 286 ancestors and is cut-off event [2022-11-18 18:37:34,888 INFO L386 tUnfolder$Statistics]: existing Event has 221 ancestors and is cut-off event [2022-11-18 18:37:34,888 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-18 18:37:34,888 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][316], [408#true, funcBThread2of2ForFork1InUse, 346#L1250-1true, funcAThread1of2ForFork0InUse, 432#true, funcAThread2of2ForFork0NotInUse, 131#L1265-2true, 430#(= |#race~data1Lock~0| 0), 13#L1309-7true, funcBThread1of2ForFork1NotInUse, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,888 INFO L383 tUnfolder$Statistics]: this new event has 299 ancestors and is cut-off event [2022-11-18 18:37:34,888 INFO L386 tUnfolder$Statistics]: existing Event has 287 ancestors and is cut-off event [2022-11-18 18:37:34,888 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-18 18:37:34,888 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:34,888 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] funcBEXIT-->L1309-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} OutVars{funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} AuxVars[] AssignedVars[][355], [408#true, funcBThread1of2ForFork1InUse, funcBThread2of2ForFork1NotInUse, 336#L1265-2true, 346#L1250-1true, funcAThread1of2ForFork0InUse, 432#true, funcAThread2of2ForFork0NotInUse, 430#(= |#race~data1Lock~0| 0), 13#L1309-7true, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,889 INFO L383 tUnfolder$Statistics]: this new event has 299 ancestors and is cut-off event [2022-11-18 18:37:34,889 INFO L386 tUnfolder$Statistics]: existing Event has 287 ancestors and is cut-off event [2022-11-18 18:37:34,889 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:34,889 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-18 18:37:34,895 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][316], [408#true, 51#L1250-2true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 432#true, 131#L1265-2true, 13#L1309-7true, 430#(= |#race~data1Lock~0| 0), funcBThread1of2ForFork1NotInUse, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,896 INFO L383 tUnfolder$Statistics]: this new event has 300 ancestors and is cut-off event [2022-11-18 18:37:34,896 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-18 18:37:34,896 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-18 18:37:34,896 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 18:37:34,896 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1317] funcBEXIT-->L1309-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_funcBThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[][316], [408#true, 51#L1250-2true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 432#true, 76#L1265-1true, 430#(= |#race~data1Lock~0| 0), 13#L1309-7true, funcBThread1of2ForFork1NotInUse, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,896 INFO L383 tUnfolder$Statistics]: this new event has 299 ancestors and is cut-off event [2022-11-18 18:37:34,896 INFO L386 tUnfolder$Statistics]: existing Event has 222 ancestors and is cut-off event [2022-11-18 18:37:34,896 INFO L386 tUnfolder$Statistics]: existing Event has 234 ancestors and is cut-off event [2022-11-18 18:37:34,897 INFO L386 tUnfolder$Statistics]: existing Event has 287 ancestors and is cut-off event [2022-11-18 18:37:34,897 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1318] funcBEXIT-->L1309-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem65#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} OutVars{funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem65#1=|v_ULTIMATE.start_main_#t~mem65#1_12|} AuxVars[] AssignedVars[][355], [408#true, funcBThread1of2ForFork1InUse, 51#L1250-2true, funcBThread2of2ForFork1NotInUse, 336#L1265-2true, funcAThread1of2ForFork0InUse, funcAThread2of2ForFork0NotInUse, 432#true, 430#(= |#race~data1Lock~0| 0), 13#L1309-7true, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,897 INFO L383 tUnfolder$Statistics]: this new event has 300 ancestors and is cut-off event [2022-11-18 18:37:34,897 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-18 18:37:34,897 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-18 18:37:34,897 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 18:37:34,925 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] funcBEXIT-->L1315-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_6 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][368], [408#true, funcBThread1of2ForFork1InUse, funcBThread2of2ForFork1NotInUse, 336#L1265-2true, 346#L1250-1true, funcAThread1of2ForFork0InUse, 194#L1315-7true, 432#true, funcAThread2of2ForFork0NotInUse, 430#(= |#race~data1Lock~0| 0), 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,925 INFO L383 tUnfolder$Statistics]: this new event has 308 ancestors and is cut-off event [2022-11-18 18:37:34,925 INFO L386 tUnfolder$Statistics]: existing Event has 296 ancestors and is cut-off event [2022-11-18 18:37:34,925 INFO L386 tUnfolder$Statistics]: existing Event has 231 ancestors and is cut-off event [2022-11-18 18:37:34,925 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 18:37:34,926 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][335], [408#true, funcBThread2of2ForFork1InUse, 346#L1250-1true, funcAThread1of2ForFork0InUse, 194#L1315-7true, 432#true, funcAThread2of2ForFork0NotInUse, 76#L1265-1true, 430#(= |#race~data1Lock~0| 0), funcBThread1of2ForFork1NotInUse, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,926 INFO L383 tUnfolder$Statistics]: this new event has 307 ancestors and is cut-off event [2022-11-18 18:37:34,926 INFO L386 tUnfolder$Statistics]: existing Event has 295 ancestors and is cut-off event [2022-11-18 18:37:34,926 INFO L386 tUnfolder$Statistics]: existing Event has 230 ancestors and is cut-off event [2022-11-18 18:37:34,926 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-18 18:37:34,926 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][335], [408#true, funcBThread2of2ForFork1InUse, 346#L1250-1true, funcAThread1of2ForFork0InUse, 194#L1315-7true, 432#true, funcAThread2of2ForFork0NotInUse, 131#L1265-2true, 430#(= |#race~data1Lock~0| 0), funcBThread1of2ForFork1NotInUse, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,926 INFO L383 tUnfolder$Statistics]: this new event has 308 ancestors and is cut-off event [2022-11-18 18:37:34,926 INFO L386 tUnfolder$Statistics]: existing Event has 296 ancestors and is cut-off event [2022-11-18 18:37:34,926 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 18:37:34,927 INFO L386 tUnfolder$Statistics]: existing Event has 231 ancestors and is cut-off event [2022-11-18 18:37:34,929 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] funcBEXIT-->L1315-7: Formula: (= v_funcBThread2of2ForFork1_thidvar0_6 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_12|, funcBThread2of2ForFork1_thidvar0=v_funcBThread2of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][368], [408#true, funcBThread1of2ForFork1InUse, 51#L1250-2true, funcBThread2of2ForFork1NotInUse, 336#L1265-2true, funcAThread1of2ForFork0InUse, 194#L1315-7true, funcAThread2of2ForFork0NotInUse, 432#true, 430#(= |#race~data1Lock~0| 0), 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,929 INFO L383 tUnfolder$Statistics]: this new event has 309 ancestors and is cut-off event [2022-11-18 18:37:34,929 INFO L386 tUnfolder$Statistics]: existing Event has 297 ancestors and is cut-off event [2022-11-18 18:37:34,929 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-18 18:37:34,929 INFO L386 tUnfolder$Statistics]: existing Event has 232 ancestors and is cut-off event [2022-11-18 18:37:34,930 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][335], [408#true, 51#L1250-2true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, 194#L1315-7true, funcAThread2of2ForFork0NotInUse, 432#true, 131#L1265-2true, 430#(= |#race~data1Lock~0| 0), funcBThread1of2ForFork1NotInUse, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,930 INFO L383 tUnfolder$Statistics]: this new event has 309 ancestors and is cut-off event [2022-11-18 18:37:34,930 INFO L386 tUnfolder$Statistics]: existing Event has 244 ancestors and is cut-off event [2022-11-18 18:37:34,930 INFO L386 tUnfolder$Statistics]: existing Event has 297 ancestors and is cut-off event [2022-11-18 18:37:34,930 INFO L386 tUnfolder$Statistics]: existing Event has 232 ancestors and is cut-off event [2022-11-18 18:37:34,930 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1321] funcBEXIT-->L1315-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem69#1_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_funcBThread1of2ForFork1_thidvar0_6) InVars {ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} OutVars{ULTIMATE.start_main_#t~mem69#1=|v_ULTIMATE.start_main_#t~mem69#1_10|, funcBThread1of2ForFork1_thidvar0=v_funcBThread1of2ForFork1_thidvar0_6} AuxVars[] AssignedVars[][335], [408#true, 51#L1250-2true, funcBThread2of2ForFork1InUse, funcAThread1of2ForFork0InUse, 194#L1315-7true, funcAThread2of2ForFork0NotInUse, 432#true, 76#L1265-1true, 430#(= |#race~data1Lock~0| 0), funcBThread1of2ForFork1NotInUse, 441#(= |#race~data2Lock~0| 0)]) [2022-11-18 18:37:34,930 INFO L383 tUnfolder$Statistics]: this new event has 308 ancestors and is cut-off event [2022-11-18 18:37:34,930 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-18 18:37:34,930 INFO L386 tUnfolder$Statistics]: existing Event has 231 ancestors and is cut-off event [2022-11-18 18:37:34,931 INFO L386 tUnfolder$Statistics]: existing Event has 296 ancestors and is cut-off event [2022-11-18 18:37:34,933 INFO L130 PetriNetUnfolder]: 1692/8755 cut-off events. [2022-11-18 18:37:34,933 INFO L131 PetriNetUnfolder]: For 3026/4065 co-relation queries the response was YES. [2022-11-18 18:37:35,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12716 conditions, 8755 events. 1692/8755 cut-off events. For 3026/4065 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 88307 event pairs, 880 based on Foata normal form. 0/7642 useless extension candidates. Maximal degree in co-relation 12696. Up to 1887 conditions per place. [2022-11-18 18:37:35,069 INFO L137 encePairwiseOnDemand]: 414/420 looper letters, 23 selfloop transitions, 1 changer transitions 0/373 dead transitions. [2022-11-18 18:37:35,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 373 transitions, 881 flow [2022-11-18 18:37:35,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:37:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 18:37:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1154 transitions. [2022-11-18 18:37:35,075 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9158730158730158 [2022-11-18 18:37:35,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1154 transitions. [2022-11-18 18:37:35,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1154 transitions. [2022-11-18 18:37:35,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:35,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1154 transitions. [2022-11-18 18:37:35,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 384.6666666666667) internal successors, (1154), 3 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:35,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:35,084 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:35,084 INFO L175 Difference]: Start difference. First operand has 380 places, 378 transitions, 843 flow. Second operand 3 states and 1154 transitions. [2022-11-18 18:37:35,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 373 transitions, 881 flow [2022-11-18 18:37:35,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 373 transitions, 871 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 18:37:35,096 INFO L231 Difference]: Finished difference. Result has 372 places, 373 transitions, 825 flow [2022-11-18 18:37:35,097 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=825, PETRI_PLACES=372, PETRI_TRANSITIONS=373} [2022-11-18 18:37:35,097 INFO L288 CegarLoopForPetriNet]: 405 programPoint places, -33 predicate places. [2022-11-18 18:37:35,097 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 373 transitions, 825 flow [2022-11-18 18:37:35,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:35,098 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:35,098 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] [2022-11-18 18:37:35,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 18:37:35,099 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2022-11-18 18:37:35,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:35,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1226335168, now seen corresponding path program 1 times [2022-11-18 18:37:35,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:35,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792165265] [2022-11-18 18:37:35,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:35,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:35,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:35,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792165265] [2022-11-18 18:37:35,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792165265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:35,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:35,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:37:35,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003181226] [2022-11-18 18:37:35,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:35,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:37:35,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:35,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:37:35,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:37:35,433 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 420 [2022-11-18 18:37:35,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 373 transitions, 825 flow. Second operand has 6 states, 6 states have (on average 328.3333333333333) internal successors, (1970), 6 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:35,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:35,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 420 [2022-11-18 18:37:35,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:36,124 INFO L130 PetriNetUnfolder]: 122/1925 cut-off events. [2022-11-18 18:37:36,124 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-11-18 18:37:36,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2775 conditions, 1925 events. 122/1925 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 12918 event pairs, 10 based on Foata normal form. 0/1730 useless extension candidates. Maximal degree in co-relation 2678. Up to 536 conditions per place. [2022-11-18 18:37:36,148 INFO L137 encePairwiseOnDemand]: 413/420 looper letters, 69 selfloop transitions, 4 changer transitions 0/370 dead transitions. [2022-11-18 18:37:36,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 370 transitions, 965 flow [2022-11-18 18:37:36,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:37:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 18:37:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2038 transitions. [2022-11-18 18:37:36,154 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8087301587301587 [2022-11-18 18:37:36,154 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2038 transitions. [2022-11-18 18:37:36,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2038 transitions. [2022-11-18 18:37:36,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:36,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2038 transitions. [2022-11-18 18:37:36,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 339.6666666666667) internal successors, (2038), 6 states have internal predecessors, (2038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:36,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:36,167 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:36,167 INFO L175 Difference]: Start difference. First operand has 372 places, 373 transitions, 825 flow. Second operand 6 states and 2038 transitions. [2022-11-18 18:37:36,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 370 transitions, 965 flow [2022-11-18 18:37:36,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 370 transitions, 964 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 18:37:36,176 INFO L231 Difference]: Finished difference. Result has 373 places, 370 transitions, 826 flow [2022-11-18 18:37:36,177 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=826, PETRI_PLACES=373, PETRI_TRANSITIONS=370} [2022-11-18 18:37:36,177 INFO L288 CegarLoopForPetriNet]: 405 programPoint places, -32 predicate places. [2022-11-18 18:37:36,177 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 370 transitions, 826 flow [2022-11-18 18:37:36,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 328.3333333333333) internal successors, (1970), 6 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:36,178 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:36,178 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-18 18:37:36,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 18:37:36,179 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2022-11-18 18:37:36,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:36,179 INFO L85 PathProgramCache]: Analyzing trace with hash 931852315, now seen corresponding path program 1 times [2022-11-18 18:37:36,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:36,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403560466] [2022-11-18 18:37:36,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:36,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:36,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:36,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:36,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403560466] [2022-11-18 18:37:36,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403560466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:36,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:36,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:37:36,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428758558] [2022-11-18 18:37:36,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:36,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:37:36,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:36,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:37:36,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:37:36,579 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 420 [2022-11-18 18:37:36,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 370 transitions, 826 flow. Second operand has 6 states, 6 states have (on average 329.1666666666667) internal successors, (1975), 6 states have internal predecessors, (1975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:36,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:36,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 420 [2022-11-18 18:37:36,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:37:37,345 INFO L130 PetriNetUnfolder]: 122/1899 cut-off events. [2022-11-18 18:37:37,345 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-11-18 18:37:37,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2733 conditions, 1899 events. 122/1899 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 12645 event pairs, 10 based on Foata normal form. 0/1730 useless extension candidates. Maximal degree in co-relation 2636. Up to 511 conditions per place. [2022-11-18 18:37:37,381 INFO L137 encePairwiseOnDemand]: 413/420 looper letters, 66 selfloop transitions, 4 changer transitions 0/367 dead transitions. [2022-11-18 18:37:37,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 367 transitions, 960 flow [2022-11-18 18:37:37,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:37:37,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 18:37:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2035 transitions. [2022-11-18 18:37:37,387 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8075396825396826 [2022-11-18 18:37:37,387 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2035 transitions. [2022-11-18 18:37:37,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2035 transitions. [2022-11-18 18:37:37,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:37:37,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2035 transitions. [2022-11-18 18:37:37,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 339.1666666666667) internal successors, (2035), 6 states have internal predecessors, (2035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:37,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:37,399 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:37,399 INFO L175 Difference]: Start difference. First operand has 373 places, 370 transitions, 826 flow. Second operand 6 states and 2035 transitions. [2022-11-18 18:37:37,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 367 transitions, 960 flow [2022-11-18 18:37:37,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 367 transitions, 953 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 18:37:37,408 INFO L231 Difference]: Finished difference. Result has 371 places, 367 transitions, 821 flow [2022-11-18 18:37:37,408 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=821, PETRI_PLACES=371, PETRI_TRANSITIONS=367} [2022-11-18 18:37:37,409 INFO L288 CegarLoopForPetriNet]: 405 programPoint places, -34 predicate places. [2022-11-18 18:37:37,409 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 367 transitions, 821 flow [2022-11-18 18:37:37,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 329.1666666666667) internal successors, (1975), 6 states have internal predecessors, (1975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:37,410 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:37:37,410 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:37:37,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 18:37:37,410 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting funcAErr0ASSERT_VIOLATIONDATA_RACE === [funcAErr0ASSERT_VIOLATIONDATA_RACE, funcAErr1ASSERT_VIOLATIONDATA_RACE, funcAErr2ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 55 more)] === [2022-11-18 18:37:37,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:37:37,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1727375690, now seen corresponding path program 1 times [2022-11-18 18:37:37,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:37:37,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030641536] [2022-11-18 18:37:37,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:37:37,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:37:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:37:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:37:37,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:37:37,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030641536] [2022-11-18 18:37:37,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030641536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:37:37,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:37:37,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:37:37,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187764295] [2022-11-18 18:37:37,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:37:37,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:37:37,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:37:37,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:37:37,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:37:37,480 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 420 [2022-11-18 18:37:37,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 367 transitions, 821 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:37:37,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:37:37,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 420 [2022-11-18 18:37:37,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand