./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be2a0d1eee532c8ad9f827ec91fa18dbacb100bdaebd8afe9a7f9b56098458ea --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:54:34,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:54:34,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:54:34,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:54:34,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:54:34,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:54:34,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:54:34,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:54:34,401 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:54:34,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:54:34,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:54:34,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:54:34,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:54:34,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:54:34,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:54:34,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:54:34,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:54:34,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:54:34,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:54:34,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:54:34,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:54:34,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:54:34,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:54:34,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:54:34,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:54:34,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:54:34,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:54:34,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:54:34,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:54:34,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:54:34,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:54:34,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:54:34,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:54:34,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:54:34,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:54:34,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:54:34,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:54:34,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:54:34,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:54:34,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:54:34,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:54:34,462 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:54:34,504 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:54:34,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:54:34,504 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:54:34,505 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:54:34,505 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:54:34,505 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:54:34,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:54:34,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:54:34,508 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:54:34,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:54:34,509 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:54:34,510 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:54:34,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:54:34,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:54:34,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:54:34,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:54:34,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:54:34,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:54:34,511 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:54:34,511 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:54:34,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:54:34,512 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:54:34,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:54:34,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:54:34,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:54:34,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:54:34,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:54:34,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:54:34,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:54:34,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:54:34,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:54:34,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:54:34,515 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:54:34,515 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:54:34,515 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:54:34,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be2a0d1eee532c8ad9f827ec91fa18dbacb100bdaebd8afe9a7f9b56098458ea [2022-11-02 20:54:34,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:54:34,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:54:34,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:54:34,860 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:54:34,861 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:54:34,862 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2022-11-02 20:54:34,927 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc/data/4b1b25993/0594843149504402a553a873c5418079/FLAG4f226ea85 [2022-11-02 20:54:35,358 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:54:35,359 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2022-11-02 20:54:35,366 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc/data/4b1b25993/0594843149504402a553a873c5418079/FLAG4f226ea85 [2022-11-02 20:54:35,754 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc/data/4b1b25993/0594843149504402a553a873c5418079 [2022-11-02 20:54:35,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:54:35,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:54:35,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:54:35,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:54:35,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:54:35,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:54:35" (1/1) ... [2022-11-02 20:54:35,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18244c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:35, skipping insertion in model container [2022-11-02 20:54:35,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:54:35" (1/1) ... [2022-11-02 20:54:35,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:54:35,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:54:36,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c[3015,3028] [2022-11-02 20:54:36,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:54:36,042 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:54:36,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c[3015,3028] [2022-11-02 20:54:36,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:54:36,097 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:54:36,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:36 WrapperNode [2022-11-02 20:54:36,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:54:36,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:54:36,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:54:36,100 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:54:36,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:36" (1/1) ... [2022-11-02 20:54:36,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:36" (1/1) ... [2022-11-02 20:54:36,155 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 346 [2022-11-02 20:54:36,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:54:36,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:54:36,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:54:36,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:54:36,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:36" (1/1) ... [2022-11-02 20:54:36,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:36" (1/1) ... [2022-11-02 20:54:36,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:36" (1/1) ... [2022-11-02 20:54:36,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:36" (1/1) ... [2022-11-02 20:54:36,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:36" (1/1) ... [2022-11-02 20:54:36,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:36" (1/1) ... [2022-11-02 20:54:36,188 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:36" (1/1) ... [2022-11-02 20:54:36,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:36" (1/1) ... [2022-11-02 20:54:36,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:54:36,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:54:36,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:54:36,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:54:36,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:36" (1/1) ... [2022-11-02 20:54:36,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:54:36,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:36,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:54:36,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:54:36,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:54:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:54:36,308 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:54:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:54:36,308 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:54:36,310 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:54:36,310 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:54:36,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:54:36,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:54:36,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:54:36,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:54:36,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:54:36,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:54:36,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:54:36,314 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:54:36,445 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:54:36,448 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:54:37,146 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:54:37,158 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:54:37,159 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:54:37,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:37 BoogieIcfgContainer [2022-11-02 20:54:37,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:54:37,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:54:37,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:54:37,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:54:37,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:54:35" (1/3) ... [2022-11-02 20:54:37,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c84b7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:37, skipping insertion in model container [2022-11-02 20:54:37,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:36" (2/3) ... [2022-11-02 20:54:37,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c84b7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:37, skipping insertion in model container [2022-11-02 20:54:37,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:37" (3/3) ... [2022-11-02 20:54:37,171 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-subst.wvr.c [2022-11-02 20:54:37,180 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:54:37,191 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:54:37,191 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2022-11-02 20:54:37,191 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:54:37,395 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:54:37,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 438 places, 455 transitions, 934 flow [2022-11-02 20:54:37,699 INFO L130 PetriNetUnfolder]: 27/452 cut-off events. [2022-11-02 20:54:37,699 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:54:37,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 452 events. 27/452 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1322 event pairs, 0 based on Foata normal form. 0/381 useless extension candidates. Maximal degree in co-relation 296. Up to 2 conditions per place. [2022-11-02 20:54:37,714 INFO L82 GeneralOperation]: Start removeDead. Operand has 438 places, 455 transitions, 934 flow [2022-11-02 20:54:37,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 414 places, 429 transitions, 876 flow [2022-11-02 20:54:37,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:54:37,746 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;@775fdfbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:54:37,746 INFO L358 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2022-11-02 20:54:37,751 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-11-02 20:54:37,751 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:54:37,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:37,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:37,753 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:37,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:37,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1079963987, now seen corresponding path program 1 times [2022-11-02 20:54:37,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:37,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681353416] [2022-11-02 20:54:37,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:37,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:37,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:37,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681353416] [2022-11-02 20:54:37,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681353416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:37,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:37,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:37,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462945498] [2022-11-02 20:54:37,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:38,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:38,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:38,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:38,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:38,058 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 455 [2022-11-02 20:54:38,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 429 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:38,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:38,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 455 [2022-11-02 20:54:38,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:38,572 INFO L130 PetriNetUnfolder]: 86/1386 cut-off events. [2022-11-02 20:54:38,573 INFO L131 PetriNetUnfolder]: For 59/64 co-relation queries the response was YES. [2022-11-02 20:54:38,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1535 conditions, 1386 events. 86/1386 cut-off events. For 59/64 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 9090 event pairs, 39 based on Foata normal form. 43/1218 useless extension candidates. Maximal degree in co-relation 1293. Up to 90 conditions per place. [2022-11-02 20:54:38,607 INFO L137 encePairwiseOnDemand]: 445/455 looper letters, 15 selfloop transitions, 2 changer transitions 1/421 dead transitions. [2022-11-02 20:54:38,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 421 transitions, 894 flow [2022-11-02 20:54:38,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:38,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1309 transitions. [2022-11-02 20:54:38,633 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.958974358974359 [2022-11-02 20:54:38,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1309 transitions. [2022-11-02 20:54:38,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1309 transitions. [2022-11-02 20:54:38,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:38,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1309 transitions. [2022-11-02 20:54:38,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 436.3333333333333) internal successors, (1309), 3 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:38,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:38,692 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:38,694 INFO L175 Difference]: Start difference. First operand has 414 places, 429 transitions, 876 flow. Second operand 3 states and 1309 transitions. [2022-11-02 20:54:38,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 421 transitions, 894 flow [2022-11-02 20:54:38,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 421 transitions, 882 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:54:38,720 INFO L231 Difference]: Finished difference. Result has 409 places, 420 transitions, 850 flow [2022-11-02 20:54:38,723 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=850, PETRI_PLACES=409, PETRI_TRANSITIONS=420} [2022-11-02 20:54:38,727 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -5 predicate places. [2022-11-02 20:54:38,728 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 420 transitions, 850 flow [2022-11-02 20:54:38,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:38,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:38,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:38,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:54:38,731 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:38,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:38,732 INFO L85 PathProgramCache]: Analyzing trace with hash 353556960, now seen corresponding path program 1 times [2022-11-02 20:54:38,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:38,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359583267] [2022-11-02 20:54:38,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:38,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:38,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:38,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359583267] [2022-11-02 20:54:38,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359583267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:38,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:38,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:38,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011344244] [2022-11-02 20:54:38,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:38,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:38,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:38,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:38,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:38,864 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 455 [2022-11-02 20:54:38,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 420 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:38,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:38,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 455 [2022-11-02 20:54:38,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:39,159 INFO L130 PetriNetUnfolder]: 56/980 cut-off events. [2022-11-02 20:54:39,159 INFO L131 PetriNetUnfolder]: For 14/16 co-relation queries the response was YES. [2022-11-02 20:54:39,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 980 events. 56/980 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5038 event pairs, 21 based on Foata normal form. 0/834 useless extension candidates. Maximal degree in co-relation 1018. Up to 63 conditions per place. [2022-11-02 20:54:39,184 INFO L137 encePairwiseOnDemand]: 452/455 looper letters, 15 selfloop transitions, 2 changer transitions 0/419 dead transitions. [2022-11-02 20:54:39,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 419 transitions, 882 flow [2022-11-02 20:54:39,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1302 transitions. [2022-11-02 20:54:39,188 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9538461538461539 [2022-11-02 20:54:39,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1302 transitions. [2022-11-02 20:54:39,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1302 transitions. [2022-11-02 20:54:39,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:39,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1302 transitions. [2022-11-02 20:54:39,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 434.0) internal successors, (1302), 3 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:39,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:39,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:39,198 INFO L175 Difference]: Start difference. First operand has 409 places, 420 transitions, 850 flow. Second operand 3 states and 1302 transitions. [2022-11-02 20:54:39,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 419 transitions, 882 flow [2022-11-02 20:54:39,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 419 transitions, 878 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:39,228 INFO L231 Difference]: Finished difference. Result has 407 places, 419 transitions, 848 flow [2022-11-02 20:54:39,229 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=407, PETRI_TRANSITIONS=419} [2022-11-02 20:54:39,230 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -7 predicate places. [2022-11-02 20:54:39,230 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 419 transitions, 848 flow [2022-11-02 20:54:39,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:39,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:39,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:39,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:54:39,233 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:39,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:39,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1126421536, now seen corresponding path program 1 times [2022-11-02 20:54:39,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:39,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914849386] [2022-11-02 20:54:39,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:39,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:39,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:39,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:39,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914849386] [2022-11-02 20:54:39,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914849386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:39,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:39,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:39,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885809417] [2022-11-02 20:54:39,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:39,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:39,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:39,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:39,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:39,345 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 455 [2022-11-02 20:54:39,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 419 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:39,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:39,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 455 [2022-11-02 20:54:39,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:39,693 INFO L130 PetriNetUnfolder]: 68/1063 cut-off events. [2022-11-02 20:54:39,693 INFO L131 PetriNetUnfolder]: For 26/32 co-relation queries the response was YES. [2022-11-02 20:54:39,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 1063 events. 68/1063 cut-off events. For 26/32 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5815 event pairs, 39 based on Foata normal form. 0/921 useless extension candidates. Maximal degree in co-relation 1118. Up to 90 conditions per place. [2022-11-02 20:54:39,722 INFO L137 encePairwiseOnDemand]: 452/455 looper letters, 15 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2022-11-02 20:54:39,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 418 transitions, 880 flow [2022-11-02 20:54:39,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:39,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:39,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1302 transitions. [2022-11-02 20:54:39,727 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9538461538461539 [2022-11-02 20:54:39,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1302 transitions. [2022-11-02 20:54:39,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1302 transitions. [2022-11-02 20:54:39,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:39,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1302 transitions. [2022-11-02 20:54:39,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 434.0) internal successors, (1302), 3 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:39,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:39,738 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:39,738 INFO L175 Difference]: Start difference. First operand has 407 places, 419 transitions, 848 flow. Second operand 3 states and 1302 transitions. [2022-11-02 20:54:39,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 418 transitions, 880 flow [2022-11-02 20:54:39,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 418 transitions, 876 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:39,746 INFO L231 Difference]: Finished difference. Result has 406 places, 418 transitions, 846 flow [2022-11-02 20:54:39,747 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=846, PETRI_PLACES=406, PETRI_TRANSITIONS=418} [2022-11-02 20:54:39,750 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -8 predicate places. [2022-11-02 20:54:39,750 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 418 transitions, 846 flow [2022-11-02 20:54:39,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:39,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:39,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:39,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:54:39,751 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:39,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:39,752 INFO L85 PathProgramCache]: Analyzing trace with hash -52043328, now seen corresponding path program 1 times [2022-11-02 20:54:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:39,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388464032] [2022-11-02 20:54:39,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:39,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:39,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388464032] [2022-11-02 20:54:39,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388464032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:39,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:39,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:39,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163644802] [2022-11-02 20:54:39,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:39,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:39,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:39,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:39,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:39,858 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 455 [2022-11-02 20:54:39,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 418 transitions, 846 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:39,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:39,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 455 [2022-11-02 20:54:39,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:40,201 INFO L130 PetriNetUnfolder]: 117/1326 cut-off events. [2022-11-02 20:54:40,201 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-02 20:54:40,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1438 conditions, 1326 events. 117/1326 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 9043 event pairs, 39 based on Foata normal form. 0/1066 useless extension candidates. Maximal degree in co-relation 1384. Up to 85 conditions per place. [2022-11-02 20:54:40,231 INFO L137 encePairwiseOnDemand]: 452/455 looper letters, 15 selfloop transitions, 2 changer transitions 0/417 dead transitions. [2022-11-02 20:54:40,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 417 transitions, 878 flow [2022-11-02 20:54:40,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1302 transitions. [2022-11-02 20:54:40,235 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9538461538461539 [2022-11-02 20:54:40,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1302 transitions. [2022-11-02 20:54:40,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1302 transitions. [2022-11-02 20:54:40,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:40,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1302 transitions. [2022-11-02 20:54:40,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 434.0) internal successors, (1302), 3 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:40,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:40,248 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:40,249 INFO L175 Difference]: Start difference. First operand has 406 places, 418 transitions, 846 flow. Second operand 3 states and 1302 transitions. [2022-11-02 20:54:40,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 417 transitions, 878 flow [2022-11-02 20:54:40,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 417 transitions, 874 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:40,257 INFO L231 Difference]: Finished difference. Result has 405 places, 417 transitions, 844 flow [2022-11-02 20:54:40,258 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=844, PETRI_PLACES=405, PETRI_TRANSITIONS=417} [2022-11-02 20:54:40,265 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -9 predicate places. [2022-11-02 20:54:40,265 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 417 transitions, 844 flow [2022-11-02 20:54:40,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:40,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:40,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:40,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:54:40,267 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:40,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:40,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1371392609, now seen corresponding path program 1 times [2022-11-02 20:54:40,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:40,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668504661] [2022-11-02 20:54:40,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:40,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:40,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:40,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668504661] [2022-11-02 20:54:40,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668504661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:40,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:40,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:40,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459421216] [2022-11-02 20:54:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:40,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:40,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:40,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:40,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:40,335 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 455 [2022-11-02 20:54:40,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 417 transitions, 844 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:40,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:40,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 455 [2022-11-02 20:54:40,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:40,652 INFO L130 PetriNetUnfolder]: 114/1312 cut-off events. [2022-11-02 20:54:40,652 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-02 20:54:40,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1424 conditions, 1312 events. 114/1312 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8328 event pairs, 36 based on Foata normal form. 0/1060 useless extension candidates. Maximal degree in co-relation 1364. Up to 91 conditions per place. [2022-11-02 20:54:40,685 INFO L137 encePairwiseOnDemand]: 452/455 looper letters, 18 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2022-11-02 20:54:40,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 416 transitions, 882 flow [2022-11-02 20:54:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1296 transitions. [2022-11-02 20:54:40,689 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9494505494505494 [2022-11-02 20:54:40,689 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1296 transitions. [2022-11-02 20:54:40,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1296 transitions. [2022-11-02 20:54:40,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:40,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1296 transitions. [2022-11-02 20:54:40,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:40,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:40,698 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:40,699 INFO L175 Difference]: Start difference. First operand has 405 places, 417 transitions, 844 flow. Second operand 3 states and 1296 transitions. [2022-11-02 20:54:40,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 416 transitions, 882 flow [2022-11-02 20:54:40,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 416 transitions, 878 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:40,707 INFO L231 Difference]: Finished difference. Result has 404 places, 416 transitions, 842 flow [2022-11-02 20:54:40,708 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=842, PETRI_PLACES=404, PETRI_TRANSITIONS=416} [2022-11-02 20:54:40,709 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -10 predicate places. [2022-11-02 20:54:40,709 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 416 transitions, 842 flow [2022-11-02 20:54:40,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:40,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:40,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:40,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:54:40,711 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:40,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:40,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1965690935, now seen corresponding path program 1 times [2022-11-02 20:54:40,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:40,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323819881] [2022-11-02 20:54:40,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:40,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:40,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:40,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323819881] [2022-11-02 20:54:40,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323819881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:40,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:40,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:40,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651051616] [2022-11-02 20:54:40,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:40,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:40,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:40,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:40,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:40,759 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 455 [2022-11-02 20:54:40,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 416 transitions, 842 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:40,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:40,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 455 [2022-11-02 20:54:40,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:41,309 INFO L130 PetriNetUnfolder]: 258/2011 cut-off events. [2022-11-02 20:54:41,310 INFO L131 PetriNetUnfolder]: For 57/65 co-relation queries the response was YES. [2022-11-02 20:54:41,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 2011 events. 258/2011 cut-off events. For 57/65 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 15742 event pairs, 132 based on Foata normal form. 0/1620 useless extension candidates. Maximal degree in co-relation 2210. Up to 250 conditions per place. [2022-11-02 20:54:41,345 INFO L137 encePairwiseOnDemand]: 452/455 looper letters, 21 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2022-11-02 20:54:41,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 415 transitions, 886 flow [2022-11-02 20:54:41,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1290 transitions. [2022-11-02 20:54:41,349 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.945054945054945 [2022-11-02 20:54:41,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1290 transitions. [2022-11-02 20:54:41,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1290 transitions. [2022-11-02 20:54:41,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:41,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1290 transitions. [2022-11-02 20:54:41,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 430.0) internal successors, (1290), 3 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:41,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:41,358 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:41,358 INFO L175 Difference]: Start difference. First operand has 404 places, 416 transitions, 842 flow. Second operand 3 states and 1290 transitions. [2022-11-02 20:54:41,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 415 transitions, 886 flow [2022-11-02 20:54:41,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 415 transitions, 882 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:41,367 INFO L231 Difference]: Finished difference. Result has 403 places, 415 transitions, 840 flow [2022-11-02 20:54:41,368 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=403, PETRI_TRANSITIONS=415} [2022-11-02 20:54:41,371 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -11 predicate places. [2022-11-02 20:54:41,371 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 415 transitions, 840 flow [2022-11-02 20:54:41,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:41,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:41,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:41,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:54:41,373 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:41,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:41,374 INFO L85 PathProgramCache]: Analyzing trace with hash 931267577, now seen corresponding path program 1 times [2022-11-02 20:54:41,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:41,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035479728] [2022-11-02 20:54:41,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:41,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:41,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:41,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035479728] [2022-11-02 20:54:41,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035479728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:41,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:41,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:41,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237362645] [2022-11-02 20:54:41,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:41,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:41,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:41,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:41,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:41,450 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 455 [2022-11-02 20:54:41,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 415 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:41,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:41,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 455 [2022-11-02 20:54:41,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:41,820 INFO L130 PetriNetUnfolder]: 128/1715 cut-off events. [2022-11-02 20:54:41,821 INFO L131 PetriNetUnfolder]: For 11/22 co-relation queries the response was YES. [2022-11-02 20:54:41,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 1715 events. 128/1715 cut-off events. For 11/22 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 13450 event pairs, 39 based on Foata normal form. 0/1422 useless extension candidates. Maximal degree in co-relation 1760. Up to 90 conditions per place. [2022-11-02 20:54:41,850 INFO L137 encePairwiseOnDemand]: 452/455 looper letters, 15 selfloop transitions, 2 changer transitions 0/414 dead transitions. [2022-11-02 20:54:41,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 414 transitions, 872 flow [2022-11-02 20:54:41,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1302 transitions. [2022-11-02 20:54:41,854 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9538461538461539 [2022-11-02 20:54:41,854 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1302 transitions. [2022-11-02 20:54:41,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1302 transitions. [2022-11-02 20:54:41,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:41,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1302 transitions. [2022-11-02 20:54:41,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 434.0) internal successors, (1302), 3 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:41,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:41,862 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:41,862 INFO L175 Difference]: Start difference. First operand has 403 places, 415 transitions, 840 flow. Second operand 3 states and 1302 transitions. [2022-11-02 20:54:41,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 414 transitions, 872 flow [2022-11-02 20:54:41,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 414 transitions, 868 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:41,870 INFO L231 Difference]: Finished difference. Result has 402 places, 414 transitions, 838 flow [2022-11-02 20:54:41,871 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=402, PETRI_TRANSITIONS=414} [2022-11-02 20:54:41,871 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -12 predicate places. [2022-11-02 20:54:41,872 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 414 transitions, 838 flow [2022-11-02 20:54:41,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:41,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:41,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:41,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:54:41,873 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:41,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:41,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2094650414, now seen corresponding path program 1 times [2022-11-02 20:54:41,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:41,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587708546] [2022-11-02 20:54:41,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:41,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:41,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:41,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587708546] [2022-11-02 20:54:41,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587708546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:41,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:41,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:41,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411320345] [2022-11-02 20:54:41,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:41,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:41,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:41,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:41,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:41,917 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 455 [2022-11-02 20:54:41,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 414 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:41,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:41,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 455 [2022-11-02 20:54:41,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:42,241 INFO L130 PetriNetUnfolder]: 110/1421 cut-off events. [2022-11-02 20:54:42,242 INFO L131 PetriNetUnfolder]: For 14/17 co-relation queries the response was YES. [2022-11-02 20:54:42,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 1421 events. 110/1421 cut-off events. For 14/17 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 9860 event pairs, 36 based on Foata normal form. 0/1179 useless extension candidates. Maximal degree in co-relation 1460. Up to 96 conditions per place. [2022-11-02 20:54:42,271 INFO L137 encePairwiseOnDemand]: 452/455 looper letters, 18 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2022-11-02 20:54:42,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 413 transitions, 876 flow [2022-11-02 20:54:42,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1296 transitions. [2022-11-02 20:54:42,275 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9494505494505494 [2022-11-02 20:54:42,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1296 transitions. [2022-11-02 20:54:42,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1296 transitions. [2022-11-02 20:54:42,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:42,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1296 transitions. [2022-11-02 20:54:42,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:42,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:42,283 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:42,283 INFO L175 Difference]: Start difference. First operand has 402 places, 414 transitions, 838 flow. Second operand 3 states and 1296 transitions. [2022-11-02 20:54:42,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 413 transitions, 876 flow [2022-11-02 20:54:42,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 413 transitions, 872 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:42,291 INFO L231 Difference]: Finished difference. Result has 401 places, 413 transitions, 836 flow [2022-11-02 20:54:42,292 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=401, PETRI_TRANSITIONS=413} [2022-11-02 20:54:42,293 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -13 predicate places. [2022-11-02 20:54:42,293 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 413 transitions, 836 flow [2022-11-02 20:54:42,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:42,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:42,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:42,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:54:42,294 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:42,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:42,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1437940045, now seen corresponding path program 1 times [2022-11-02 20:54:42,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:42,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247345692] [2022-11-02 20:54:42,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:42,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:42,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:42,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247345692] [2022-11-02 20:54:42,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247345692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:42,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:42,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417063142] [2022-11-02 20:54:42,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:42,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:42,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:42,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:42,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:42,339 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 455 [2022-11-02 20:54:42,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 413 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:42,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:42,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 455 [2022-11-02 20:54:42,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:42,809 INFO L130 PetriNetUnfolder]: 218/1852 cut-off events. [2022-11-02 20:54:42,809 INFO L131 PetriNetUnfolder]: For 65/73 co-relation queries the response was YES. [2022-11-02 20:54:42,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2125 conditions, 1852 events. 218/1852 cut-off events. For 65/73 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 14382 event pairs, 132 based on Foata normal form. 0/1562 useless extension candidates. Maximal degree in co-relation 2041. Up to 258 conditions per place. [2022-11-02 20:54:42,848 INFO L137 encePairwiseOnDemand]: 452/455 looper letters, 21 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2022-11-02 20:54:42,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 412 transitions, 880 flow [2022-11-02 20:54:42,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:42,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1290 transitions. [2022-11-02 20:54:42,852 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.945054945054945 [2022-11-02 20:54:42,852 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1290 transitions. [2022-11-02 20:54:42,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1290 transitions. [2022-11-02 20:54:42,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:42,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1290 transitions. [2022-11-02 20:54:42,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 430.0) internal successors, (1290), 3 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:42,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:42,861 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:42,861 INFO L175 Difference]: Start difference. First operand has 401 places, 413 transitions, 836 flow. Second operand 3 states and 1290 transitions. [2022-11-02 20:54:42,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 412 transitions, 880 flow [2022-11-02 20:54:42,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 412 transitions, 876 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:42,871 INFO L231 Difference]: Finished difference. Result has 400 places, 412 transitions, 834 flow [2022-11-02 20:54:42,872 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=400, PETRI_TRANSITIONS=412} [2022-11-02 20:54:42,873 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -14 predicate places. [2022-11-02 20:54:42,873 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 412 transitions, 834 flow [2022-11-02 20:54:42,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 423.3333333333333) internal successors, (1270), 3 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:42,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:42,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:42,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:54:42,875 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:42,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:42,876 INFO L85 PathProgramCache]: Analyzing trace with hash -387084982, now seen corresponding path program 1 times [2022-11-02 20:54:42,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:42,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95848946] [2022-11-02 20:54:42,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:42,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:42,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:42,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95848946] [2022-11-02 20:54:42,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95848946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:42,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:42,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:42,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767363403] [2022-11-02 20:54:42,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:42,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:42,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:42,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:42,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:42,928 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 455 [2022-11-02 20:54:42,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 412 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:42,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:42,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 455 [2022-11-02 20:54:42,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:43,196 INFO L130 PetriNetUnfolder]: 86/1118 cut-off events. [2022-11-02 20:54:43,196 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-02 20:54:43,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 1118 events. 86/1118 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6969 event pairs, 6 based on Foata normal form. 0/924 useless extension candidates. Maximal degree in co-relation 1093. Up to 43 conditions per place. [2022-11-02 20:54:43,223 INFO L137 encePairwiseOnDemand]: 451/455 looper letters, 14 selfloop transitions, 2 changer transitions 0/414 dead transitions. [2022-11-02 20:54:43,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 414 transitions, 872 flow [2022-11-02 20:54:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:43,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1311 transitions. [2022-11-02 20:54:43,227 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9604395604395605 [2022-11-02 20:54:43,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1311 transitions. [2022-11-02 20:54:43,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1311 transitions. [2022-11-02 20:54:43,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:43,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1311 transitions. [2022-11-02 20:54:43,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 437.0) internal successors, (1311), 3 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:43,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:43,236 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:43,237 INFO L175 Difference]: Start difference. First operand has 400 places, 412 transitions, 834 flow. Second operand 3 states and 1311 transitions. [2022-11-02 20:54:43,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 414 transitions, 872 flow [2022-11-02 20:54:43,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 414 transitions, 868 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:43,247 INFO L231 Difference]: Finished difference. Result has 399 places, 412 transitions, 840 flow [2022-11-02 20:54:43,248 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=399, PETRI_TRANSITIONS=412} [2022-11-02 20:54:43,249 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -15 predicate places. [2022-11-02 20:54:43,249 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 412 transitions, 840 flow [2022-11-02 20:54:43,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:43,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:43,251 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:43,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:54:43,251 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:43,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash 339533715, now seen corresponding path program 1 times [2022-11-02 20:54:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:43,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003413548] [2022-11-02 20:54:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:43,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:43,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003413548] [2022-11-02 20:54:43,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003413548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:43,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:43,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:43,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560828815] [2022-11-02 20:54:43,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:43,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:43,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:43,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:43,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:43,308 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 455 [2022-11-02 20:54:43,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 412 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 429.6666666666667) internal successors, (1289), 3 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:43,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:43,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 455 [2022-11-02 20:54:43,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:43,617 INFO L130 PetriNetUnfolder]: 93/1190 cut-off events. [2022-11-02 20:54:43,617 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-02 20:54:43,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 1190 events. 93/1190 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 7211 event pairs, 8 based on Foata normal form. 0/989 useless extension candidates. Maximal degree in co-relation 1076. Up to 49 conditions per place. [2022-11-02 20:54:43,640 INFO L137 encePairwiseOnDemand]: 449/455 looper letters, 16 selfloop transitions, 3 changer transitions 0/414 dead transitions. [2022-11-02 20:54:43,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 414 transitions, 884 flow [2022-11-02 20:54:43,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:43,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:43,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1306 transitions. [2022-11-02 20:54:43,644 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9567765567765568 [2022-11-02 20:54:43,644 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1306 transitions. [2022-11-02 20:54:43,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1306 transitions. [2022-11-02 20:54:43,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:43,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1306 transitions. [2022-11-02 20:54:43,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 435.3333333333333) internal successors, (1306), 3 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:43,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:43,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:43,651 INFO L175 Difference]: Start difference. First operand has 399 places, 412 transitions, 840 flow. Second operand 3 states and 1306 transitions. [2022-11-02 20:54:43,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 414 transitions, 884 flow [2022-11-02 20:54:43,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 414 transitions, 884 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:54:43,659 INFO L231 Difference]: Finished difference. Result has 399 places, 412 transitions, 855 flow [2022-11-02 20:54:43,660 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=855, PETRI_PLACES=399, PETRI_TRANSITIONS=412} [2022-11-02 20:54:43,660 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -15 predicate places. [2022-11-02 20:54:43,660 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 412 transitions, 855 flow [2022-11-02 20:54:43,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.6666666666667) internal successors, (1289), 3 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:43,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:43,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:43,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:54:43,662 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:43,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:43,662 INFO L85 PathProgramCache]: Analyzing trace with hash 431587444, now seen corresponding path program 1 times [2022-11-02 20:54:43,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:43,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469347933] [2022-11-02 20:54:43,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:43,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:43,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:43,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:43,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469347933] [2022-11-02 20:54:43,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469347933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:43,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:43,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:43,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185469991] [2022-11-02 20:54:43,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:43,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:43,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:43,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:43,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:43,704 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 455 [2022-11-02 20:54:43,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 412 transitions, 855 flow. Second operand has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:43,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:43,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 455 [2022-11-02 20:54:43,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:44,008 INFO L130 PetriNetUnfolder]: 92/1449 cut-off events. [2022-11-02 20:54:44,008 INFO L131 PetriNetUnfolder]: For 11/16 co-relation queries the response was YES. [2022-11-02 20:54:44,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 1449 events. 92/1449 cut-off events. For 11/16 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10538 event pairs, 4 based on Foata normal form. 1/1237 useless extension candidates. Maximal degree in co-relation 1264. Up to 53 conditions per place. [2022-11-02 20:54:44,043 INFO L137 encePairwiseOnDemand]: 451/455 looper letters, 17 selfloop transitions, 2 changer transitions 0/417 dead transitions. [2022-11-02 20:54:44,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 417 transitions, 908 flow [2022-11-02 20:54:44,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:44,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1314 transitions. [2022-11-02 20:54:44,047 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9626373626373627 [2022-11-02 20:54:44,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1314 transitions. [2022-11-02 20:54:44,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1314 transitions. [2022-11-02 20:54:44,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:44,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1314 transitions. [2022-11-02 20:54:44,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 438.0) internal successors, (1314), 3 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:44,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:44,055 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:44,055 INFO L175 Difference]: Start difference. First operand has 399 places, 412 transitions, 855 flow. Second operand 3 states and 1314 transitions. [2022-11-02 20:54:44,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 417 transitions, 908 flow [2022-11-02 20:54:44,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 417 transitions, 908 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:54:44,064 INFO L231 Difference]: Finished difference. Result has 400 places, 412 transitions, 865 flow [2022-11-02 20:54:44,065 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=865, PETRI_PLACES=400, PETRI_TRANSITIONS=412} [2022-11-02 20:54:44,067 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -14 predicate places. [2022-11-02 20:54:44,067 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 412 transitions, 865 flow [2022-11-02 20:54:44,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:44,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:44,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:44,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:54:44,069 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:44,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1709476417, now seen corresponding path program 1 times [2022-11-02 20:54:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:44,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120825827] [2022-11-02 20:54:44,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:44,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:44,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:44,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120825827] [2022-11-02 20:54:44,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120825827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:44,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:44,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:44,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264683588] [2022-11-02 20:54:44,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:44,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:44,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:44,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:44,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:44,128 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 455 [2022-11-02 20:54:44,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 412 transitions, 865 flow. Second operand has 3 states, 3 states have (on average 429.6666666666667) internal successors, (1289), 3 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:44,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:44,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 455 [2022-11-02 20:54:44,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:44,554 INFO L130 PetriNetUnfolder]: 101/1685 cut-off events. [2022-11-02 20:54:44,554 INFO L131 PetriNetUnfolder]: For 23/26 co-relation queries the response was YES. [2022-11-02 20:54:44,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1804 conditions, 1685 events. 101/1685 cut-off events. For 23/26 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 11784 event pairs, 8 based on Foata normal form. 1/1447 useless extension candidates. Maximal degree in co-relation 1597. Up to 69 conditions per place. [2022-11-02 20:54:44,590 INFO L137 encePairwiseOnDemand]: 449/455 looper letters, 19 selfloop transitions, 3 changer transitions 0/417 dead transitions. [2022-11-02 20:54:44,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 417 transitions, 924 flow [2022-11-02 20:54:44,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1309 transitions. [2022-11-02 20:54:44,595 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.958974358974359 [2022-11-02 20:54:44,596 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1309 transitions. [2022-11-02 20:54:44,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1309 transitions. [2022-11-02 20:54:44,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:44,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1309 transitions. [2022-11-02 20:54:44,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 436.3333333333333) internal successors, (1309), 3 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:44,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:44,603 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:44,603 INFO L175 Difference]: Start difference. First operand has 400 places, 412 transitions, 865 flow. Second operand 3 states and 1309 transitions. [2022-11-02 20:54:44,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 417 transitions, 924 flow [2022-11-02 20:54:44,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 417 transitions, 924 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:54:44,613 INFO L231 Difference]: Finished difference. Result has 400 places, 412 transitions, 880 flow [2022-11-02 20:54:44,613 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=400, PETRI_TRANSITIONS=412} [2022-11-02 20:54:44,614 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -14 predicate places. [2022-11-02 20:54:44,615 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 412 transitions, 880 flow [2022-11-02 20:54:44,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.6666666666667) internal successors, (1289), 3 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:44,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:44,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:44,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:54:44,616 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:44,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:44,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1545358935, now seen corresponding path program 1 times [2022-11-02 20:54:44,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:44,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842591136] [2022-11-02 20:54:44,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:44,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:44,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:44,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842591136] [2022-11-02 20:54:44,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842591136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:44,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:44,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:44,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481209846] [2022-11-02 20:54:44,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:44,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:44,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:44,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:44,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:44,671 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 455 [2022-11-02 20:54:44,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 412 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 427.0) internal successors, (1281), 3 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:44,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:44,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 455 [2022-11-02 20:54:44,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:45,661 INFO L130 PetriNetUnfolder]: 463/5646 cut-off events. [2022-11-02 20:54:45,662 INFO L131 PetriNetUnfolder]: For 69/81 co-relation queries the response was YES. [2022-11-02 20:54:45,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6128 conditions, 5646 events. 463/5646 cut-off events. For 69/81 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 62418 event pairs, 60 based on Foata normal form. 0/4813 useless extension candidates. Maximal degree in co-relation 5183. Up to 323 conditions per place. [2022-11-02 20:54:45,745 INFO L137 encePairwiseOnDemand]: 447/455 looper letters, 18 selfloop transitions, 4 changer transitions 0/414 dead transitions. [2022-11-02 20:54:45,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 414 transitions, 930 flow [2022-11-02 20:54:45,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1301 transitions. [2022-11-02 20:54:45,748 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9531135531135531 [2022-11-02 20:54:45,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1301 transitions. [2022-11-02 20:54:45,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1301 transitions. [2022-11-02 20:54:45,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:45,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1301 transitions. [2022-11-02 20:54:45,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.6666666666667) internal successors, (1301), 3 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:45,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:45,757 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:45,757 INFO L175 Difference]: Start difference. First operand has 400 places, 412 transitions, 880 flow. Second operand 3 states and 1301 transitions. [2022-11-02 20:54:45,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 414 transitions, 930 flow [2022-11-02 20:54:45,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 414 transitions, 930 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:54:45,765 INFO L231 Difference]: Finished difference. Result has 399 places, 412 transitions, 900 flow [2022-11-02 20:54:45,766 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=399, PETRI_TRANSITIONS=412} [2022-11-02 20:54:45,767 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -15 predicate places. [2022-11-02 20:54:45,767 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 412 transitions, 900 flow [2022-11-02 20:54:45,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.0) internal successors, (1281), 3 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:45,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:45,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:45,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:54:45,768 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:45,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:45,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1922796315, now seen corresponding path program 1 times [2022-11-02 20:54:45,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:45,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912225097] [2022-11-02 20:54:45,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:45,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:45,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:45,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912225097] [2022-11-02 20:54:45,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912225097] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:45,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:45,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:45,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133622486] [2022-11-02 20:54:45,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:45,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:45,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:45,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:45,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:45,823 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 432 out of 455 [2022-11-02 20:54:45,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 412 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 433.3333333333333) internal successors, (1300), 3 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:45,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:45,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 432 of 455 [2022-11-02 20:54:45,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:46,421 INFO L130 PetriNetUnfolder]: 186/2912 cut-off events. [2022-11-02 20:54:46,421 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-02 20:54:46,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3165 conditions, 2912 events. 186/2912 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 27670 event pairs, 8 based on Foata normal form. 0/2500 useless extension candidates. Maximal degree in co-relation 2750. Up to 66 conditions per place. [2022-11-02 20:54:46,474 INFO L137 encePairwiseOnDemand]: 452/455 looper letters, 13 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2022-11-02 20:54:46,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 413 transitions, 934 flow [2022-11-02 20:54:46,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:46,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1312 transitions. [2022-11-02 20:54:46,478 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9611721611721612 [2022-11-02 20:54:46,478 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1312 transitions. [2022-11-02 20:54:46,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1312 transitions. [2022-11-02 20:54:46,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:46,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1312 transitions. [2022-11-02 20:54:46,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 437.3333333333333) internal successors, (1312), 3 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:46,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:46,486 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:46,486 INFO L175 Difference]: Start difference. First operand has 399 places, 412 transitions, 900 flow. Second operand 3 states and 1312 transitions. [2022-11-02 20:54:46,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 413 transitions, 934 flow [2022-11-02 20:54:46,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 413 transitions, 934 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:54:46,497 INFO L231 Difference]: Finished difference. Result has 400 places, 411 transitions, 902 flow [2022-11-02 20:54:46,498 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=902, PETRI_PLACES=400, PETRI_TRANSITIONS=411} [2022-11-02 20:54:46,499 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -14 predicate places. [2022-11-02 20:54:46,499 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 411 transitions, 902 flow [2022-11-02 20:54:46,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.3333333333333) internal successors, (1300), 3 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:46,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:46,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:46,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:54:46,501 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:46,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:46,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1554019358, now seen corresponding path program 1 times [2022-11-02 20:54:46,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:46,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976683284] [2022-11-02 20:54:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:46,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:46,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976683284] [2022-11-02 20:54:46,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976683284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:46,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:46,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:46,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801452449] [2022-11-02 20:54:46,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:46,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:46,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:46,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:46,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:46,569 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 455 [2022-11-02 20:54:46,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 411 transitions, 902 flow. Second operand has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:46,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:46,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 455 [2022-11-02 20:54:46,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:47,308 INFO L130 PetriNetUnfolder]: 149/2889 cut-off events. [2022-11-02 20:54:47,308 INFO L131 PetriNetUnfolder]: For 27/35 co-relation queries the response was YES. [2022-11-02 20:54:47,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3127 conditions, 2889 events. 149/2889 cut-off events. For 27/35 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 25976 event pairs, 4 based on Foata normal form. 2/2524 useless extension candidates. Maximal degree in co-relation 2663. Up to 68 conditions per place. [2022-11-02 20:54:47,389 INFO L137 encePairwiseOnDemand]: 451/455 looper letters, 17 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2022-11-02 20:54:47,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 416 transitions, 955 flow [2022-11-02 20:54:47,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1314 transitions. [2022-11-02 20:54:47,393 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9626373626373627 [2022-11-02 20:54:47,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1314 transitions. [2022-11-02 20:54:47,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1314 transitions. [2022-11-02 20:54:47,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:47,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1314 transitions. [2022-11-02 20:54:47,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 438.0) internal successors, (1314), 3 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:47,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:47,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:47,404 INFO L175 Difference]: Start difference. First operand has 400 places, 411 transitions, 902 flow. Second operand 3 states and 1314 transitions. [2022-11-02 20:54:47,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 416 transitions, 955 flow [2022-11-02 20:54:47,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 416 transitions, 951 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:47,416 INFO L231 Difference]: Finished difference. Result has 399 places, 411 transitions, 908 flow [2022-11-02 20:54:47,416 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=399, PETRI_TRANSITIONS=411} [2022-11-02 20:54:47,417 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -15 predicate places. [2022-11-02 20:54:47,417 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 411 transitions, 908 flow [2022-11-02 20:54:47,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:47,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:47,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:47,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:54:47,419 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:47,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:47,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1236051141, now seen corresponding path program 1 times [2022-11-02 20:54:47,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:47,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635309252] [2022-11-02 20:54:47,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:47,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:47,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:47,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635309252] [2022-11-02 20:54:47,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635309252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:47,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:47,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:47,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115822061] [2022-11-02 20:54:47,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:47,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:47,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:47,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:47,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:47,486 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 455 [2022-11-02 20:54:47,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 411 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:47,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:47,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 455 [2022-11-02 20:54:47,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:48,095 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][382], [Black: 477#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), 79#L56-32true, 484#(= |#race~is_null_3~0| 0), Black: 487#true, 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, Black: 492#true, 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 506#true]) [2022-11-02 20:54:48,095 INFO L383 tUnfolder$Statistics]: this new event has 216 ancestors and is cut-off event [2022-11-02 20:54:48,095 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-02 20:54:48,095 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-02 20:54:48,095 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-02 20:54:48,096 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][382], [Black: 477#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), 484#(= |#race~is_null_3~0| 0), Black: 487#true, 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, Black: 492#true, 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 506#true, 333#L56-33true]) [2022-11-02 20:54:48,096 INFO L383 tUnfolder$Statistics]: this new event has 217 ancestors and is cut-off event [2022-11-02 20:54:48,096 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-02 20:54:48,096 INFO L386 tUnfolder$Statistics]: existing Event has 217 ancestors and is cut-off event [2022-11-02 20:54:48,096 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-02 20:54:48,106 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1291] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][382], [Black: 477#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 79#L56-32true, 479#(= |#race~is_null_0~0| 0), 484#(= |#race~is_null_3~0| 0), Black: 487#true, 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, Black: 492#true, 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 506#true]) [2022-11-02 20:54:48,107 INFO L383 tUnfolder$Statistics]: this new event has 208 ancestors and is cut-off event [2022-11-02 20:54:48,107 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-02 20:54:48,107 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-02 20:54:48,107 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-02 20:54:48,107 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-02 20:54:48,136 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1291] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][382], [Black: 477#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), 484#(= |#race~is_null_3~0| 0), Black: 487#true, 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, Black: 492#true, 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 506#true, 333#L56-33true]) [2022-11-02 20:54:48,136 INFO L383 tUnfolder$Statistics]: this new event has 209 ancestors and is cut-off event [2022-11-02 20:54:48,136 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-02 20:54:48,136 INFO L386 tUnfolder$Statistics]: existing Event has 217 ancestors and is cut-off event [2022-11-02 20:54:48,136 INFO L386 tUnfolder$Statistics]: existing Event has 243 ancestors and is cut-off event [2022-11-02 20:54:48,136 INFO L386 tUnfolder$Statistics]: existing Event has 217 ancestors and is cut-off event [2022-11-02 20:54:48,179 INFO L130 PetriNetUnfolder]: 161/3821 cut-off events. [2022-11-02 20:54:48,179 INFO L131 PetriNetUnfolder]: For 63/83 co-relation queries the response was YES. [2022-11-02 20:54:48,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4123 conditions, 3821 events. 161/3821 cut-off events. For 63/83 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 34941 event pairs, 12 based on Foata normal form. 0/3386 useless extension candidates. Maximal degree in co-relation 3648. Up to 140 conditions per place. [2022-11-02 20:54:48,253 INFO L137 encePairwiseOnDemand]: 451/455 looper letters, 17 selfloop transitions, 2 changer transitions 0/416 dead transitions. [2022-11-02 20:54:48,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 416 transitions, 961 flow [2022-11-02 20:54:48,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1314 transitions. [2022-11-02 20:54:48,257 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9626373626373627 [2022-11-02 20:54:48,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1314 transitions. [2022-11-02 20:54:48,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1314 transitions. [2022-11-02 20:54:48,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:48,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1314 transitions. [2022-11-02 20:54:48,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 438.0) internal successors, (1314), 3 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:48,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:48,263 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:48,263 INFO L175 Difference]: Start difference. First operand has 399 places, 411 transitions, 908 flow. Second operand 3 states and 1314 transitions. [2022-11-02 20:54:48,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 416 transitions, 961 flow [2022-11-02 20:54:48,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 416 transitions, 961 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:54:48,271 INFO L231 Difference]: Finished difference. Result has 400 places, 411 transitions, 918 flow [2022-11-02 20:54:48,271 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=918, PETRI_PLACES=400, PETRI_TRANSITIONS=411} [2022-11-02 20:54:48,272 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -14 predicate places. [2022-11-02 20:54:48,272 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 411 transitions, 918 flow [2022-11-02 20:54:48,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:48,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:48,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:48,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:54:48,273 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:48,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:48,273 INFO L85 PathProgramCache]: Analyzing trace with hash -479004543, now seen corresponding path program 1 times [2022-11-02 20:54:48,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:48,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333096191] [2022-11-02 20:54:48,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:48,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:48,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:48,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:48,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333096191] [2022-11-02 20:54:48,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333096191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:48,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:48,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:48,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828837684] [2022-11-02 20:54:48,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:48,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:48,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:48,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:48,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:48,315 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 455 [2022-11-02 20:54:48,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 411 transitions, 918 flow. Second operand has 3 states, 3 states have (on average 427.0) internal successors, (1281), 3 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:48,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:48,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 455 [2022-11-02 20:54:48,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:49,848 INFO L130 PetriNetUnfolder]: 558/8591 cut-off events. [2022-11-02 20:54:49,848 INFO L131 PetriNetUnfolder]: For 145/163 co-relation queries the response was YES. [2022-11-02 20:54:49,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9554 conditions, 8591 events. 558/8591 cut-off events. For 145/163 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 102204 event pairs, 80 based on Foata normal form. 1/7680 useless extension candidates. Maximal degree in co-relation 8456. Up to 616 conditions per place. [2022-11-02 20:54:49,986 INFO L137 encePairwiseOnDemand]: 447/455 looper letters, 20 selfloop transitions, 4 changer transitions 0/415 dead transitions. [2022-11-02 20:54:49,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 415 transitions, 978 flow [2022-11-02 20:54:49,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1303 transitions. [2022-11-02 20:54:49,990 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9545787545787546 [2022-11-02 20:54:49,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1303 transitions. [2022-11-02 20:54:49,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1303 transitions. [2022-11-02 20:54:49,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:49,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1303 transitions. [2022-11-02 20:54:49,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 434.3333333333333) internal successors, (1303), 3 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:49,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:49,997 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:49,997 INFO L175 Difference]: Start difference. First operand has 400 places, 411 transitions, 918 flow. Second operand 3 states and 1303 transitions. [2022-11-02 20:54:49,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 415 transitions, 978 flow [2022-11-02 20:54:50,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 415 transitions, 978 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:54:50,005 INFO L231 Difference]: Finished difference. Result has 399 places, 411 transitions, 938 flow [2022-11-02 20:54:50,006 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=938, PETRI_PLACES=399, PETRI_TRANSITIONS=411} [2022-11-02 20:54:50,006 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -15 predicate places. [2022-11-02 20:54:50,006 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 411 transitions, 938 flow [2022-11-02 20:54:50,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.0) internal successors, (1281), 3 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:50,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:50,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:50,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:54:50,008 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:50,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1412718834, now seen corresponding path program 1 times [2022-11-02 20:54:50,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:50,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139612889] [2022-11-02 20:54:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:50,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:50,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:50,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139612889] [2022-11-02 20:54:50,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139612889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:50,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:50,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:50,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764174262] [2022-11-02 20:54:50,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:50,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:50,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:50,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:50,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:50,060 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 455 [2022-11-02 20:54:50,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 411 transitions, 938 flow. Second operand has 3 states, 3 states have (on average 430.6666666666667) internal successors, (1292), 3 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:50,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:50,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 455 [2022-11-02 20:54:50,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:51,195 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][388], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 484#(= |#race~is_null_3~0| 0), 339#L80-7true, Black: 487#true, 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), Black: 492#true, 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, 518#(= 0 |#race~filename_is_null_8~0|), 521#true, Black: 506#true]) [2022-11-02 20:54:51,195 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-02 20:54:51,195 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:54:51,195 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-02 20:54:51,195 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:54:51,208 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][388], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 484#(= |#race~is_null_3~0| 0), Black: 487#true, 339#L80-7true, 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), Black: 492#true, 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, 518#(= 0 |#race~filename_is_null_8~0|), 521#true, Black: 506#true]) [2022-11-02 20:54:51,208 INFO L383 tUnfolder$Statistics]: this new event has 233 ancestors and is not cut-off event [2022-11-02 20:54:51,208 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:54:51,208 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is not cut-off event [2022-11-02 20:54:51,208 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:54:51,208 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:54:51,226 INFO L130 PetriNetUnfolder]: 328/6582 cut-off events. [2022-11-02 20:54:51,227 INFO L131 PetriNetUnfolder]: For 67/169 co-relation queries the response was YES. [2022-11-02 20:54:51,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7436 conditions, 6582 events. 328/6582 cut-off events. For 67/169 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 72699 event pairs, 34 based on Foata normal form. 7/5891 useless extension candidates. Maximal degree in co-relation 6286. Up to 190 conditions per place. [2022-11-02 20:54:51,346 INFO L137 encePairwiseOnDemand]: 452/455 looper letters, 16 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2022-11-02 20:54:51,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 412 transitions, 978 flow [2022-11-02 20:54:51,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1306 transitions. [2022-11-02 20:54:51,350 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9567765567765568 [2022-11-02 20:54:51,350 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1306 transitions. [2022-11-02 20:54:51,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1306 transitions. [2022-11-02 20:54:51,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:51,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1306 transitions. [2022-11-02 20:54:51,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 435.3333333333333) internal successors, (1306), 3 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:51,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:51,358 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:51,358 INFO L175 Difference]: Start difference. First operand has 399 places, 411 transitions, 938 flow. Second operand 3 states and 1306 transitions. [2022-11-02 20:54:51,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 412 transitions, 978 flow [2022-11-02 20:54:51,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 412 transitions, 978 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:54:51,366 INFO L231 Difference]: Finished difference. Result has 400 places, 410 transitions, 940 flow [2022-11-02 20:54:51,367 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=940, PETRI_PLACES=400, PETRI_TRANSITIONS=410} [2022-11-02 20:54:51,368 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -14 predicate places. [2022-11-02 20:54:51,368 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 410 transitions, 940 flow [2022-11-02 20:54:51,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 430.6666666666667) internal successors, (1292), 3 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:51,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:51,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:51,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:54:51,369 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:51,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:51,370 INFO L85 PathProgramCache]: Analyzing trace with hash 76075330, now seen corresponding path program 1 times [2022-11-02 20:54:51,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:51,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290494582] [2022-11-02 20:54:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:51,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:51,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:51,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290494582] [2022-11-02 20:54:51,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290494582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:51,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:51,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:54:51,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941583607] [2022-11-02 20:54:51,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:51,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:51,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:51,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:51,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:51,820 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 455 [2022-11-02 20:54:51,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 410 transitions, 940 flow. Second operand has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:51,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:51,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 455 [2022-11-02 20:54:51,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:52,823 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][385], [Black: 477#true, 511#true, Black: 482#true, Black: 516#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), 484#(= |#race~is_null_3~0| 0), Black: 487#true, 339#L80-7true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 499#(= |#race~is_null_6~0| 0), Black: 492#true, 489#(= 0 |#race~filename_is_null_2~0|), 506#true, Black: 497#true, 518#(= 0 |#race~filename_is_null_8~0|), 521#true]) [2022-11-02 20:54:52,825 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is not cut-off event [2022-11-02 20:54:52,826 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-02 20:54:52,826 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-02 20:54:52,826 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is not cut-off event [2022-11-02 20:54:52,837 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][385], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 484#(= |#race~is_null_3~0| 0), Black: 487#true, 339#L80-7true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), Black: 492#true, 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, 518#(= 0 |#race~filename_is_null_8~0|), 521#true, Black: 506#true]) [2022-11-02 20:54:52,838 INFO L383 tUnfolder$Statistics]: this new event has 233 ancestors and is cut-off event [2022-11-02 20:54:52,838 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:54:52,838 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:54:52,839 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:54:52,839 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][385], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 484#(= |#race~is_null_3~0| 0), Black: 487#true, 339#L80-7true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), Black: 492#true, 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, 518#(= 0 |#race~filename_is_null_8~0|), 521#true, Black: 506#true]) [2022-11-02 20:54:52,839 INFO L383 tUnfolder$Statistics]: this new event has 241 ancestors and is cut-off event [2022-11-02 20:54:52,839 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:54:52,840 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:54:52,840 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-02 20:54:52,840 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:54:52,840 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][385], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 484#(= |#race~is_null_3~0| 0), Black: 487#true, 339#L80-7true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), Black: 492#true, 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, 518#(= 0 |#race~filename_is_null_8~0|), 521#true, Black: 506#true]) [2022-11-02 20:54:52,841 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-02 20:54:52,841 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:54:52,841 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:54:52,841 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is cut-off event [2022-11-02 20:54:52,841 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-02 20:54:52,842 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:54:52,857 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][385], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 484#(= |#race~is_null_3~0| 0), Black: 487#true, 339#L80-7true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), Black: 492#true, 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, 518#(= 0 |#race~filename_is_null_8~0|), 521#true, Black: 506#true]) [2022-11-02 20:54:52,857 INFO L383 tUnfolder$Statistics]: this new event has 233 ancestors and is not cut-off event [2022-11-02 20:54:52,857 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:54:52,857 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:54:52,858 INFO L386 tUnfolder$Statistics]: existing Event has 233 ancestors and is not cut-off event [2022-11-02 20:54:52,858 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is not cut-off event [2022-11-02 20:54:52,858 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:54:52,858 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:54:52,878 INFO L130 PetriNetUnfolder]: 172/4050 cut-off events. [2022-11-02 20:54:52,878 INFO L131 PetriNetUnfolder]: For 5/57 co-relation queries the response was YES. [2022-11-02 20:54:52,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4530 conditions, 4050 events. 172/4050 cut-off events. For 5/57 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 39143 event pairs, 0 based on Foata normal form. 20/3632 useless extension candidates. Maximal degree in co-relation 3962. Up to 104 conditions per place. [2022-11-02 20:54:52,975 INFO L137 encePairwiseOnDemand]: 450/455 looper letters, 23 selfloop transitions, 4 changer transitions 0/409 dead transitions. [2022-11-02 20:54:52,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 409 transitions, 992 flow [2022-11-02 20:54:52,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:54:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:54:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2524 transitions. [2022-11-02 20:54:52,982 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9245421245421246 [2022-11-02 20:54:52,982 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2524 transitions. [2022-11-02 20:54:52,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2524 transitions. [2022-11-02 20:54:52,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:52,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2524 transitions. [2022-11-02 20:54:52,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 420.6666666666667) internal successors, (2524), 6 states have internal predecessors, (2524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:52,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 455.0) internal successors, (3185), 7 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:52,999 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 455.0) internal successors, (3185), 7 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:52,999 INFO L175 Difference]: Start difference. First operand has 400 places, 410 transitions, 940 flow. Second operand 6 states and 2524 transitions. [2022-11-02 20:54:52,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 409 transitions, 992 flow [2022-11-02 20:54:53,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 409 transitions, 988 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:53,011 INFO L231 Difference]: Finished difference. Result has 402 places, 409 transitions, 942 flow [2022-11-02 20:54:53,011 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=402, PETRI_TRANSITIONS=409} [2022-11-02 20:54:53,012 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -12 predicate places. [2022-11-02 20:54:53,012 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 409 transitions, 942 flow [2022-11-02 20:54:53,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:53,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:53,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:53,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:54:53,014 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:53,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:53,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1691518300, now seen corresponding path program 1 times [2022-11-02 20:54:53,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:53,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437075721] [2022-11-02 20:54:53,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:53,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:53,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:53,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437075721] [2022-11-02 20:54:53,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437075721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:53,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:53,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:53,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811190298] [2022-11-02 20:54:53,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:53,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:53,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:53,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:53,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:53,073 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 455 [2022-11-02 20:54:53,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 409 transitions, 942 flow. Second operand has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:53,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:53,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 455 [2022-11-02 20:54:53,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:54,451 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][388], [Black: 477#true, 511#true, Black: 482#true, Black: 516#true, 479#(= |#race~is_null_0~0| 0), 494#(= 0 |#race~filename_is_null_5~0|), 484#(= |#race~is_null_3~0| 0), 339#L80-7true, Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 499#(= |#race~is_null_6~0| 0), Black: 492#true, 489#(= 0 |#race~filename_is_null_2~0|), 506#true, Black: 497#true, 518#(= 0 |#race~filename_is_null_8~0|), 532#true]) [2022-11-02 20:54:54,452 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is not cut-off event [2022-11-02 20:54:54,452 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-02 20:54:54,452 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is not cut-off event [2022-11-02 20:54:54,452 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-02 20:54:54,512 INFO L130 PetriNetUnfolder]: 289/6516 cut-off events. [2022-11-02 20:54:54,512 INFO L131 PetriNetUnfolder]: For 93/104 co-relation queries the response was YES. [2022-11-02 20:54:54,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7202 conditions, 6516 events. 289/6516 cut-off events. For 93/104 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 70284 event pairs, 22 based on Foata normal form. 2/5940 useless extension candidates. Maximal degree in co-relation 6864. Up to 300 conditions per place. [2022-11-02 20:54:54,609 INFO L137 encePairwiseOnDemand]: 451/455 looper letters, 16 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2022-11-02 20:54:54,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 413 transitions, 990 flow [2022-11-02 20:54:54,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:54,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1313 transitions. [2022-11-02 20:54:54,613 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9619047619047619 [2022-11-02 20:54:54,613 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1313 transitions. [2022-11-02 20:54:54,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1313 transitions. [2022-11-02 20:54:54,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:54,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1313 transitions. [2022-11-02 20:54:54,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 437.6666666666667) internal successors, (1313), 3 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:54,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:54,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:54,621 INFO L175 Difference]: Start difference. First operand has 402 places, 409 transitions, 942 flow. Second operand 3 states and 1313 transitions. [2022-11-02 20:54:54,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 413 transitions, 990 flow [2022-11-02 20:54:54,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 413 transitions, 983 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:54:54,629 INFO L231 Difference]: Finished difference. Result has 399 places, 409 transitions, 945 flow [2022-11-02 20:54:54,629 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=945, PETRI_PLACES=399, PETRI_TRANSITIONS=409} [2022-11-02 20:54:54,630 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -15 predicate places. [2022-11-02 20:54:54,630 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 409 transitions, 945 flow [2022-11-02 20:54:54,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:54,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:54,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:54,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:54:54,632 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:54,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:54,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1132854627, now seen corresponding path program 1 times [2022-11-02 20:54:54,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:54,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301891308] [2022-11-02 20:54:54,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:54,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:54,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:54,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301891308] [2022-11-02 20:54:54,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301891308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:54,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:54,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:54:54,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983116083] [2022-11-02 20:54:54,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:54,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:54,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:54,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:54,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:54,673 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 429 out of 455 [2022-11-02 20:54:54,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 409 transitions, 945 flow. Second operand 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-02 20:54:54,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:54,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 429 of 455 [2022-11-02 20:54:54,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:55,475 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1221] L56-46-->L56-47: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet24#1][245], [Black: 477#true, 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 484#(= |#race~is_null_3~0| 0), 290#L56-47true, Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, 537#true, Black: 492#true, 489#(= 0 |#race~filename_is_null_2~0|), 506#true, Black: 497#true, 518#(= 0 |#race~filename_is_null_8~0|), 532#true]) [2022-11-02 20:54:55,475 INFO L383 tUnfolder$Statistics]: this new event has 187 ancestors and is cut-off event [2022-11-02 20:54:55,475 INFO L386 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-11-02 20:54:55,475 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-02 20:54:55,475 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-02 20:54:55,558 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1221] L56-46-->L56-47: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet24#1][245], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 484#(= |#race~is_null_3~0| 0), Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 290#L56-47true, 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, Black: 492#true, 537#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:54:55,558 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-02 20:54:55,558 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:54:55,558 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:54:55,559 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:54:55,592 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][375], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 484#(= |#race~is_null_3~0| 0), 290#L56-47true, Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, Black: 492#true, 537#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:54:55,592 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-02 20:54:55,592 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:54:55,592 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:54:55,593 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:54:55,596 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][377], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 107#L56-48true, 484#(= |#race~is_null_3~0| 0), Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, Black: 492#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 518#(= 0 |#race~filename_is_null_8~0|), 539#(= |thread3Thread1of1ForFork1_#t~nondet24#1| |#race~result_11~0|), Black: 506#true]) [2022-11-02 20:54:55,596 INFO L383 tUnfolder$Statistics]: this new event has 248 ancestors and is cut-off event [2022-11-02 20:54:55,596 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-02 20:54:55,597 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:54:55,597 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-02 20:54:55,600 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][377], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 484#(= |#race~is_null_3~0| 0), Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, Black: 492#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 518#(= 0 |#race~filename_is_null_8~0|), 539#(= |thread3Thread1of1ForFork1_#t~nondet24#1| |#race~result_11~0|), 296#L56-49true, Black: 506#true]) [2022-11-02 20:54:55,600 INFO L383 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-11-02 20:54:55,600 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-02 20:54:55,600 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:54:55,600 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-02 20:54:55,614 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1291] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][375], [Black: 477#true, Black: 511#true, 161#L58true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 484#(= |#race~is_null_3~0| 0), Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, 537#true, Black: 492#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:54:55,615 INFO L383 tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event [2022-11-02 20:54:55,615 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:54:55,615 INFO L386 tUnfolder$Statistics]: existing Event has 257 ancestors and is cut-off event [2022-11-02 20:54:55,615 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:54:55,617 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1221] L56-46-->L56-47: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet24#1][245], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 484#(= |#race~is_null_3~0| 0), 290#L56-47true, Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, 537#true, Black: 492#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:54:55,617 INFO L383 tUnfolder$Statistics]: this new event has 273 ancestors and is cut-off event [2022-11-02 20:54:55,617 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:54:55,617 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:54:55,617 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:54:55,617 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:54:55,618 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1221] L56-46-->L56-47: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet24#1][245], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 484#(= |#race~is_null_3~0| 0), 290#L56-47true, Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, 537#true, Black: 492#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:54:55,618 INFO L383 tUnfolder$Statistics]: this new event has 239 ancestors and is cut-off event [2022-11-02 20:54:55,618 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:54:55,618 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:54:55,618 INFO L386 tUnfolder$Statistics]: existing Event has 273 ancestors and is cut-off event [2022-11-02 20:54:55,619 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:54:55,619 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:54:55,619 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([1221] L56-46-->L56-47: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~nondet24#1][245], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 484#(= |#race~is_null_3~0| 0), 290#L56-47true, Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, 537#true, Black: 492#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:54:55,619 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-02 20:54:55,619 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:54:55,619 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:54:55,620 INFO L386 tUnfolder$Statistics]: existing Event has 273 ancestors and is cut-off event [2022-11-02 20:54:55,620 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:54:55,620 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is cut-off event [2022-11-02 20:54:55,620 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:54:55,634 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1291] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][375], [Black: 477#true, Black: 511#true, Black: 482#true, Black: 516#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), 484#(= |#race~is_null_3~0| 0), 290#L56-47true, Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, 537#true, Black: 492#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:54:55,634 INFO L383 tUnfolder$Statistics]: this new event has 239 ancestors and is not cut-off event [2022-11-02 20:54:55,634 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is not cut-off event [2022-11-02 20:54:55,634 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is not cut-off event [2022-11-02 20:54:55,635 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is not cut-off event [2022-11-02 20:54:55,635 INFO L386 tUnfolder$Statistics]: existing Event has 239 ancestors and is not cut-off event [2022-11-02 20:54:55,635 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1291] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][377], [Black: 477#true, Black: 511#true, Black: 482#true, Black: 516#true, 107#L56-48true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), 484#(= |#race~is_null_3~0| 0), Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, Black: 492#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 518#(= 0 |#race~filename_is_null_8~0|), 539#(= |thread3Thread1of1ForFork1_#t~nondet24#1| |#race~result_11~0|), Black: 506#true]) [2022-11-02 20:54:55,635 INFO L383 tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event [2022-11-02 20:54:55,635 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:54:55,636 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-02 20:54:55,636 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:54:55,636 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-02 20:54:55,638 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1291] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][377], [Black: 477#true, Black: 511#true, Black: 482#true, Black: 516#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), 484#(= |#race~is_null_3~0| 0), Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, Black: 492#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 518#(= 0 |#race~filename_is_null_8~0|), 539#(= |thread3Thread1of1ForFork1_#t~nondet24#1| |#race~result_11~0|), 296#L56-49true, Black: 506#true]) [2022-11-02 20:54:55,638 INFO L383 tUnfolder$Statistics]: this new event has 241 ancestors and is cut-off event [2022-11-02 20:54:55,638 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-02 20:54:55,638 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:54:55,638 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:54:55,638 INFO L386 tUnfolder$Statistics]: existing Event has 241 ancestors and is cut-off event [2022-11-02 20:54:55,650 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1291] thread2EXIT-->L79-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem50#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem50#1=|v_ULTIMATE.start_main_#t~mem50#1_5|} AuxVars[] AssignedVars[][375], [Black: 477#true, Black: 511#true, 161#L58true, Black: 482#true, Black: 516#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), 484#(= |#race~is_null_3~0| 0), Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 209#L79-7true, Black: 492#true, 537#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:54:55,650 INFO L383 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-11-02 20:54:55,650 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:54:55,650 INFO L386 tUnfolder$Statistics]: existing Event has 257 ancestors and is cut-off event [2022-11-02 20:54:55,651 INFO L386 tUnfolder$Statistics]: existing Event has 257 ancestors and is cut-off event [2022-11-02 20:54:55,651 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:54:55,657 INFO L130 PetriNetUnfolder]: 444/5417 cut-off events. [2022-11-02 20:54:55,658 INFO L131 PetriNetUnfolder]: For 280/330 co-relation queries the response was YES. [2022-11-02 20:54:55,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6768 conditions, 5417 events. 444/5417 cut-off events. For 280/330 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 59073 event pairs, 96 based on Foata normal form. 0/4935 useless extension candidates. Maximal degree in co-relation 6643. Up to 507 conditions per place. [2022-11-02 20:54:55,741 INFO L137 encePairwiseOnDemand]: 452/455 looper letters, 15 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2022-11-02 20:54:55,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 410 transitions, 983 flow [2022-11-02 20:54:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1305 transitions. [2022-11-02 20:54:55,744 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9560439560439561 [2022-11-02 20:54:55,745 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1305 transitions. [2022-11-02 20:54:55,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1305 transitions. [2022-11-02 20:54:55,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:55,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1305 transitions. [2022-11-02 20:54:55,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 435.0) internal successors, (1305), 3 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:55,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:55,752 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:55,752 INFO L175 Difference]: Start difference. First operand has 399 places, 409 transitions, 945 flow. Second operand 3 states and 1305 transitions. [2022-11-02 20:54:55,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 410 transitions, 983 flow [2022-11-02 20:54:55,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 410 transitions, 983 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:54:55,759 INFO L231 Difference]: Finished difference. Result has 400 places, 408 transitions, 947 flow [2022-11-02 20:54:55,760 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=947, PETRI_PLACES=400, PETRI_TRANSITIONS=408} [2022-11-02 20:54:55,760 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -14 predicate places. [2022-11-02 20:54:55,761 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 408 transitions, 947 flow [2022-11-02 20:54:55,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-02 20:54:55,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:55,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:55,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:54:55,762 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:55,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1038399899, now seen corresponding path program 1 times [2022-11-02 20:54:55,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:55,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559613413] [2022-11-02 20:54:55,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:55,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:56,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:56,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559613413] [2022-11-02 20:54:56,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559613413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:56,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:56,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:54:56,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993305530] [2022-11-02 20:54:56,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:56,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:56,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:56,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:56,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:56,280 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 455 [2022-11-02 20:54:56,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 408 transitions, 947 flow. Second operand has 6 states, 6 states have (on average 419.0) internal successors, (2514), 6 states have internal predecessors, (2514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:56,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:56,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 455 [2022-11-02 20:54:56,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:57,000 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][383], [Black: 477#true, 511#true, Black: 482#true, Black: 516#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), 484#(= |#race~is_null_3~0| 0), Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 339#L80-7true, 499#(= |#race~is_null_6~0| 0), 537#true, Black: 492#true, 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, 506#true, 546#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 518#(= 0 |#race~filename_is_null_8~0|), 532#true]) [2022-11-02 20:54:57,000 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is not cut-off event [2022-11-02 20:54:57,000 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is not cut-off event [2022-11-02 20:54:57,000 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-02 20:54:57,000 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-02 20:54:57,034 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][383], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), Black: 516#true, 479#(= |#race~is_null_0~0| 0), 484#(= |#race~is_null_3~0| 0), 339#L80-7true, Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 537#true, Black: 492#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 546#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:54:57,034 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-02 20:54:57,034 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:54:57,034 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:54:57,034 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:54:57,035 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][383], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 484#(= |#race~is_null_3~0| 0), 339#L80-7true, Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 537#true, Black: 492#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 546#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:54:57,035 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is cut-off event [2022-11-02 20:54:57,035 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:54:57,035 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:54:57,035 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:54:57,035 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:54:57,035 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][383], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), Black: 516#true, 479#(= |#race~is_null_0~0| 0), 484#(= |#race~is_null_3~0| 0), 339#L80-7true, Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), Black: 492#true, 537#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, 546#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 532#true, 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:54:57,035 INFO L383 tUnfolder$Statistics]: this new event has 293 ancestors and is cut-off event [2022-11-02 20:54:57,035 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:54:57,036 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:54:57,036 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:54:57,036 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:54:57,036 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:54:57,050 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][383], [Black: 477#true, Black: 511#true, Black: 482#true, Black: 516#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), 484#(= |#race~is_null_3~0| 0), Black: 487#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 339#L80-7true, 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), 537#true, Black: 492#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 546#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:54:57,050 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is not cut-off event [2022-11-02 20:54:57,050 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:54:57,050 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:54:57,050 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:54:57,050 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:54:57,050 INFO L386 tUnfolder$Statistics]: existing Event has 293 ancestors and is not cut-off event [2022-11-02 20:54:57,050 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:54:57,053 INFO L130 PetriNetUnfolder]: 182/4368 cut-off events. [2022-11-02 20:54:57,053 INFO L131 PetriNetUnfolder]: For 5/55 co-relation queries the response was YES. [2022-11-02 20:54:57,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5112 conditions, 4368 events. 182/4368 cut-off events. For 5/55 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 42812 event pairs, 0 based on Foata normal form. 8/4032 useless extension candidates. Maximal degree in co-relation 4979. Up to 107 conditions per place. [2022-11-02 20:54:57,124 INFO L137 encePairwiseOnDemand]: 450/455 looper letters, 22 selfloop transitions, 4 changer transitions 0/407 dead transitions. [2022-11-02 20:54:57,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 407 transitions, 997 flow [2022-11-02 20:54:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:54:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:54:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2523 transitions. [2022-11-02 20:54:57,131 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9241758241758242 [2022-11-02 20:54:57,131 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2523 transitions. [2022-11-02 20:54:57,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2523 transitions. [2022-11-02 20:54:57,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:57,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2523 transitions. [2022-11-02 20:54:57,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 420.5) internal successors, (2523), 6 states have internal predecessors, (2523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:57,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 455.0) internal successors, (3185), 7 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:57,147 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 455.0) internal successors, (3185), 7 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:57,147 INFO L175 Difference]: Start difference. First operand has 400 places, 408 transitions, 947 flow. Second operand 6 states and 2523 transitions. [2022-11-02 20:54:57,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 407 transitions, 997 flow [2022-11-02 20:54:57,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 407 transitions, 993 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:54:57,160 INFO L231 Difference]: Finished difference. Result has 402 places, 407 transitions, 949 flow [2022-11-02 20:54:57,161 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=949, PETRI_PLACES=402, PETRI_TRANSITIONS=407} [2022-11-02 20:54:57,161 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -12 predicate places. [2022-11-02 20:54:57,161 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 407 transitions, 949 flow [2022-11-02 20:54:57,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 419.0) internal successors, (2514), 6 states have internal predecessors, (2514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:57,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:57,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:57,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:54:57,163 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:57,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:57,164 INFO L85 PathProgramCache]: Analyzing trace with hash 81822759, now seen corresponding path program 1 times [2022-11-02 20:54:57,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:57,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815888435] [2022-11-02 20:54:57,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:57,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:57,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:57,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815888435] [2022-11-02 20:54:57,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815888435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:57,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:57,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:57,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932817755] [2022-11-02 20:54:57,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:57,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:57,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:57,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:57,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:57,240 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 455 [2022-11-02 20:54:57,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 407 transitions, 949 flow. Second operand has 3 states, 3 states have (on average 437.0) internal successors, (1311), 3 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:57,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:57,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 455 [2022-11-02 20:54:57,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:58,403 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][390], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), Black: 516#true, 479#(= |#race~is_null_0~0| 0), 484#(= |#race~is_null_3~0| 0), 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 339#L80-7true, Black: 487#true, 508#(= |#race~filename_1~0| 0), 548#true, 499#(= |#race~is_null_6~0| 0), Black: 492#true, 513#(= |#race~filename_4~0| 0), 534#(= |#race~filename_7~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 546#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:54:58,403 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-02 20:54:58,403 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:54:58,403 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:54:58,403 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:54:58,424 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][390], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 484#(= |#race~is_null_3~0| 0), 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 339#L80-7true, Black: 487#true, 508#(= |#race~filename_1~0| 0), 548#true, 499#(= |#race~is_null_6~0| 0), Black: 492#true, 513#(= |#race~filename_4~0| 0), 534#(= |#race~filename_7~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 546#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:54:58,424 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is not cut-off event [2022-11-02 20:54:58,424 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:54:58,425 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:54:58,425 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:54:58,425 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:54:58,430 INFO L130 PetriNetUnfolder]: 318/7496 cut-off events. [2022-11-02 20:54:58,431 INFO L131 PetriNetUnfolder]: For 64/71 co-relation queries the response was YES. [2022-11-02 20:54:58,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8410 conditions, 7496 events. 318/7496 cut-off events. For 64/71 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 81515 event pairs, 11 based on Foata normal form. 1/6913 useless extension candidates. Maximal degree in co-relation 7567. Up to 158 conditions per place. [2022-11-02 20:54:58,526 INFO L137 encePairwiseOnDemand]: 451/455 looper letters, 17 selfloop transitions, 2 changer transitions 0/414 dead transitions. [2022-11-02 20:54:58,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 414 transitions, 1006 flow [2022-11-02 20:54:58,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:58,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1323 transitions. [2022-11-02 20:54:58,529 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2022-11-02 20:54:58,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1323 transitions. [2022-11-02 20:54:58,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1323 transitions. [2022-11-02 20:54:58,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:58,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1323 transitions. [2022-11-02 20:54:58,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 441.0) internal successors, (1323), 3 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:58,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:58,535 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:58,536 INFO L175 Difference]: Start difference. First operand has 402 places, 407 transitions, 949 flow. Second operand 3 states and 1323 transitions. [2022-11-02 20:54:58,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 414 transitions, 1006 flow [2022-11-02 20:54:58,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 414 transitions, 999 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:54:58,544 INFO L231 Difference]: Finished difference. Result has 402 places, 409 transitions, 962 flow [2022-11-02 20:54:58,545 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=962, PETRI_PLACES=402, PETRI_TRANSITIONS=409} [2022-11-02 20:54:58,545 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -12 predicate places. [2022-11-02 20:54:58,545 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 409 transitions, 962 flow [2022-11-02 20:54:58,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 437.0) internal successors, (1311), 3 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:58,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:58,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:58,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:54:58,547 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:58,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:58,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1039559643, now seen corresponding path program 1 times [2022-11-02 20:54:58,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:58,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643625826] [2022-11-02 20:54:58,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:58,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:58,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:58,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643625826] [2022-11-02 20:54:58,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643625826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:58,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:58,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:54:58,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594840812] [2022-11-02 20:54:58,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:58,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:54:58,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:58,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:54:58,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:54:58,610 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 455 [2022-11-02 20:54:58,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 409 transitions, 962 flow. Second operand has 3 states, 3 states have (on average 437.0) internal successors, (1311), 3 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:58,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:54:58,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 455 [2022-11-02 20:54:58,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:54:59,535 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][392], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), Black: 516#true, 479#(= |#race~is_null_0~0| 0), Black: 550#(not (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256)))), 484#(= |#race~is_null_3~0| 0), 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 487#true, 339#L80-7true, 508#(= |#race~filename_1~0| 0), 548#true, 499#(= |#race~is_null_6~0| 0), Black: 492#true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 556#(= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, Black: 532#true, 546#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:54:59,535 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is cut-off event [2022-11-02 20:54:59,536 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:54:59,536 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:54:59,536 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:54:59,553 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][392], [Black: 477#true, Black: 511#true, Black: 482#true, 494#(= 0 |#race~filename_is_null_5~0|), Black: 516#true, 479#(= |#race~is_null_0~0| 0), Black: 550#(not (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256)))), 484#(= |#race~is_null_3~0| 0), 339#L80-7true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 487#true, 508#(= |#race~filename_1~0| 0), 548#true, 499#(= |#race~is_null_6~0| 0), Black: 492#true, 556#(= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))), 513#(= |#race~filename_4~0| 0), 534#(= |#race~filename_7~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 497#true, 546#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 532#true, 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:54:59,554 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is not cut-off event [2022-11-02 20:54:59,554 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:54:59,554 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:54:59,554 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:54:59,554 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:54:59,558 INFO L130 PetriNetUnfolder]: 269/6246 cut-off events. [2022-11-02 20:54:59,558 INFO L131 PetriNetUnfolder]: For 98/113 co-relation queries the response was YES. [2022-11-02 20:54:59,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7034 conditions, 6246 events. 269/6246 cut-off events. For 98/113 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 64550 event pairs, 10 based on Foata normal form. 7/5797 useless extension candidates. Maximal degree in co-relation 6147. Up to 142 conditions per place. [2022-11-02 20:54:59,617 INFO L137 encePairwiseOnDemand]: 449/455 looper letters, 17 selfloop transitions, 4 changer transitions 0/416 dead transitions. [2022-11-02 20:54:59,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 416 transitions, 1027 flow [2022-11-02 20:54:59,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:54:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:54:59,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1323 transitions. [2022-11-02 20:54:59,621 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9692307692307692 [2022-11-02 20:54:59,621 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1323 transitions. [2022-11-02 20:54:59,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1323 transitions. [2022-11-02 20:54:59,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:54:59,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1323 transitions. [2022-11-02 20:54:59,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 441.0) internal successors, (1323), 3 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:59,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:59,627 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:59,627 INFO L175 Difference]: Start difference. First operand has 402 places, 409 transitions, 962 flow. Second operand 3 states and 1323 transitions. [2022-11-02 20:54:59,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 416 transitions, 1027 flow [2022-11-02 20:54:59,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 416 transitions, 1025 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:54:59,635 INFO L231 Difference]: Finished difference. Result has 405 places, 411 transitions, 992 flow [2022-11-02 20:54:59,636 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=992, PETRI_PLACES=405, PETRI_TRANSITIONS=411} [2022-11-02 20:54:59,637 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -9 predicate places. [2022-11-02 20:54:59,637 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 411 transitions, 992 flow [2022-11-02 20:54:59,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 437.0) internal successors, (1311), 3 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:54:59,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:54:59,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:59,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:54:59,638 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:54:59,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:59,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1811515054, now seen corresponding path program 1 times [2022-11-02 20:54:59,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:59,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23449969] [2022-11-02 20:54:59,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:59,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:00,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:00,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:00,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23449969] [2022-11-02 20:55:00,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23449969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:00,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:00,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:55:00,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620625523] [2022-11-02 20:55:00,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:00,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:55:00,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:00,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:55:00,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:55:00,165 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 455 [2022-11-02 20:55:00,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 411 transitions, 992 flow. Second operand has 6 states, 6 states have (on average 420.0) internal successors, (2520), 6 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:00,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:00,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 455 [2022-11-02 20:55:00,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:00,864 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][386], [Black: 477#true, 511#true, 565#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 482#true, 479#(= |#race~is_null_0~0| 0), Black: 516#true, 494#(= 0 |#race~filename_is_null_5~0|), Black: 550#(not (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256)))), 484#(= |#race~is_null_3~0| 0), 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 339#L80-7true, Black: 487#true, 499#(= |#race~is_null_6~0| 0), Black: 554#true, Black: 492#true, 556#(= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))), 489#(= 0 |#race~filename_is_null_2~0|), 506#true, Black: 497#true, 546#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 518#(= 0 |#race~filename_is_null_8~0|), 532#true]) [2022-11-02 20:55:00,864 INFO L383 tUnfolder$Statistics]: this new event has 207 ancestors and is not cut-off event [2022-11-02 20:55:00,864 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-02 20:55:00,865 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-11-02 20:55:00,865 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is not cut-off event [2022-11-02 20:55:00,895 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][386], [Black: 511#true, 494#(= 0 |#race~filename_is_null_5~0|), Black: 516#true, 479#(= |#race~is_null_0~0| 0), 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 532#true, 546#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 477#true, 565#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 482#true, Black: 550#(not (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256)))), 484#(= |#race~is_null_3~0| 0), Black: 487#true, 339#L80-7true, 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), Black: 554#true, Black: 492#true, 556#(= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))), Black: 497#true, 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:55:00,895 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is cut-off event [2022-11-02 20:55:00,895 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:55:00,895 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:55:00,896 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:55:00,896 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][386], [Black: 511#true, 494#(= 0 |#race~filename_is_null_5~0|), Black: 516#true, 479#(= |#race~is_null_0~0| 0), 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), 546#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 532#true, Black: 477#true, 565#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 482#true, Black: 550#(not (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256)))), 484#(= |#race~is_null_3~0| 0), 339#L80-7true, Black: 487#true, 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), Black: 554#true, Black: 492#true, 556#(= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))), Black: 497#true, 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:55:00,896 INFO L383 tUnfolder$Statistics]: this new event has 267 ancestors and is cut-off event [2022-11-02 20:55:00,896 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:55:00,896 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:55:00,897 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:55:00,897 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:55:00,897 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][386], [Black: 511#true, 494#(= 0 |#race~filename_is_null_5~0|), Black: 516#true, 479#(= |#race~is_null_0~0| 0), 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 532#true, 546#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 477#true, 565#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 482#true, Black: 550#(not (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256)))), 484#(= |#race~is_null_3~0| 0), 339#L80-7true, Black: 487#true, 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), Black: 554#true, Black: 492#true, 556#(= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))), Black: 497#true, 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:55:00,897 INFO L383 tUnfolder$Statistics]: this new event has 293 ancestors and is cut-off event [2022-11-02 20:55:00,897 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:55:00,898 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:55:00,898 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:55:00,898 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is cut-off event [2022-11-02 20:55:00,898 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is cut-off event [2022-11-02 20:55:00,913 INFO L381 tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([1292] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem51#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem51#1=|v_ULTIMATE.start_main_#t~mem51#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][386], [Black: 511#true, 494#(= 0 |#race~filename_is_null_5~0|), 479#(= |#race~is_null_0~0| 0), Black: 516#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), 546#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 532#true, Black: 477#true, 565#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 482#true, Black: 550#(not (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256)))), 484#(= |#race~is_null_3~0| 0), 339#L80-7true, Black: 487#true, 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), Black: 554#true, Black: 492#true, 556#(= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))), Black: 497#true, 518#(= 0 |#race~filename_is_null_8~0|), Black: 506#true]) [2022-11-02 20:55:00,913 INFO L383 tUnfolder$Statistics]: this new event has 259 ancestors and is not cut-off event [2022-11-02 20:55:00,913 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:55:00,913 INFO L386 tUnfolder$Statistics]: existing Event has 293 ancestors and is not cut-off event [2022-11-02 20:55:00,913 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:55:00,913 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:55:00,913 INFO L386 tUnfolder$Statistics]: existing Event has 267 ancestors and is not cut-off event [2022-11-02 20:55:00,914 INFO L386 tUnfolder$Statistics]: existing Event has 259 ancestors and is not cut-off event [2022-11-02 20:55:00,916 INFO L130 PetriNetUnfolder]: 177/4406 cut-off events. [2022-11-02 20:55:00,917 INFO L131 PetriNetUnfolder]: For 22/87 co-relation queries the response was YES. [2022-11-02 20:55:00,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5013 conditions, 4406 events. 177/4406 cut-off events. For 22/87 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 43056 event pairs, 0 based on Foata normal form. 0/4062 useless extension candidates. Maximal degree in co-relation 4874. Up to 100 conditions per place. [2022-11-02 20:55:00,982 INFO L137 encePairwiseOnDemand]: 450/455 looper letters, 21 selfloop transitions, 4 changer transitions 0/410 dead transitions. [2022-11-02 20:55:00,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 410 transitions, 1040 flow [2022-11-02 20:55:00,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:55:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:55:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2522 transitions. [2022-11-02 20:55:00,987 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9238095238095239 [2022-11-02 20:55:00,987 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2522 transitions. [2022-11-02 20:55:00,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2522 transitions. [2022-11-02 20:55:00,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:00,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2522 transitions. [2022-11-02 20:55:00,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 420.3333333333333) internal successors, (2522), 6 states have internal predecessors, (2522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:00,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 455.0) internal successors, (3185), 7 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:00,997 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 455.0) internal successors, (3185), 7 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:00,997 INFO L175 Difference]: Start difference. First operand has 405 places, 411 transitions, 992 flow. Second operand 6 states and 2522 transitions. [2022-11-02 20:55:00,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 410 transitions, 1040 flow [2022-11-02 20:55:01,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 410 transitions, 1028 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:01,006 INFO L231 Difference]: Finished difference. Result has 407 places, 410 transitions, 986 flow [2022-11-02 20:55:01,007 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=986, PETRI_PLACES=407, PETRI_TRANSITIONS=410} [2022-11-02 20:55:01,007 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -7 predicate places. [2022-11-02 20:55:01,007 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 410 transitions, 986 flow [2022-11-02 20:55:01,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 420.0) internal successors, (2520), 6 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:01,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:01,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:01,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:55:01,009 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:55:01,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:01,009 INFO L85 PathProgramCache]: Analyzing trace with hash -68700539, now seen corresponding path program 1 times [2022-11-02 20:55:01,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:01,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460435099] [2022-11-02 20:55:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:01,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:01,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460435099] [2022-11-02 20:55:01,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460435099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:01,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:01,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:55:01,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836583547] [2022-11-02 20:55:01,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:01,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:01,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:01,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:01,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:01,098 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 432 out of 455 [2022-11-02 20:55:01,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 410 transitions, 986 flow. Second operand has 3 states, 3 states have (on average 435.3333333333333) internal successors, (1306), 3 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:01,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:01,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 432 of 455 [2022-11-02 20:55:01,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:02,393 INFO L130 PetriNetUnfolder]: 322/8341 cut-off events. [2022-11-02 20:55:02,393 INFO L131 PetriNetUnfolder]: For 80/97 co-relation queries the response was YES. [2022-11-02 20:55:02,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9427 conditions, 8341 events. 322/8341 cut-off events. For 80/97 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 94624 event pairs, 22 based on Foata normal form. 0/7750 useless extension candidates. Maximal degree in co-relation 8727. Up to 181 conditions per place. [2022-11-02 20:55:02,513 INFO L137 encePairwiseOnDemand]: 447/455 looper letters, 17 selfloop transitions, 5 changer transitions 0/418 dead transitions. [2022-11-02 20:55:02,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 418 transitions, 1051 flow [2022-11-02 20:55:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1321 transitions. [2022-11-02 20:55:02,517 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9677655677655678 [2022-11-02 20:55:02,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1321 transitions. [2022-11-02 20:55:02,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1321 transitions. [2022-11-02 20:55:02,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:02,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1321 transitions. [2022-11-02 20:55:02,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 440.3333333333333) internal successors, (1321), 3 states have internal predecessors, (1321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:02,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:02,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:02,524 INFO L175 Difference]: Start difference. First operand has 407 places, 410 transitions, 986 flow. Second operand 3 states and 1321 transitions. [2022-11-02 20:55:02,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 418 transitions, 1051 flow [2022-11-02 20:55:02,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 418 transitions, 1044 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:55:02,533 INFO L231 Difference]: Finished difference. Result has 407 places, 413 transitions, 1017 flow [2022-11-02 20:55:02,534 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1017, PETRI_PLACES=407, PETRI_TRANSITIONS=413} [2022-11-02 20:55:02,534 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -7 predicate places. [2022-11-02 20:55:02,534 INFO L495 AbstractCegarLoop]: Abstraction has has 407 places, 413 transitions, 1017 flow [2022-11-02 20:55:02,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.3333333333333) internal successors, (1306), 3 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:02,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:02,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:02,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:55:02,535 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:55:02,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:02,536 INFO L85 PathProgramCache]: Analyzing trace with hash 521225794, now seen corresponding path program 1 times [2022-11-02 20:55:02,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:02,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857642862] [2022-11-02 20:55:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:02,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:02,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:02,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857642862] [2022-11-02 20:55:02,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857642862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:02,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:02,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:55:02,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847612227] [2022-11-02 20:55:02,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:02,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:02,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:02,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:02,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:02,605 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 432 out of 455 [2022-11-02 20:55:02,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 413 transitions, 1017 flow. Second operand has 3 states, 3 states have (on average 435.3333333333333) internal successors, (1306), 3 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:02,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:02,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 432 of 455 [2022-11-02 20:55:02,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:03,701 INFO L130 PetriNetUnfolder]: 271/7015 cut-off events. [2022-11-02 20:55:03,701 INFO L131 PetriNetUnfolder]: For 137/164 co-relation queries the response was YES. [2022-11-02 20:55:03,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7915 conditions, 7015 events. 271/7015 cut-off events. For 137/164 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 75011 event pairs, 20 based on Foata normal form. 11/6549 useless extension candidates. Maximal degree in co-relation 7163. Up to 162 conditions per place. [2022-11-02 20:55:03,769 INFO L137 encePairwiseOnDemand]: 449/455 looper letters, 22 selfloop transitions, 3 changer transitions 0/421 dead transitions. [2022-11-02 20:55:03,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 421 transitions, 1094 flow [2022-11-02 20:55:03,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1321 transitions. [2022-11-02 20:55:03,774 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9677655677655678 [2022-11-02 20:55:03,774 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1321 transitions. [2022-11-02 20:55:03,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1321 transitions. [2022-11-02 20:55:03,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:03,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1321 transitions. [2022-11-02 20:55:03,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 440.3333333333333) internal successors, (1321), 3 states have internal predecessors, (1321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:03,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:03,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:03,780 INFO L175 Difference]: Start difference. First operand has 407 places, 413 transitions, 1017 flow. Second operand 3 states and 1321 transitions. [2022-11-02 20:55:03,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 421 transitions, 1094 flow [2022-11-02 20:55:03,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 421 transitions, 1084 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:03,791 INFO L231 Difference]: Finished difference. Result has 409 places, 416 transitions, 1043 flow [2022-11-02 20:55:03,792 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1043, PETRI_PLACES=409, PETRI_TRANSITIONS=416} [2022-11-02 20:55:03,792 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -5 predicate places. [2022-11-02 20:55:03,792 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 416 transitions, 1043 flow [2022-11-02 20:55:03,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.3333333333333) internal successors, (1306), 3 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:03,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:03,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:03,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:55:03,794 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:55:03,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:03,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1897171999, now seen corresponding path program 1 times [2022-11-02 20:55:03,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:03,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352639376] [2022-11-02 20:55:03,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:03,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:03,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:03,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352639376] [2022-11-02 20:55:03,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352639376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:03,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:03,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:55:03,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906480218] [2022-11-02 20:55:03,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:03,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:03,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:03,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:03,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:03,889 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 455 [2022-11-02 20:55:03,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 416 transitions, 1043 flow. Second operand has 3 states, 3 states have (on average 433.3333333333333) internal successors, (1300), 3 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:03,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:03,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 455 [2022-11-02 20:55:03,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:05,665 INFO L130 PetriNetUnfolder]: 391/11080 cut-off events. [2022-11-02 20:55:05,665 INFO L131 PetriNetUnfolder]: For 148/189 co-relation queries the response was YES. [2022-11-02 20:55:05,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12449 conditions, 11080 events. 391/11080 cut-off events. For 148/189 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 136615 event pairs, 62 based on Foata normal form. 3/10367 useless extension candidates. Maximal degree in co-relation 11701. Up to 248 conditions per place. [2022-11-02 20:55:05,865 INFO L137 encePairwiseOnDemand]: 447/455 looper letters, 20 selfloop transitions, 4 changer transitions 0/424 dead transitions. [2022-11-02 20:55:05,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 424 transitions, 1111 flow [2022-11-02 20:55:05,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1318 transitions. [2022-11-02 20:55:05,869 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9655677655677656 [2022-11-02 20:55:05,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1318 transitions. [2022-11-02 20:55:05,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1318 transitions. [2022-11-02 20:55:05,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:05,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1318 transitions. [2022-11-02 20:55:05,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 439.3333333333333) internal successors, (1318), 3 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:05,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:05,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:05,873 INFO L175 Difference]: Start difference. First operand has 409 places, 416 transitions, 1043 flow. Second operand 3 states and 1318 transitions. [2022-11-02 20:55:05,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 424 transitions, 1111 flow [2022-11-02 20:55:05,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 424 transitions, 1102 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-11-02 20:55:05,884 INFO L231 Difference]: Finished difference. Result has 412 places, 420 transitions, 1074 flow [2022-11-02 20:55:05,884 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1074, PETRI_PLACES=412, PETRI_TRANSITIONS=420} [2022-11-02 20:55:05,885 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -2 predicate places. [2022-11-02 20:55:05,886 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 420 transitions, 1074 flow [2022-11-02 20:55:05,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.3333333333333) internal successors, (1300), 3 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:05,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:05,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:05,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:55:05,887 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:55:05,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:05,887 INFO L85 PathProgramCache]: Analyzing trace with hash -105891779, now seen corresponding path program 1 times [2022-11-02 20:55:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:05,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542734675] [2022-11-02 20:55:05,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:05,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:05,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:05,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542734675] [2022-11-02 20:55:05,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542734675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:05,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:05,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:55:05,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043225601] [2022-11-02 20:55:05,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:05,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:05,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:05,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:05,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:05,964 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 455 [2022-11-02 20:55:05,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 420 transitions, 1074 flow. Second operand has 3 states, 3 states have (on average 433.3333333333333) internal successors, (1300), 3 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:05,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:05,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 455 [2022-11-02 20:55:05,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:07,353 INFO L130 PetriNetUnfolder]: 369/9927 cut-off events. [2022-11-02 20:55:07,354 INFO L131 PetriNetUnfolder]: For 486/715 co-relation queries the response was YES. [2022-11-02 20:55:07,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11487 conditions, 9927 events. 369/9927 cut-off events. For 486/715 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 118674 event pairs, 39 based on Foata normal form. 78/9442 useless extension candidates. Maximal degree in co-relation 10720. Up to 247 conditions per place. [2022-11-02 20:55:07,490 INFO L137 encePairwiseOnDemand]: 445/455 looper letters, 22 selfloop transitions, 6 changer transitions 0/428 dead transitions. [2022-11-02 20:55:07,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 428 transitions, 1158 flow [2022-11-02 20:55:07,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1318 transitions. [2022-11-02 20:55:07,495 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9655677655677656 [2022-11-02 20:55:07,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1318 transitions. [2022-11-02 20:55:07,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1318 transitions. [2022-11-02 20:55:07,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:07,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1318 transitions. [2022-11-02 20:55:07,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 439.3333333333333) internal successors, (1318), 3 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:07,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:07,500 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:07,500 INFO L175 Difference]: Start difference. First operand has 412 places, 420 transitions, 1074 flow. Second operand 3 states and 1318 transitions. [2022-11-02 20:55:07,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 428 transitions, 1158 flow [2022-11-02 20:55:07,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 428 transitions, 1154 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:55:07,513 INFO L231 Difference]: Finished difference. Result has 415 places, 424 transitions, 1126 flow [2022-11-02 20:55:07,514 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=415, PETRI_TRANSITIONS=424} [2022-11-02 20:55:07,514 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, 1 predicate places. [2022-11-02 20:55:07,515 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 424 transitions, 1126 flow [2022-11-02 20:55:07,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.3333333333333) internal successors, (1300), 3 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:07,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:07,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:07,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-02 20:55:07,516 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:55:07,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:07,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1883355912, now seen corresponding path program 1 times [2022-11-02 20:55:07,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:07,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110671750] [2022-11-02 20:55:07,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:07,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:07,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:07,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110671750] [2022-11-02 20:55:07,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110671750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:07,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:07,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:07,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629974531] [2022-11-02 20:55:07,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:07,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:07,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:07,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:07,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:07,590 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 455 [2022-11-02 20:55:07,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 424 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 437.3333333333333) internal successors, (1312), 3 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:07,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:07,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 455 [2022-11-02 20:55:07,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:09,126 INFO L130 PetriNetUnfolder]: 308/9168 cut-off events. [2022-11-02 20:55:09,127 INFO L131 PetriNetUnfolder]: For 274/479 co-relation queries the response was YES. [2022-11-02 20:55:09,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10679 conditions, 9168 events. 308/9168 cut-off events. For 274/479 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 111632 event pairs, 20 based on Foata normal form. 0/8691 useless extension candidates. Maximal degree in co-relation 9529. Up to 232 conditions per place. [2022-11-02 20:55:09,190 INFO L137 encePairwiseOnDemand]: 453/455 looper letters, 9 selfloop transitions, 1 changer transitions 0/423 dead transitions. [2022-11-02 20:55:09,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 423 transitions, 1144 flow [2022-11-02 20:55:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1313 transitions. [2022-11-02 20:55:09,193 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9619047619047619 [2022-11-02 20:55:09,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1313 transitions. [2022-11-02 20:55:09,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1313 transitions. [2022-11-02 20:55:09,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:09,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1313 transitions. [2022-11-02 20:55:09,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 437.6666666666667) internal successors, (1313), 3 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:09,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:09,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:09,198 INFO L175 Difference]: Start difference. First operand has 415 places, 424 transitions, 1126 flow. Second operand 3 states and 1313 transitions. [2022-11-02 20:55:09,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 423 transitions, 1144 flow [2022-11-02 20:55:09,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 423 transitions, 1124 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-02 20:55:09,207 INFO L231 Difference]: Finished difference. Result has 414 places, 423 transitions, 1106 flow [2022-11-02 20:55:09,208 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1106, PETRI_PLACES=414, PETRI_TRANSITIONS=423} [2022-11-02 20:55:09,208 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, 0 predicate places. [2022-11-02 20:55:09,208 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 423 transitions, 1106 flow [2022-11-02 20:55:09,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 437.3333333333333) internal successors, (1312), 3 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:09,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:09,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:09,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:55:09,209 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:55:09,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:09,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1202662372, now seen corresponding path program 1 times [2022-11-02 20:55:09,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:09,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822327457] [2022-11-02 20:55:09,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:09,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:09,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:09,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822327457] [2022-11-02 20:55:09,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822327457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:09,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:09,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:09,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918497837] [2022-11-02 20:55:09,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:09,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:09,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:09,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:09,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:09,279 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 455 [2022-11-02 20:55:09,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 423 transitions, 1106 flow. Second operand has 3 states, 3 states have (on average 434.3333333333333) internal successors, (1303), 3 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:09,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:09,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 455 [2022-11-02 20:55:09,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:10,924 INFO L130 PetriNetUnfolder]: 358/10362 cut-off events. [2022-11-02 20:55:10,924 INFO L131 PetriNetUnfolder]: For 125/271 co-relation queries the response was YES. [2022-11-02 20:55:11,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12135 conditions, 10362 events. 358/10362 cut-off events. For 125/271 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 130183 event pairs, 62 based on Foata normal form. 0/9802 useless extension candidates. Maximal degree in co-relation 11757. Up to 264 conditions per place. [2022-11-02 20:55:11,082 INFO L137 encePairwiseOnDemand]: 452/455 looper letters, 11 selfloop transitions, 1 changer transitions 0/421 dead transitions. [2022-11-02 20:55:11,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 421 transitions, 1126 flow [2022-11-02 20:55:11,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1307 transitions. [2022-11-02 20:55:11,086 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9575091575091575 [2022-11-02 20:55:11,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1307 transitions. [2022-11-02 20:55:11,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1307 transitions. [2022-11-02 20:55:11,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:11,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1307 transitions. [2022-11-02 20:55:11,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 435.6666666666667) internal successors, (1307), 3 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:11,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:11,092 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:11,093 INFO L175 Difference]: Start difference. First operand has 414 places, 423 transitions, 1106 flow. Second operand 3 states and 1307 transitions. [2022-11-02 20:55:11,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 421 transitions, 1126 flow [2022-11-02 20:55:11,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 421 transitions, 1125 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:55:11,105 INFO L231 Difference]: Finished difference. Result has 413 places, 421 transitions, 1103 flow [2022-11-02 20:55:11,105 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1103, PETRI_PLACES=413, PETRI_TRANSITIONS=421} [2022-11-02 20:55:11,106 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -1 predicate places. [2022-11-02 20:55:11,106 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 421 transitions, 1103 flow [2022-11-02 20:55:11,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 434.3333333333333) internal successors, (1303), 3 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:11,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:55:11,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:11,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-02 20:55:11,107 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2022-11-02 20:55:11,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:11,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1058514002, now seen corresponding path program 1 times [2022-11-02 20:55:11,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:11,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272729710] [2022-11-02 20:55:11,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:11,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:55:11,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:11,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272729710] [2022-11-02 20:55:11,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272729710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:11,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:11,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:55:11,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628804634] [2022-11-02 20:55:11,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:11,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:55:11,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:11,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:55:11,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:55:11,198 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 455 [2022-11-02 20:55:11,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 421 transitions, 1103 flow. Second operand has 3 states, 3 states have (on average 434.3333333333333) internal successors, (1303), 3 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:11,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:55:11,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 455 [2022-11-02 20:55:11,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:55:12,413 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1224] L56-47-->L56-48: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet24#1_3| |v_#race~result_11~0_1|) InVars {thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork1_#t~nondet24#1=|v_thread3Thread1of1ForFork1_#t~nondet24#1_3|} AuxVars[] AssignedVars[#race~result_11~0][270], [Black: 575#(not (= ~is_null_3~0 (* (div ~is_null_3~0 256) 256))), Black: 511#true, Black: 581#(not (= (* 256 (div ~is_null_6~0 256)) ~is_null_6~0)), 494#(= 0 |#race~filename_is_null_5~0|), 107#L56-48true, 479#(= |#race~is_null_0~0| 0), Black: 516#true, 530#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 595#true, Black: 585#true, 209#L79-7true, 534#(= |#race~filename_7~0| 0), 513#(= |#race~filename_4~0| 0), 489#(= 0 |#race~filename_is_null_2~0|), Black: 532#true, 546#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 477#true, Black: 482#true, Black: 550#(not (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256)))), 484#(= |#race~is_null_3~0| 0), Black: 487#true, 508#(= |#race~filename_1~0| 0), 499#(= |#race~is_null_6~0| 0), Black: 554#true, Black: 492#true, 599#true, Black: 497#true, 518#(= 0 |#race~filename_is_null_8~0|), Black: 567#true, Black: 506#true]) [2022-11-02 20:55:12,413 INFO L383 tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event [2022-11-02 20:55:12,413 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:55:12,413 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:55:12,413 INFO L386 tUnfolder$Statistics]: existing Event has 248 ancestors and is cut-off event [2022-11-02 20:55:12,439 INFO L130 PetriNetUnfolder]: 364/8039 cut-off events. [2022-11-02 20:55:12,440 INFO L131 PetriNetUnfolder]: For 209/310 co-relation queries the response was YES. [2022-11-02 20:55:12,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9774 conditions, 8039 events. 364/8039 cut-off events. For 209/310 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 97663 event pairs, 126 based on Foata normal form. 15/7605 useless extension candidates. Maximal degree in co-relation 9636. Up to 667 conditions per place. [2022-11-02 20:55:12,521 INFO L137 encePairwiseOnDemand]: 452/455 looper letters, 0 selfloop transitions, 0 changer transitions 419/419 dead transitions. [2022-11-02 20:55:12,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 419 transitions, 1121 flow [2022-11-02 20:55:12,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:55:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:55:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1306 transitions. [2022-11-02 20:55:12,523 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9567765567765568 [2022-11-02 20:55:12,523 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1306 transitions. [2022-11-02 20:55:12,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1306 transitions. [2022-11-02 20:55:12,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:55:12,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1306 transitions. [2022-11-02 20:55:12,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 435.3333333333333) internal successors, (1306), 3 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,528 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 455.0) internal successors, (1820), 4 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,528 INFO L175 Difference]: Start difference. First operand has 413 places, 421 transitions, 1103 flow. Second operand 3 states and 1306 transitions. [2022-11-02 20:55:12,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 419 transitions, 1121 flow [2022-11-02 20:55:12,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 419 transitions, 1120 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:55:12,536 INFO L231 Difference]: Finished difference. Result has 412 places, 0 transitions, 0 flow [2022-11-02 20:55:12,536 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=412, PETRI_TRANSITIONS=0} [2022-11-02 20:55:12,537 INFO L287 CegarLoopForPetriNet]: 414 programPoint places, -2 predicate places. [2022-11-02 20:55:12,537 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 0 transitions, 0 flow [2022-11-02 20:55:12,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 434.3333333333333) internal successors, (1303), 3 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:55:12,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (73 of 74 remaining) [2022-11-02 20:55:12,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (72 of 74 remaining) [2022-11-02 20:55:12,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (71 of 74 remaining) [2022-11-02 20:55:12,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (70 of 74 remaining) [2022-11-02 20:55:12,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (69 of 74 remaining) [2022-11-02 20:55:12,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (68 of 74 remaining) [2022-11-02 20:55:12,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (67 of 74 remaining) [2022-11-02 20:55:12,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (66 of 74 remaining) [2022-11-02 20:55:12,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (65 of 74 remaining) [2022-11-02 20:55:12,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (64 of 74 remaining) [2022-11-02 20:55:12,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (63 of 74 remaining) [2022-11-02 20:55:12,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (62 of 74 remaining) [2022-11-02 20:55:12,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (61 of 74 remaining) [2022-11-02 20:55:12,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (60 of 74 remaining) [2022-11-02 20:55:12,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (59 of 74 remaining) [2022-11-02 20:55:12,551 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (58 of 74 remaining) [2022-11-02 20:55:12,551 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (57 of 74 remaining) [2022-11-02 20:55:12,551 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (56 of 74 remaining) [2022-11-02 20:55:12,551 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (55 of 74 remaining) [2022-11-02 20:55:12,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (54 of 74 remaining) [2022-11-02 20:55:12,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (53 of 74 remaining) [2022-11-02 20:55:12,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (52 of 74 remaining) [2022-11-02 20:55:12,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (51 of 74 remaining) [2022-11-02 20:55:12,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (50 of 74 remaining) [2022-11-02 20:55:12,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (49 of 74 remaining) [2022-11-02 20:55:12,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (48 of 74 remaining) [2022-11-02 20:55:12,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (47 of 74 remaining) [2022-11-02 20:55:12,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (46 of 74 remaining) [2022-11-02 20:55:12,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 74 remaining) [2022-11-02 20:55:12,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 74 remaining) [2022-11-02 20:55:12,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 74 remaining) [2022-11-02 20:55:12,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 74 remaining) [2022-11-02 20:55:12,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 74 remaining) [2022-11-02 20:55:12,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (40 of 74 remaining) [2022-11-02 20:55:12,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 74 remaining) [2022-11-02 20:55:12,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 74 remaining) [2022-11-02 20:55:12,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (37 of 74 remaining) [2022-11-02 20:55:12,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (36 of 74 remaining) [2022-11-02 20:55:12,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (35 of 74 remaining) [2022-11-02 20:55:12,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (34 of 74 remaining) [2022-11-02 20:55:12,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (33 of 74 remaining) [2022-11-02 20:55:12,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (32 of 74 remaining) [2022-11-02 20:55:12,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (31 of 74 remaining) [2022-11-02 20:55:12,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (30 of 74 remaining) [2022-11-02 20:55:12,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 74 remaining) [2022-11-02 20:55:12,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 74 remaining) [2022-11-02 20:55:12,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 74 remaining) [2022-11-02 20:55:12,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 74 remaining) [2022-11-02 20:55:12,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 74 remaining) [2022-11-02 20:55:12,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 74 remaining) [2022-11-02 20:55:12,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 74 remaining) [2022-11-02 20:55:12,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (22 of 74 remaining) [2022-11-02 20:55:12,559 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 74 remaining) [2022-11-02 20:55:12,559 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (20 of 74 remaining) [2022-11-02 20:55:12,559 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 74 remaining) [2022-11-02 20:55:12,559 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 74 remaining) [2022-11-02 20:55:12,559 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 74 remaining) [2022-11-02 20:55:12,560 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 74 remaining) [2022-11-02 20:55:12,560 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 74 remaining) [2022-11-02 20:55:12,560 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 74 remaining) [2022-11-02 20:55:12,560 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 74 remaining) [2022-11-02 20:55:12,560 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (12 of 74 remaining) [2022-11-02 20:55:12,560 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (11 of 74 remaining) [2022-11-02 20:55:12,561 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 74 remaining) [2022-11-02 20:55:12,561 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 74 remaining) [2022-11-02 20:55:12,561 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 74 remaining) [2022-11-02 20:55:12,561 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 74 remaining) [2022-11-02 20:55:12,561 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 74 remaining) [2022-11-02 20:55:12,562 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 74 remaining) [2022-11-02 20:55:12,562 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 74 remaining) [2022-11-02 20:55:12,562 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (3 of 74 remaining) [2022-11-02 20:55:12,562 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (2 of 74 remaining) [2022-11-02 20:55:12,562 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 74 remaining) [2022-11-02 20:55:12,562 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 74 remaining) [2022-11-02 20:55:12,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-02 20:55:12,563 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:55:12,570 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:55:12,570 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:55:12,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:55:12 BasicIcfg [2022-11-02 20:55:12,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:55:12,578 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:55:12,578 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:55:12,579 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:55:12,579 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:37" (3/4) ... [2022-11-02 20:55:12,582 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:55:12,588 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:55:12,588 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:55:12,588 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:55:12,594 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-02 20:55:12,594 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:55:12,594 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:55:12,595 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:55:12,658 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:55:12,659 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:55:12,660 INFO L158 Benchmark]: Toolchain (without parser) took 36902.68ms. Allocated memory was 83.9MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 45.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 407.8MB. Max. memory is 16.1GB. [2022-11-02 20:55:12,661 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:55:12,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.69ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 45.5MB in the beginning and 75.8MB in the end (delta: -30.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:55:12,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.78ms. Allocated memory is still 102.8MB. Free memory was 75.3MB in the beginning and 72.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:55:12,662 INFO L158 Benchmark]: Boogie Preprocessor took 38.38ms. Allocated memory is still 102.8MB. Free memory was 72.7MB in the beginning and 70.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:55:12,666 INFO L158 Benchmark]: RCFGBuilder took 965.96ms. Allocated memory is still 102.8MB. Free memory was 70.6MB in the beginning and 41.7MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-02 20:55:12,666 INFO L158 Benchmark]: TraceAbstraction took 35412.71ms. Allocated memory was 102.8MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 40.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-02 20:55:12,667 INFO L158 Benchmark]: Witness Printer took 81.08ms. Allocated memory is still 1.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:55:12,670 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.69ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 45.5MB in the beginning and 75.8MB in the end (delta: -30.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.78ms. Allocated memory is still 102.8MB. Free memory was 75.3MB in the beginning and 72.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.38ms. Allocated memory is still 102.8MB. Free memory was 72.7MB in the beginning and 70.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 965.96ms. Allocated memory is still 102.8MB. Free memory was 70.6MB in the beginning and 41.7MB in the end (delta: 28.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 35412.71ms. Allocated memory was 102.8MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 40.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 81.08ms. Allocated memory is still 1.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 678 locations, 74 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 35.1s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 140 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 140 mSDsluCounter, 286 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 192 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 769 IncrementalHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 286 mSDtfsCounter, 769 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1126occurred in iteration=30, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 3861 NumberOfCodeBlocks, 3861 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 3828 ConstructedInterpolants, 0 QuantifiedInterpolants, 5284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 44 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:55:12,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f339ee5a-3d2d-4c18-a7ed-29d0b8550c1d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE