./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/09_fmaxsym.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/09_fmaxsym.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/bin/uautomizer-ZsLfNo2U6R --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 0bf02669c3dd381b0745ab8dce392518dfe698af15c4a94bd383f1dab20a8c06 --- 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-38b53e6 [2022-11-25 17:56:15,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:56:15,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:56:15,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:56:15,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:56:15,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:56:15,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:56:15,236 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:56:15,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:56:15,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:56:15,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:56:15,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:56:15,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:56:15,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:56:15,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:56:15,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:56:15,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:56:15,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:56:15,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:56:15,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:56:15,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:56:15,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:56:15,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:56:15,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:56:15,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:56:15,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:56:15,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:56:15,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:56:15,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:56:15,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:56:15,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:56:15,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:56:15,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:56:15,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:56:15,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:56:15,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:56:15,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:56:15,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:56:15,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:56:15,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:56:15,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:56:15,306 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-25 17:56:15,342 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:56:15,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:56:15,344 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:56:15,344 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:56:15,345 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:56:15,345 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:56:15,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:56:15,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:56:15,347 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:56:15,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:56:15,348 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:56:15,349 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:56:15,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:56:15,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:56:15,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:56:15,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:56:15,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:56:15,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:56:15,351 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-25 17:56:15,351 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:56:15,352 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:56:15,352 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:56:15,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:56:15,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:56:15,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:56:15,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:56:15,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:56:15,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:56:15,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:56:15,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:56:15,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:56:15,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:56:15,356 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:56:15,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:56:15,356 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:56:15,356 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:56:15,357 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/bin/uautomizer-ZsLfNo2U6R/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_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/bin/uautomizer-ZsLfNo2U6R 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 -> 0bf02669c3dd381b0745ab8dce392518dfe698af15c4a94bd383f1dab20a8c06 [2022-11-25 17:56:15,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:56:15,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:56:15,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:56:15,727 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:56:15,728 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:56:15,729 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2022-11-25 17:56:18,917 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:56:19,212 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:56:19,212 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/sv-benchmarks/c/pthread-ext/09_fmaxsym.i [2022-11-25 17:56:19,229 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/bin/uautomizer-ZsLfNo2U6R/data/fe8afc7c2/b9610795cc7c4d6e9d815e3da2bb251f/FLAG2e273fdf8 [2022-11-25 17:56:19,249 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/bin/uautomizer-ZsLfNo2U6R/data/fe8afc7c2/b9610795cc7c4d6e9d815e3da2bb251f [2022-11-25 17:56:19,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:56:19,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:56:19,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:56:19,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:56:19,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:56:19,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:56:19" (1/1) ... [2022-11-25 17:56:19,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56879857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:56:19, skipping insertion in model container [2022-11-25 17:56:19,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:56:19" (1/1) ... [2022-11-25 17:56:19,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:56:19,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:56:19,719 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/sv-benchmarks/c/pthread-ext/09_fmaxsym.i[30422,30435] [2022-11-25 17:56:19,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:56:19,748 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:56:19,813 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/sv-benchmarks/c/pthread-ext/09_fmaxsym.i[30422,30435] [2022-11-25 17:56:19,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:56:19,853 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:56:19,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:56:19 WrapperNode [2022-11-25 17:56:19,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:56:19,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:56:19,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:56:19,856 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:56:19,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:56:19" (1/1) ... [2022-11-25 17:56:19,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:56:19" (1/1) ... [2022-11-25 17:56:19,929 INFO L138 Inliner]: procedures = 171, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2022-11-25 17:56:19,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:56:19,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:56:19,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:56:19,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:56:19,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:56:19" (1/1) ... [2022-11-25 17:56:19,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:56:19" (1/1) ... [2022-11-25 17:56:19,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:56:19" (1/1) ... [2022-11-25 17:56:19,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:56:19" (1/1) ... [2022-11-25 17:56:19,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:56:19" (1/1) ... [2022-11-25 17:56:19,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:56:19" (1/1) ... [2022-11-25 17:56:19,987 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:56:19" (1/1) ... [2022-11-25 17:56:19,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:56:19" (1/1) ... [2022-11-25 17:56:19,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:56:20,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:56:20,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:56:20,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:56:20,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:56:19" (1/1) ... [2022-11-25 17:56:20,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:56:20,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:56:20,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:56:20,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15c5582e-a73a-4ef9-9dbf-6b4749e0a370/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:56:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:56:20,106 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-25 17:56:20,107 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-25 17:56:20,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:56:20,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:56:20,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:56:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:56:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:56:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:56:20,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:56:20,110 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:56:20,340 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:56:20,343 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:56:20,605 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:56:20,711 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:56:20,711 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 17:56:20,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:56:20 BoogieIcfgContainer [2022-11-25 17:56:20,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:56:20,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:56:20,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:56:20,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:56:20,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:56:19" (1/3) ... [2022-11-25 17:56:20,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2824c843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:56:20, skipping insertion in model container [2022-11-25 17:56:20,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:56:19" (2/3) ... [2022-11-25 17:56:20,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2824c843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:56:20, skipping insertion in model container [2022-11-25 17:56:20,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:56:20" (3/3) ... [2022-11-25 17:56:20,725 INFO L112 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym.i [2022-11-25 17:56:20,745 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 17:56:20,758 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:56:20,758 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-25 17:56:20,758 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:56:20,864 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:56:20,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 99 transitions, 203 flow [2022-11-25 17:56:21,030 INFO L130 PetriNetUnfolder]: 7/110 cut-off events. [2022-11-25 17:56:21,032 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:56:21,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 110 events. 7/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. [2022-11-25 17:56:21,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 99 transitions, 203 flow [2022-11-25 17:56:21,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 99 transitions, 203 flow [2022-11-25 17:56:21,053 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:56:21,083 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 99 transitions, 203 flow [2022-11-25 17:56:21,096 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 99 transitions, 203 flow [2022-11-25 17:56:21,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 99 transitions, 203 flow [2022-11-25 17:56:21,135 INFO L130 PetriNetUnfolder]: 7/110 cut-off events. [2022-11-25 17:56:21,135 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:56:21,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 110 events. 7/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. [2022-11-25 17:56:21,138 INFO L119 LiptonReduction]: Number of co-enabled transitions 1708 [2022-11-25 17:56:26,022 INFO L134 LiptonReduction]: Checked pairs total: 1840 [2022-11-25 17:56:26,022 INFO L136 LiptonReduction]: Total number of compositions: 118 [2022-11-25 17:56:26,037 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:56:26,043 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;@27a89b1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:56:26,044 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-11-25 17:56:26,050 INFO L130 PetriNetUnfolder]: 1/10 cut-off events. [2022-11-25 17:56:26,050 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:56:26,050 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:26,052 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:56:26,053 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2022-11-25 17:56:26,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:26,060 INFO L85 PathProgramCache]: Analyzing trace with hash 486981321, now seen corresponding path program 1 times [2022-11-25 17:56:26,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:56:26,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304172768] [2022-11-25 17:56:26,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:26,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:56:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:26,295 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-25 17:56:26,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:56:26,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304172768] [2022-11-25 17:56:26,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304172768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:26,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:26,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:56:26,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007351219] [2022-11-25 17:56:26,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:26,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:56:26,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:56:26,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:56:26,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:56:26,343 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 217 [2022-11-25 17:56:26,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 39 flow. Second operand has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:26,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:26,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 217 [2022-11-25 17:56:26,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:26,388 INFO L130 PetriNetUnfolder]: 7/20 cut-off events. [2022-11-25 17:56:26,400 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:56:26,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 20 events. 7/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 4 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 30. Up to 19 conditions per place. [2022-11-25 17:56:26,402 INFO L137 encePairwiseOnDemand]: 208/217 looper letters, 7 selfloop transitions, 0 changer transitions 0/8 dead transitions. [2022-11-25 17:56:26,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 11 places, 8 transitions, 35 flow [2022-11-25 17:56:26,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:56:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:56:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 188 transitions. [2022-11-25 17:56:26,417 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43317972350230416 [2022-11-25 17:56:26,418 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 188 transitions. [2022-11-25 17:56:26,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 188 transitions. [2022-11-25 17:56:26,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:26,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 188 transitions. [2022-11-25 17:56:26,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:26,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:26,432 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:26,434 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 39 flow. Second operand 2 states and 188 transitions. [2022-11-25 17:56:26,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 11 places, 8 transitions, 35 flow [2022-11-25 17:56:26,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 11 places, 8 transitions, 35 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:56:26,439 INFO L231 Difference]: Finished difference. Result has 11 places, 8 transitions, 21 flow [2022-11-25 17:56:26,442 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=21, PETRI_DIFFERENCE_MINUEND_PLACES=10, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=21, PETRI_PLACES=11, PETRI_TRANSITIONS=8} [2022-11-25 17:56:26,445 INFO L288 CegarLoopForPetriNet]: 19 programPoint places, -8 predicate places. [2022-11-25 17:56:26,446 INFO L495 AbstractCegarLoop]: Abstraction has has 11 places, 8 transitions, 21 flow [2022-11-25 17:56:26,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:26,446 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:26,446 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2022-11-25 17:56:26,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:56:26,447 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2022-11-25 17:56:26,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2083538163, now seen corresponding path program 1 times [2022-11-25 17:56:26,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:56:26,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328220729] [2022-11-25 17:56:26,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:56:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:56:26,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:56:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:56:26,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:56:26,538 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:56:26,540 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2022-11-25 17:56:26,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2022-11-25 17:56:26,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2022-11-25 17:56:26,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2022-11-25 17:56:26,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2022-11-25 17:56:26,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2022-11-25 17:56:26,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2022-11-25 17:56:26,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2022-11-25 17:56:26,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2022-11-25 17:56:26,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2022-11-25 17:56:26,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2022-11-25 17:56:26,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2022-11-25 17:56:26,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2022-11-25 17:56:26,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2022-11-25 17:56:26,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2022-11-25 17:56:26,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2022-11-25 17:56:26,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2022-11-25 17:56:26,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:56:26,547 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-25 17:56:26,550 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 17:56:26,551 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-25 17:56:26,584 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:56:26,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 161 transitions, 334 flow [2022-11-25 17:56:26,631 INFO L130 PetriNetUnfolder]: 13/185 cut-off events. [2022-11-25 17:56:26,631 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 17:56:26,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 185 events. 13/185 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 355 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 135. Up to 6 conditions per place. [2022-11-25 17:56:26,635 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 161 transitions, 334 flow [2022-11-25 17:56:26,638 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 161 transitions, 334 flow [2022-11-25 17:56:26,638 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:56:26,638 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 161 transitions, 334 flow [2022-11-25 17:56:26,639 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 161 transitions, 334 flow [2022-11-25 17:56:26,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 161 transitions, 334 flow [2022-11-25 17:56:26,675 INFO L130 PetriNetUnfolder]: 13/185 cut-off events. [2022-11-25 17:56:26,676 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 17:56:26,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 185 events. 13/185 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 355 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 135. Up to 6 conditions per place. [2022-11-25 17:56:26,685 INFO L119 LiptonReduction]: Number of co-enabled transitions 10980 [2022-11-25 17:56:31,170 INFO L134 LiptonReduction]: Checked pairs total: 28604 [2022-11-25 17:56:31,170 INFO L136 LiptonReduction]: Total number of compositions: 151 [2022-11-25 17:56:31,173 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:56:31,174 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;@27a89b1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:56:31,174 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-25 17:56:31,177 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-11-25 17:56:31,177 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:56:31,178 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:31,178 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:56:31,178 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2022-11-25 17:56:31,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:31,179 INFO L85 PathProgramCache]: Analyzing trace with hash 852170202, now seen corresponding path program 1 times [2022-11-25 17:56:31,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:56:31,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756434054] [2022-11-25 17:56:31,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:31,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:56:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:31,221 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-25 17:56:31,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:56:31,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756434054] [2022-11-25 17:56:31,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756434054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:31,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:31,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:56:31,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105671957] [2022-11-25 17:56:31,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:31,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:56:31,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:56:31,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:56:31,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:56:31,225 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 312 [2022-11-25 17:56:31,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 124 flow. Second operand has 2 states, 2 states have (on average 139.5) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:31,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 312 [2022-11-25 17:56:31,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:31,340 INFO L130 PetriNetUnfolder]: 218/531 cut-off events. [2022-11-25 17:56:31,340 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-25 17:56:31,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 531 events. 218/531 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3026 event pairs, 152 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 181. Up to 349 conditions per place. [2022-11-25 17:56:31,345 INFO L137 encePairwiseOnDemand]: 299/312 looper letters, 20 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2022-11-25 17:56:31,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 138 flow [2022-11-25 17:56:31,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:56:31,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:56:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2022-11-25 17:56:31,349 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49198717948717946 [2022-11-25 17:56:31,349 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2022-11-25 17:56:31,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2022-11-25 17:56:31,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:31,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2022-11-25 17:56:31,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 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-25 17:56:31,356 INFO L81 ComplementDD]: Finished complementDD. Result has 3 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-25 17:56:31,356 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 124 flow. Second operand 2 states and 307 transitions. [2022-11-25 17:56:31,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 138 flow [2022-11-25 17:56:31,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 136 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-25 17:56:31,358 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 96 flow [2022-11-25 17:56:31,359 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=96, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2022-11-25 17:56:31,359 INFO L288 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2022-11-25 17:56:31,360 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 96 flow [2022-11-25 17:56:31,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 139.5) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,360 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:31,361 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:31,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:56:31,361 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2022-11-25 17:56:31,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:31,362 INFO L85 PathProgramCache]: Analyzing trace with hash -548379195, now seen corresponding path program 1 times [2022-11-25 17:56:31,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:56:31,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324607576] [2022-11-25 17:56:31,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:31,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:56:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:31,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-25 17:56:31,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:56:31,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324607576] [2022-11-25 17:56:31,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324607576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:31,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:31,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:56:31,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062750777] [2022-11-25 17:56:31,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:31,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:56:31,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:56:31,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:56:31,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:56:31,469 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 312 [2022-11-25 17:56:31,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:31,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 312 [2022-11-25 17:56:31,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:31,745 INFO L130 PetriNetUnfolder]: 854/1605 cut-off events. [2022-11-25 17:56:31,746 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-25 17:56:31,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3108 conditions, 1605 events. 854/1605 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9427 event pairs, 266 based on Foata normal form. 0/1437 useless extension candidates. Maximal degree in co-relation 3103. Up to 938 conditions per place. [2022-11-25 17:56:31,757 INFO L137 encePairwiseOnDemand]: 298/312 looper letters, 50 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2022-11-25 17:56:31,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 275 flow [2022-11-25 17:56:31,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:56:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:56:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2022-11-25 17:56:31,761 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46260683760683763 [2022-11-25 17:56:31,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2022-11-25 17:56:31,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2022-11-25 17:56:31,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:31,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2022-11-25 17:56:31,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,768 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 96 flow. Second operand 3 states and 433 transitions. [2022-11-25 17:56:31,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 275 flow [2022-11-25 17:56:31,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 70 transitions, 275 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:56:31,770 INFO L231 Difference]: Finished difference. Result has 49 places, 53 transitions, 184 flow [2022-11-25 17:56:31,771 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=49, PETRI_TRANSITIONS=53} [2022-11-25 17:56:31,772 INFO L288 CegarLoopForPetriNet]: 55 programPoint places, -6 predicate places. [2022-11-25 17:56:31,772 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 53 transitions, 184 flow [2022-11-25 17:56:31,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,773 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:31,773 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-11-25 17:56:31,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:56:31,773 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2022-11-25 17:56:31,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:31,774 INFO L85 PathProgramCache]: Analyzing trace with hash -983963051, now seen corresponding path program 1 times [2022-11-25 17:56:31,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:56:31,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636885885] [2022-11-25 17:56:31,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:31,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:56:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:56:31,792 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:56:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:56:31,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:56:31,808 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:56:31,808 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2022-11-25 17:56:31,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2022-11-25 17:56:31,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2022-11-25 17:56:31,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2022-11-25 17:56:31,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2022-11-25 17:56:31,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2022-11-25 17:56:31,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2022-11-25 17:56:31,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2022-11-25 17:56:31,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2022-11-25 17:56:31,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2022-11-25 17:56:31,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2022-11-25 17:56:31,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2022-11-25 17:56:31,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2022-11-25 17:56:31,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2022-11-25 17:56:31,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2022-11-25 17:56:31,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2022-11-25 17:56:31,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2022-11-25 17:56:31,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2022-11-25 17:56:31,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2022-11-25 17:56:31,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2022-11-25 17:56:31,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2022-11-25 17:56:31,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2022-11-25 17:56:31,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2022-11-25 17:56:31,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2022-11-25 17:56:31,815 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2022-11-25 17:56:31,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:56:31,815 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-11-25 17:56:31,816 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 17:56:31,816 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-25 17:56:31,852 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:56:31,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 223 transitions, 467 flow [2022-11-25 17:56:31,899 INFO L130 PetriNetUnfolder]: 19/260 cut-off events. [2022-11-25 17:56:31,900 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-25 17:56:31,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 260 events. 19/260 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 696 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 196. Up to 8 conditions per place. [2022-11-25 17:56:31,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 214 places, 223 transitions, 467 flow [2022-11-25 17:56:31,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 214 places, 223 transitions, 467 flow [2022-11-25 17:56:31,908 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:56:31,908 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 223 transitions, 467 flow [2022-11-25 17:56:31,908 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 214 places, 223 transitions, 467 flow [2022-11-25 17:56:31,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 223 transitions, 467 flow [2022-11-25 17:56:31,951 INFO L130 PetriNetUnfolder]: 19/260 cut-off events. [2022-11-25 17:56:31,951 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-25 17:56:31,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 260 events. 19/260 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 696 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 196. Up to 8 conditions per place. [2022-11-25 17:56:31,986 INFO L119 LiptonReduction]: Number of co-enabled transitions 27816 [2022-11-25 17:56:38,127 INFO L134 LiptonReduction]: Checked pairs total: 74547 [2022-11-25 17:56:38,127 INFO L136 LiptonReduction]: Total number of compositions: 208 [2022-11-25 17:56:38,142 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:56:38,148 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;@27a89b1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:56:38,148 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2022-11-25 17:56:38,151 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-11-25 17:56:38,154 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:56:38,155 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:38,155 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:56:38,155 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2022-11-25 17:56:38,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:38,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1319637700, now seen corresponding path program 1 times [2022-11-25 17:56:38,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:56:38,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441224444] [2022-11-25 17:56:38,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:38,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:56:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:38,199 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-25 17:56:38,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:56:38,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441224444] [2022-11-25 17:56:38,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441224444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:38,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:38,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:56:38,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601132149] [2022-11-25 17:56:38,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:38,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:56:38,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:56:38,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:56:38,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:56:38,212 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 431 [2022-11-25 17:56:38,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 183 flow. Second operand has 2 states, 2 states have (on average 190.5) internal successors, (381), 2 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:38,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:38,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 431 [2022-11-25 17:56:38,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:38,998 INFO L130 PetriNetUnfolder]: 2909/5394 cut-off events. [2022-11-25 17:56:38,998 INFO L131 PetriNetUnfolder]: For 487/487 co-relation queries the response was YES. [2022-11-25 17:56:39,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9748 conditions, 5394 events. 2909/5394 cut-off events. For 487/487 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 40325 event pairs, 2119 based on Foata normal form. 0/4393 useless extension candidates. Maximal degree in co-relation 931. Up to 3952 conditions per place. [2022-11-25 17:56:39,049 INFO L137 encePairwiseOnDemand]: 412/431 looper letters, 29 selfloop transitions, 0 changer transitions 0/62 dead transitions. [2022-11-25 17:56:39,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 203 flow [2022-11-25 17:56:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:56:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:56:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 424 transitions. [2022-11-25 17:56:39,052 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4918793503480278 [2022-11-25 17:56:39,052 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 424 transitions. [2022-11-25 17:56:39,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 424 transitions. [2022-11-25 17:56:39,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:39,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 424 transitions. [2022-11-25 17:56:39,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 212.0) internal successors, (424), 2 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:39,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 431.0) internal successors, (1293), 3 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:39,059 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 431.0) internal successors, (1293), 3 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:39,059 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 183 flow. Second operand 2 states and 424 transitions. [2022-11-25 17:56:39,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 203 flow [2022-11-25 17:56:39,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 197 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-25 17:56:39,063 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 139 flow [2022-11-25 17:56:39,063 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=139, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2022-11-25 17:56:39,064 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -15 predicate places. [2022-11-25 17:56:39,064 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 139 flow [2022-11-25 17:56:39,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 190.5) internal successors, (381), 2 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:39,065 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:39,065 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:39,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:56:39,066 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2022-11-25 17:56:39,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1492294718, now seen corresponding path program 1 times [2022-11-25 17:56:39,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:56:39,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968913921] [2022-11-25 17:56:39,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:39,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:56:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:39,107 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-25 17:56:39,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:56:39,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968913921] [2022-11-25 17:56:39,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968913921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:39,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:39,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:56:39,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913649206] [2022-11-25 17:56:39,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:39,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:56:39,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:56:39,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:56:39,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:56:39,149 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 431 [2022-11-25 17:56:39,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:39,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:39,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 431 [2022-11-25 17:56:39,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:43,196 INFO L130 PetriNetUnfolder]: 20044/31248 cut-off events. [2022-11-25 17:56:43,197 INFO L131 PetriNetUnfolder]: For 813/813 co-relation queries the response was YES. [2022-11-25 17:56:43,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60443 conditions, 31248 events. 20044/31248 cut-off events. For 813/813 co-relation queries the response was YES. Maximal size of possible extension queue 1220. Compared 234774 event pairs, 6581 based on Foata normal form. 0/27670 useless extension candidates. Maximal degree in co-relation 60437. Up to 18079 conditions per place. [2022-11-25 17:56:43,428 INFO L137 encePairwiseOnDemand]: 410/431 looper letters, 71 selfloop transitions, 15 changer transitions 0/101 dead transitions. [2022-11-25 17:56:43,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 101 transitions, 399 flow [2022-11-25 17:56:43,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:56:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:56:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 593 transitions. [2022-11-25 17:56:43,431 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4586233565351895 [2022-11-25 17:56:43,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 593 transitions. [2022-11-25 17:56:43,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 593 transitions. [2022-11-25 17:56:43,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:43,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 593 transitions. [2022-11-25 17:56:43,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 197.66666666666666) internal successors, (593), 3 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:43,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 431.0) internal successors, (1724), 4 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:43,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 431.0) internal successors, (1724), 4 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:43,439 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 139 flow. Second operand 3 states and 593 transitions. [2022-11-25 17:56:43,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 101 transitions, 399 flow [2022-11-25 17:56:43,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 399 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:56:43,443 INFO L231 Difference]: Finished difference. Result has 68 places, 77 transitions, 271 flow [2022-11-25 17:56:43,443 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=68, PETRI_TRANSITIONS=77} [2022-11-25 17:56:43,444 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -11 predicate places. [2022-11-25 17:56:43,444 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 77 transitions, 271 flow [2022-11-25 17:56:43,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:43,445 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:43,445 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:43,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:56:43,446 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2022-11-25 17:56:43,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:43,446 INFO L85 PathProgramCache]: Analyzing trace with hash 733032944, now seen corresponding path program 1 times [2022-11-25 17:56:43,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:56:43,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934229128] [2022-11-25 17:56:43,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:43,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:56:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:43,483 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-25 17:56:43,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:56:43,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934229128] [2022-11-25 17:56:43,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934229128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:43,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:43,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:56:43,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568372970] [2022-11-25 17:56:43,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:43,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:56:43,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:56:43,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:56:43,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:56:43,540 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 431 [2022-11-25 17:56:43,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 77 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:43,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:43,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 431 [2022-11-25 17:56:43,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:45,877 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L709-3-->L713-1: Formula: (and (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|) (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|, #race~m~0=|v_#race~m~0_87|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][56], [Black: 220#true, 208#L713-1true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 50#L705-6true, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true, 121#L725-5true]) [2022-11-25 17:56:45,877 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-11-25 17:56:45,877 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 17:56:45,878 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:56:45,878 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 17:56:45,881 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1132] L709-3-->L713-1: Formula: (and (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= v_~m~0_66 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15|, ~m~0=v_~m~0_66, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, #race~m~0=|v_#race~m~0_87|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, #race~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][36], [Black: 220#true, 171#L713-1true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true, 121#L725-5true, 23#L705-6true]) [2022-11-25 17:56:45,881 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-11-25 17:56:45,881 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:56:45,881 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 17:56:45,882 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 17:56:46,140 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L709-3-->L713-1: Formula: (and (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|) (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|, #race~m~0=|v_#race~m~0_87|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][56], [Black: 220#true, 208#L713-1true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 3#L706-5true, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true, 121#L725-5true]) [2022-11-25 17:56:46,141 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-11-25 17:56:46,141 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 17:56:46,141 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 17:56:46,141 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:56:46,143 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L709-3-->L713-1: Formula: (and (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|) (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|, #race~m~0=|v_#race~m~0_87|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][56], [Black: 220#true, 208#L713-1true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true, 163#thr1EXITtrue, 121#L725-5true]) [2022-11-25 17:56:46,143 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-11-25 17:56:46,143 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 17:56:46,143 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:56:46,143 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 17:56:46,172 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L709-3-->L713-1: Formula: (and (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|) (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|, #race~m~0=|v_#race~m~0_87|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][56], [Black: 220#true, 171#L713-1true, 208#L713-1true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 226#true, 222#(= |#race~max~0| 0), 217#true, 121#L725-5true, 167#L713-1true]) [2022-11-25 17:56:46,172 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-11-25 17:56:46,172 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-11-25 17:56:46,173 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 17:56:46,173 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 17:56:46,179 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1132] L709-3-->L713-1: Formula: (and (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= v_~m~0_66 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15|, ~m~0=v_~m~0_66, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, #race~m~0=|v_#race~m~0_87|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, #race~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][36], [Black: 220#true, 171#L713-1true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 41#L706-5true, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true, 121#L725-5true]) [2022-11-25 17:56:46,180 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-11-25 17:56:46,180 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 17:56:46,180 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:56:46,180 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 17:56:46,181 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1132] L709-3-->L713-1: Formula: (and (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= v_~m~0_66 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15|, ~m~0=v_~m~0_66, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, #race~m~0=|v_#race~m~0_87|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, #race~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][36], [Black: 220#true, 171#L713-1true, thr1Thread1of3ForFork0InUse, 15#thr1EXITtrue, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true, 121#L725-5true]) [2022-11-25 17:56:46,181 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-11-25 17:56:46,182 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 17:56:46,182 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 17:56:46,182 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:56:46,265 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L709-3-->L713-1: Formula: (and (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|) (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|, #race~m~0=|v_#race~m~0_87|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][56], [Black: 220#true, 208#L713-1true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 160#L707-2true, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true, 121#L725-5true]) [2022-11-25 17:56:46,266 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-11-25 17:56:46,266 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:56:46,266 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 17:56:46,266 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 17:56:46,294 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1132] L709-3-->L713-1: Formula: (and (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= v_~m~0_66 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15|, ~m~0=v_~m~0_66, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, #race~m~0=|v_#race~m~0_87|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, #race~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][36], [Black: 220#true, 182#L707-2true, 171#L713-1true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true, 121#L725-5true]) [2022-11-25 17:56:46,294 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-11-25 17:56:46,295 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 17:56:46,295 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 17:56:46,295 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:56:46,340 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L709-3-->L713-1: Formula: (and (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|) (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|, #race~m~0=|v_#race~m~0_87|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][56], [Black: 220#true, 208#L713-1true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 77#L725-4true, thr1Thread3of3ForFork0InUse, 50#L705-6true, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true]) [2022-11-25 17:56:46,340 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-11-25 17:56:46,340 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 17:56:46,340 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-11-25 17:56:46,340 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-11-25 17:56:46,342 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1132] L709-3-->L713-1: Formula: (and (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= v_~m~0_66 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15|, ~m~0=v_~m~0_66, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, #race~m~0=|v_#race~m~0_87|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, #race~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][36], [Black: 220#true, 171#L713-1true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 77#L725-4true, thr1Thread3of3ForFork0InUse, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true, 23#L705-6true]) [2022-11-25 17:56:46,343 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-11-25 17:56:46,343 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-11-25 17:56:46,343 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 17:56:46,343 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-11-25 17:56:46,423 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L709-3-->L713-1: Formula: (and (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|) (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|, #race~m~0=|v_#race~m~0_87|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][56], [Black: 220#true, 208#L713-1true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 77#L725-4true, thr1Thread3of3ForFork0InUse, 3#L706-5true, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true]) [2022-11-25 17:56:46,423 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-11-25 17:56:46,423 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 17:56:46,423 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 17:56:46,424 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 17:56:46,425 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L709-3-->L713-1: Formula: (and (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|) (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|, #race~m~0=|v_#race~m~0_87|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][56], [Black: 220#true, 208#L713-1true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 77#L725-4true, thr1Thread3of3ForFork0InUse, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true, 163#thr1EXITtrue]) [2022-11-25 17:56:46,425 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-11-25 17:56:46,425 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 17:56:46,425 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 17:56:46,426 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 17:56:46,456 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L709-3-->L713-1: Formula: (and (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|) (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|, #race~m~0=|v_#race~m~0_87|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][56], [Black: 220#true, 171#L713-1true, 208#L713-1true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 77#L725-4true, thr1Thread3of3ForFork0InUse, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true]) [2022-11-25 17:56:46,457 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-11-25 17:56:46,457 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-11-25 17:56:46,457 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-11-25 17:56:46,457 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-11-25 17:56:46,465 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1132] L709-3-->L713-1: Formula: (and (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= v_~m~0_66 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15|, ~m~0=v_~m~0_66, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, #race~m~0=|v_#race~m~0_87|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, #race~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][36], [Black: 220#true, 171#L713-1true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 77#L725-4true, thr1Thread3of3ForFork0InUse, 41#L706-5true, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true]) [2022-11-25 17:56:46,465 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-11-25 17:56:46,466 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 17:56:46,466 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 17:56:46,466 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 17:56:46,467 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1132] L709-3-->L713-1: Formula: (and (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= v_~m~0_66 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15|, ~m~0=v_~m~0_66, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, #race~m~0=|v_#race~m~0_87|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, #race~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][36], [Black: 220#true, 171#L713-1true, thr1Thread1of3ForFork0InUse, 15#thr1EXITtrue, thr1Thread2of3ForFork0InUse, 77#L725-4true, thr1Thread3of3ForFork0InUse, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true]) [2022-11-25 17:56:46,467 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-11-25 17:56:46,467 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 17:56:46,467 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 17:56:46,467 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 17:56:46,535 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1010] L709-3-->L713-1: Formula: (and (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|) (not (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= |v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_15|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_11|, #race~m~0=|v_#race~m~0_87|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][56], [Black: 220#true, 208#L713-1true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 77#L725-4true, thr1Thread3of3ForFork0InUse, 160#L707-2true, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true]) [2022-11-25 17:56:46,535 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-11-25 17:56:46,535 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 17:56:46,535 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 17:56:46,536 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 17:56:46,576 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1132] L709-3-->L713-1: Formula: (and (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15| 0)) (= v_~m~0_66 0) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11| (ite (= v_~m~0_67 1) 1 0)) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15| |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_15|, ~m~0=v_~m~0_66, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, #race~m~0=|v_#race~m~0_87|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~m~0, #race~m~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1][36], [Black: 220#true, 182#L707-2true, 171#L713-1true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 77#L725-4true, thr1Thread3of3ForFork0InUse, 226#true, 222#(= |#race~max~0| 0), 217#true, 167#L713-1true]) [2022-11-25 17:56:46,577 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-11-25 17:56:46,577 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 17:56:46,577 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 17:56:46,577 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 17:56:46,922 INFO L130 PetriNetUnfolder]: 18411/29580 cut-off events. [2022-11-25 17:56:46,922 INFO L131 PetriNetUnfolder]: For 10375/10571 co-relation queries the response was YES. [2022-11-25 17:56:47,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68459 conditions, 29580 events. 18411/29580 cut-off events. For 10375/10571 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 230725 event pairs, 9857 based on Foata normal form. 26/25661 useless extension candidates. Maximal degree in co-relation 68451. Up to 22983 conditions per place. [2022-11-25 17:56:47,148 INFO L137 encePairwiseOnDemand]: 422/431 looper letters, 60 selfloop transitions, 15 changer transitions 0/107 dead transitions. [2022-11-25 17:56:47,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 107 transitions, 527 flow [2022-11-25 17:56:47,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:56:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:56:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 583 transitions. [2022-11-25 17:56:47,151 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4508894044856922 [2022-11-25 17:56:47,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 583 transitions. [2022-11-25 17:56:47,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 583 transitions. [2022-11-25 17:56:47,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:47,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 583 transitions. [2022-11-25 17:56:47,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:47,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 431.0) internal successors, (1724), 4 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:47,158 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 431.0) internal successors, (1724), 4 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:47,159 INFO L175 Difference]: Start difference. First operand has 68 places, 77 transitions, 271 flow. Second operand 3 states and 583 transitions. [2022-11-25 17:56:47,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 107 transitions, 527 flow [2022-11-25 17:56:47,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 107 transitions, 485 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:56:47,261 INFO L231 Difference]: Finished difference. Result has 69 places, 90 transitions, 364 flow [2022-11-25 17:56:47,262 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=431, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=69, PETRI_TRANSITIONS=90} [2022-11-25 17:56:47,263 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -10 predicate places. [2022-11-25 17:56:47,264 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 90 transitions, 364 flow [2022-11-25 17:56:47,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:47,264 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:47,265 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-11-25 17:56:47,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:56:47,265 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2022-11-25 17:56:47,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:47,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1350797814, now seen corresponding path program 1 times [2022-11-25 17:56:47,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:56:47,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153311498] [2022-11-25 17:56:47,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:56:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:56:47,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:56:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:56:47,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:56:47,329 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:56:47,329 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 33 remaining) [2022-11-25 17:56:47,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2022-11-25 17:56:47,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2022-11-25 17:56:47,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2022-11-25 17:56:47,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2022-11-25 17:56:47,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2022-11-25 17:56:47,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2022-11-25 17:56:47,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2022-11-25 17:56:47,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2022-11-25 17:56:47,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2022-11-25 17:56:47,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2022-11-25 17:56:47,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2022-11-25 17:56:47,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2022-11-25 17:56:47,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2022-11-25 17:56:47,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2022-11-25 17:56:47,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2022-11-25 17:56:47,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2022-11-25 17:56:47,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2022-11-25 17:56:47,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 33 remaining) [2022-11-25 17:56:47,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2022-11-25 17:56:47,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2022-11-25 17:56:47,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2022-11-25 17:56:47,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2022-11-25 17:56:47,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2022-11-25 17:56:47,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2022-11-25 17:56:47,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2022-11-25 17:56:47,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2022-11-25 17:56:47,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 33 remaining) [2022-11-25 17:56:47,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2022-11-25 17:56:47,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2022-11-25 17:56:47,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2022-11-25 17:56:47,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2022-11-25 17:56:47,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2022-11-25 17:56:47,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:56:47,344 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-25 17:56:47,345 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 17:56:47,345 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-25 17:56:47,397 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:56:47,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 285 transitions, 602 flow [2022-11-25 17:56:47,467 INFO L130 PetriNetUnfolder]: 25/335 cut-off events. [2022-11-25 17:56:47,467 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 17:56:47,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 335 events. 25/335 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1081 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 268. Up to 10 conditions per place. [2022-11-25 17:56:47,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 273 places, 285 transitions, 602 flow [2022-11-25 17:56:47,477 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 273 places, 285 transitions, 602 flow [2022-11-25 17:56:47,477 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:56:47,478 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 273 places, 285 transitions, 602 flow [2022-11-25 17:56:47,478 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 273 places, 285 transitions, 602 flow [2022-11-25 17:56:47,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 285 transitions, 602 flow [2022-11-25 17:56:47,536 INFO L130 PetriNetUnfolder]: 25/335 cut-off events. [2022-11-25 17:56:47,537 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 17:56:47,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 335 events. 25/335 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1081 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 268. Up to 10 conditions per place. [2022-11-25 17:56:47,567 INFO L119 LiptonReduction]: Number of co-enabled transitions 52216 [2022-11-25 17:56:55,788 INFO L134 LiptonReduction]: Checked pairs total: 144780 [2022-11-25 17:56:55,788 INFO L136 LiptonReduction]: Total number of compositions: 261 [2022-11-25 17:56:55,790 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:56:55,791 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;@27a89b1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:56:55,791 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-11-25 17:56:55,794 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-11-25 17:56:55,794 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:56:55,795 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:55,795 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:56:55,795 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-25 17:56:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1892861568, now seen corresponding path program 1 times [2022-11-25 17:56:55,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:56:55,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481862149] [2022-11-25 17:56:55,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:56:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:55,839 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-25 17:56:55,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:56:55,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481862149] [2022-11-25 17:56:55,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481862149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:55,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:55,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:56:55,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962791437] [2022-11-25 17:56:55,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:55,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:56:55,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:56:55,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:56:55,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:56:55,849 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 546 [2022-11-25 17:56:55,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 106 transitions, 244 flow. Second operand has 2 states, 2 states have (on average 241.5) internal successors, (483), 2 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:55,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:55,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 546 [2022-11-25 17:56:55,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:57:01,496 INFO L130 PetriNetUnfolder]: 32645/52513 cut-off events. [2022-11-25 17:57:01,497 INFO L131 PetriNetUnfolder]: For 7056/7056 co-relation queries the response was YES. [2022-11-25 17:57:01,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97601 conditions, 52513 events. 32645/52513 cut-off events. For 7056/7056 co-relation queries the response was YES. Maximal size of possible extension queue 2298. Compared 453449 event pairs, 24239 based on Foata normal form. 0/43454 useless extension candidates. Maximal degree in co-relation 9857. Up to 40984 conditions per place. [2022-11-25 17:57:02,045 INFO L137 encePairwiseOnDemand]: 521/546 looper letters, 38 selfloop transitions, 0 changer transitions 0/81 dead transitions. [2022-11-25 17:57:02,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 270 flow [2022-11-25 17:57:02,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:57:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:57:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 541 transitions. [2022-11-25 17:57:02,051 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49542124542124544 [2022-11-25 17:57:02,051 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 541 transitions. [2022-11-25 17:57:02,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 541 transitions. [2022-11-25 17:57:02,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:57:02,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 541 transitions. [2022-11-25 17:57:02,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 270.5) internal successors, (541), 2 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:57:02,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 546.0) internal successors, (1638), 3 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:57:02,060 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 546.0) internal successors, (1638), 3 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:57:02,061 INFO L175 Difference]: Start difference. First operand has 103 places, 106 transitions, 244 flow. Second operand 2 states and 541 transitions. [2022-11-25 17:57:02,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 270 flow [2022-11-25 17:57:02,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 81 transitions, 258 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-11-25 17:57:02,077 INFO L231 Difference]: Finished difference. Result has 83 places, 81 transitions, 182 flow [2022-11-25 17:57:02,077 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=546, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=182, PETRI_PLACES=83, PETRI_TRANSITIONS=81} [2022-11-25 17:57:02,079 INFO L288 CegarLoopForPetriNet]: 103 programPoint places, -20 predicate places. [2022-11-25 17:57:02,080 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 81 transitions, 182 flow [2022-11-25 17:57:02,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 241.5) internal successors, (483), 2 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:57:02,080 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:57:02,081 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:57:02,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:57:02,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2022-11-25 17:57:02,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:57:02,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1615258228, now seen corresponding path program 1 times [2022-11-25 17:57:02,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:57:02,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112531727] [2022-11-25 17:57:02,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:57:02,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:57:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:57:02,126 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-25 17:57:02,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:57:02,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112531727] [2022-11-25 17:57:02,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112531727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:57:02,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:57:02,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:57:02,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673327935] [2022-11-25 17:57:02,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:57:02,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:57:02,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:57:02,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:57:02,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:57:02,180 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 546 [2022-11-25 17:57:02,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 81 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:57:02,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:57:02,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 546 [2022-11-25 17:57:02,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand