./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4aba10c-9bc7-4c55-8906-dabe091bed04/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4aba10c-9bc7-4c55-8906-dabe091bed04/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_c4aba10c-9bc7-4c55-8906-dabe091bed04/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4aba10c-9bc7-4c55-8906-dabe091bed04/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4aba10c-9bc7-4c55-8906-dabe091bed04/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_c4aba10c-9bc7-4c55-8906-dabe091bed04/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 c902137dd689344b33e1214981c74c26e47854ade5db7e5e71980f90fd07d90c --- 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:07:20,903 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:07:20,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:07:20,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:07:20,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:07:20,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:07:20,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:07:20,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:07:20,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:07:20,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:07:20,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:07:21,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:07:21,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:07:21,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:07:21,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:07:21,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:07:21,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:07:21,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:07:21,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:07:21,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:07:21,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:07:21,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:07:21,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:07:21,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:07:21,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:07:21,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:07:21,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:07:21,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:07:21,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:07:21,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:07:21,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:07:21,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:07:21,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:07:21,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:07:21,059 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:07:21,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:07:21,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:07:21,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:07:21,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:07:21,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:07:21,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:07:21,064 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4aba10c-9bc7-4c55-8906-dabe091bed04/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:07:21,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:07:21,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:07:21,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:07:21,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:07:21,120 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:07:21,120 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:07:21,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:07:21,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:07:21,122 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:07:21,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:07:21,124 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:07:21,125 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:07:21,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:07:21,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:07:21,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:07:21,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:07:21,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:07:21,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:07:21,127 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:07:21,135 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:07:21,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:07:21,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:07:21,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:07:21,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:07:21,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:07:21,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:07:21,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:07:21,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:07:21,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:07:21,138 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:07:21,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:07:21,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:07:21,139 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:07:21,140 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:07:21,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:07:21,140 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_c4aba10c-9bc7-4c55-8906-dabe091bed04/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_c4aba10c-9bc7-4c55-8906-dabe091bed04/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 -> c902137dd689344b33e1214981c74c26e47854ade5db7e5e71980f90fd07d90c [2022-11-02 20:07:21,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:07:21,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:07:21,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:07:21,563 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:07:21,566 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:07:21,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4aba10c-9bc7-4c55-8906-dabe091bed04/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2022-11-02 20:07:21,657 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4aba10c-9bc7-4c55-8906-dabe091bed04/bin/uautomizer-Dbtcem3rbc/data/145920159/f2daed8436fb441ca3a222df0bb13eb5/FLAG0cc857279 [2022-11-02 20:07:22,316 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:07:22,316 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4aba10c-9bc7-4c55-8906-dabe091bed04/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2022-11-02 20:07:22,332 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4aba10c-9bc7-4c55-8906-dabe091bed04/bin/uautomizer-Dbtcem3rbc/data/145920159/f2daed8436fb441ca3a222df0bb13eb5/FLAG0cc857279 [2022-11-02 20:07:22,681 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4aba10c-9bc7-4c55-8906-dabe091bed04/bin/uautomizer-Dbtcem3rbc/data/145920159/f2daed8436fb441ca3a222df0bb13eb5 [2022-11-02 20:07:22,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:07:22,686 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:07:22,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:07:22,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:07:22,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:07:22,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:07:22" (1/1) ... [2022-11-02 20:07:22,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f94b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:22, skipping insertion in model container [2022-11-02 20:07:22,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:07:22" (1/1) ... [2022-11-02 20:07:22,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:07:22,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:07:23,120 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_c4aba10c-9bc7-4c55-8906-dabe091bed04/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c[2947,2960] [2022-11-02 20:07:23,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:07:23,153 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:07:23,211 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_c4aba10c-9bc7-4c55-8906-dabe091bed04/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c[2947,2960] [2022-11-02 20:07:23,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:07:23,233 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:07:23,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:23 WrapperNode [2022-11-02 20:07:23,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:07:23,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:07:23,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:07:23,236 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:07:23,245 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:07:23" (1/1) ... [2022-11-02 20:07:23,275 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:07:23" (1/1) ... [2022-11-02 20:07:23,322 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 281 [2022-11-02 20:07:23,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:07:23,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:07:23,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:07:23,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:07:23,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:23" (1/1) ... [2022-11-02 20:07:23,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:23" (1/1) ... [2022-11-02 20:07:23,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:23" (1/1) ... [2022-11-02 20:07:23,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:23" (1/1) ... [2022-11-02 20:07:23,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:23" (1/1) ... [2022-11-02 20:07:23,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:23" (1/1) ... [2022-11-02 20:07:23,401 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:23" (1/1) ... [2022-11-02 20:07:23,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:23" (1/1) ... [2022-11-02 20:07:23,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:07:23,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:07:23,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:07:23,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:07:23,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:23" (1/1) ... [2022-11-02 20:07:23,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:07:23,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4aba10c-9bc7-4c55-8906-dabe091bed04/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:07:23,469 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4aba10c-9bc7-4c55-8906-dabe091bed04/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:07:23,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4aba10c-9bc7-4c55-8906-dabe091bed04/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:07:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:07:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:07:23,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:07:23,540 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:07:23,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:07:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:07:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:07:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:07:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:07:23,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:07:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:07:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:07:23,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:07:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:07:23,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:07:23,547 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:07:23,749 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:07:23,751 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:07:24,388 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:07:24,645 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:07:24,645 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:07:24,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:07:24 BoogieIcfgContainer [2022-11-02 20:07:24,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:07:24,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:07:24,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:07:24,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:07:24,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:07:22" (1/3) ... [2022-11-02 20:07:24,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef20cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:07:24, skipping insertion in model container [2022-11-02 20:07:24,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:07:23" (2/3) ... [2022-11-02 20:07:24,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef20cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:07:24, skipping insertion in model container [2022-11-02 20:07:24,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:07:24" (3/3) ... [2022-11-02 20:07:24,660 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2022-11-02 20:07:24,685 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:07:24,699 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:07:24,700 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2022-11-02 20:07:24,700 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:07:24,865 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-02 20:07:24,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 265 transitions, 546 flow [2022-11-02 20:07:25,038 INFO L130 PetriNetUnfolder]: 13/263 cut-off events. [2022-11-02 20:07:25,039 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:07:25,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 263 events. 13/263 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 428 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 187. Up to 2 conditions per place. [2022-11-02 20:07:25,058 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 265 transitions, 546 flow [2022-11-02 20:07:25,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 242 transitions, 496 flow [2022-11-02 20:07:25,095 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:07:25,109 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;@f108727, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:07:25,109 INFO L358 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2022-11-02 20:07:25,130 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-11-02 20:07:25,130 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:07:25,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:07:25,132 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] [2022-11-02 20:07:25,133 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-02 20:07:25,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:25,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1386209113, now seen corresponding path program 1 times [2022-11-02 20:07:25,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:25,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673576164] [2022-11-02 20:07:25,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:25,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:25,493 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:07:25,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:25,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673576164] [2022-11-02 20:07:25,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673576164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:25,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:25,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:07:25,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019393978] [2022-11-02 20:07:25,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:25,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:07:25,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:25,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:07:25,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:07:25,585 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 265 [2022-11-02 20:07:25,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 242 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states 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:07:25,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:25,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 265 [2022-11-02 20:07:25,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:26,026 INFO L130 PetriNetUnfolder]: 133/756 cut-off events. [2022-11-02 20:07:26,027 INFO L131 PetriNetUnfolder]: For 39/76 co-relation queries the response was YES. [2022-11-02 20:07:26,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 756 events. 133/756 cut-off events. For 39/76 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3766 event pairs, 84 based on Foata normal form. 48/679 useless extension candidates. Maximal degree in co-relation 850. Up to 241 conditions per place. [2022-11-02 20:07:26,072 INFO L137 encePairwiseOnDemand]: 239/265 looper letters, 32 selfloop transitions, 2 changer transitions 2/218 dead transitions. [2022-11-02 20:07:26,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 218 transitions, 516 flow [2022-11-02 20:07:26,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:07:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:07:26,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2022-11-02 20:07:26,100 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8465408805031447 [2022-11-02 20:07:26,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 673 transitions. [2022-11-02 20:07:26,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 673 transitions. [2022-11-02 20:07:26,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:07:26,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 673 transitions. [2022-11-02 20:07:26,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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:07:26,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:26,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:26,133 INFO L175 Difference]: Start difference. First operand has 238 places, 242 transitions, 496 flow. Second operand 3 states and 673 transitions. [2022-11-02 20:07:26,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 218 transitions, 516 flow [2022-11-02 20:07:26,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 218 transitions, 508 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:07:26,147 INFO L231 Difference]: Finished difference. Result has 218 places, 216 transitions, 440 flow [2022-11-02 20:07:26,150 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=218, PETRI_TRANSITIONS=216} [2022-11-02 20:07:26,155 INFO L287 CegarLoopForPetriNet]: 238 programPoint places, -20 predicate places. [2022-11-02 20:07:26,156 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 440 flow [2022-11-02 20:07:26,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states 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:07:26,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:07:26,157 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] [2022-11-02 20:07:26,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:07:26,158 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-02 20:07:26,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:26,160 INFO L85 PathProgramCache]: Analyzing trace with hash 934886058, now seen corresponding path program 1 times [2022-11-02 20:07:26,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:26,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568811419] [2022-11-02 20:07:26,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:26,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:26,290 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:07:26,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:26,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568811419] [2022-11-02 20:07:26,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568811419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:26,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:26,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:07:26,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414971880] [2022-11-02 20:07:26,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:26,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:07:26,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:26,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:07:26,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:07:26,302 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 265 [2022-11-02 20:07:26,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 216 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states 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:07:26,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:26,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 265 [2022-11-02 20:07:26,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:26,570 INFO L130 PetriNetUnfolder]: 105/687 cut-off events. [2022-11-02 20:07:26,571 INFO L131 PetriNetUnfolder]: For 8/39 co-relation queries the response was YES. [2022-11-02 20:07:26,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 687 events. 105/687 cut-off events. For 8/39 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3262 event pairs, 49 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 858. Up to 145 conditions per place. [2022-11-02 20:07:26,577 INFO L137 encePairwiseOnDemand]: 257/265 looper letters, 29 selfloop transitions, 3 changer transitions 0/217 dead transitions. [2022-11-02 20:07:26,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 217 transitions, 507 flow [2022-11-02 20:07:26,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:07:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:07:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2022-11-02 20:07:26,583 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8314465408805032 [2022-11-02 20:07:26,584 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 661 transitions. [2022-11-02 20:07:26,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 661 transitions. [2022-11-02 20:07:26,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:07:26,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 661 transitions. [2022-11-02 20:07:26,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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:07:26,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:26,591 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:26,592 INFO L175 Difference]: Start difference. First operand has 218 places, 216 transitions, 440 flow. Second operand 3 states and 661 transitions. [2022-11-02 20:07:26,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 217 transitions, 507 flow [2022-11-02 20:07:26,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 217 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:07:26,607 INFO L231 Difference]: Finished difference. Result has 211 places, 211 transitions, 432 flow [2022-11-02 20:07:26,607 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=211, PETRI_TRANSITIONS=211} [2022-11-02 20:07:26,609 INFO L287 CegarLoopForPetriNet]: 238 programPoint places, -27 predicate places. [2022-11-02 20:07:26,610 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 211 transitions, 432 flow [2022-11-02 20:07:26,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states 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:07:26,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:07:26,611 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] [2022-11-02 20:07:26,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:07:26,612 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-02 20:07:26,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash -283225401, now seen corresponding path program 1 times [2022-11-02 20:07:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:26,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187796075] [2022-11-02 20:07:26,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:26,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:26,727 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:07:26,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:26,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187796075] [2022-11-02 20:07:26,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187796075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:26,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:26,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:07:26,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528258610] [2022-11-02 20:07:26,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:26,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:07:26,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:26,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:07:26,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:07:26,737 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 265 [2022-11-02 20:07:26,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 211 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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:07:26,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:26,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 265 [2022-11-02 20:07:26,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:26,911 INFO L130 PetriNetUnfolder]: 28/532 cut-off events. [2022-11-02 20:07:26,912 INFO L131 PetriNetUnfolder]: For 13/32 co-relation queries the response was YES. [2022-11-02 20:07:26,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 532 events. 28/532 cut-off events. For 13/32 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2179 event pairs, 9 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 453. Up to 43 conditions per place. [2022-11-02 20:07:26,920 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 14 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2022-11-02 20:07:26,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 210 transitions, 462 flow [2022-11-02 20:07:26,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:07:26,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:07:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2022-11-02 20:07:26,926 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8628930817610063 [2022-11-02 20:07:26,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 686 transitions. [2022-11-02 20:07:26,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 686 transitions. [2022-11-02 20:07:26,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:07:26,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 686 transitions. [2022-11-02 20:07:26,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 0 states 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:07:26,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:26,934 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:26,935 INFO L175 Difference]: Start difference. First operand has 211 places, 211 transitions, 432 flow. Second operand 3 states and 686 transitions. [2022-11-02 20:07:26,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 210 transitions, 462 flow [2022-11-02 20:07:26,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 210 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:07:26,943 INFO L231 Difference]: Finished difference. Result has 210 places, 210 transitions, 428 flow [2022-11-02 20:07:26,944 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=210, PETRI_TRANSITIONS=210} [2022-11-02 20:07:26,947 INFO L287 CegarLoopForPetriNet]: 238 programPoint places, -28 predicate places. [2022-11-02 20:07:26,947 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 210 transitions, 428 flow [2022-11-02 20:07:26,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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:07:26,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:07:26,949 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:07:26,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:07:26,949 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-02 20:07:26,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:26,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1096917963, now seen corresponding path program 1 times [2022-11-02 20:07:26,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:26,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000069854] [2022-11-02 20:07:26,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:26,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:27,056 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:07:27,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:27,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000069854] [2022-11-02 20:07:27,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000069854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:27,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:27,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:07:27,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092567703] [2022-11-02 20:07:27,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:27,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:07:27,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:27,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:07:27,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:07:27,064 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 265 [2022-11-02 20:07:27,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 210 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states 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:07:27,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:27,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 265 [2022-11-02 20:07:27,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:27,245 INFO L130 PetriNetUnfolder]: 49/576 cut-off events. [2022-11-02 20:07:27,246 INFO L131 PetriNetUnfolder]: For 7/26 co-relation queries the response was YES. [2022-11-02 20:07:27,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 576 events. 49/576 cut-off events. For 7/26 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2532 event pairs, 24 based on Foata normal form. 0/495 useless extension candidates. Maximal degree in co-relation 633. Up to 85 conditions per place. [2022-11-02 20:07:27,252 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 20 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2022-11-02 20:07:27,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 209 transitions, 470 flow [2022-11-02 20:07:27,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:07:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:07:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2022-11-02 20:07:27,256 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8477987421383648 [2022-11-02 20:07:27,256 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 674 transitions. [2022-11-02 20:07:27,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 674 transitions. [2022-11-02 20:07:27,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:07:27,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 674 transitions. [2022-11-02 20:07:27,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states 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:07:27,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:27,267 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:27,268 INFO L175 Difference]: Start difference. First operand has 210 places, 210 transitions, 428 flow. Second operand 3 states and 674 transitions. [2022-11-02 20:07:27,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 209 transitions, 470 flow [2022-11-02 20:07:27,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 209 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:07:27,273 INFO L231 Difference]: Finished difference. Result has 209 places, 209 transitions, 426 flow [2022-11-02 20:07:27,280 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=209, PETRI_TRANSITIONS=209} [2022-11-02 20:07:27,282 INFO L287 CegarLoopForPetriNet]: 238 programPoint places, -29 predicate places. [2022-11-02 20:07:27,282 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 209 transitions, 426 flow [2022-11-02 20:07:27,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states 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:07:27,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:07:27,284 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] [2022-11-02 20:07:27,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:07:27,284 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-02 20:07:27,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1375121806, now seen corresponding path program 1 times [2022-11-02 20:07:27,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:27,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979051847] [2022-11-02 20:07:27,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:27,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:27,371 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:07:27,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:27,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979051847] [2022-11-02 20:07:27,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979051847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:27,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:27,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:07:27,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157022760] [2022-11-02 20:07:27,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:27,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:07:27,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:27,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:07:27,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:07:27,376 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 265 [2022-11-02 20:07:27,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 209 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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:07:27,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:27,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 265 [2022-11-02 20:07:27,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:27,533 INFO L130 PetriNetUnfolder]: 42/555 cut-off events. [2022-11-02 20:07:27,533 INFO L131 PetriNetUnfolder]: For 8/27 co-relation queries the response was YES. [2022-11-02 20:07:27,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 555 events. 42/555 cut-off events. For 8/27 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2359 event pairs, 19 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 586. Up to 67 conditions per place. [2022-11-02 20:07:27,539 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 16 selfloop transitions, 1 changer transitions 0/207 dead transitions. [2022-11-02 20:07:27,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 207 transitions, 456 flow [2022-11-02 20:07:27,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:07:27,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:07:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2022-11-02 20:07:27,543 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8540880503144654 [2022-11-02 20:07:27,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2022-11-02 20:07:27,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2022-11-02 20:07:27,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:07:27,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2022-11-02 20:07:27,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states 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:07:27,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:27,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:27,550 INFO L175 Difference]: Start difference. First operand has 209 places, 209 transitions, 426 flow. Second operand 3 states and 679 transitions. [2022-11-02 20:07:27,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 207 transitions, 456 flow [2022-11-02 20:07:27,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 207 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:07:27,556 INFO L231 Difference]: Finished difference. Result has 207 places, 207 transitions, 420 flow [2022-11-02 20:07:27,557 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=207, PETRI_TRANSITIONS=207} [2022-11-02 20:07:27,561 INFO L287 CegarLoopForPetriNet]: 238 programPoint places, -31 predicate places. [2022-11-02 20:07:27,561 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 207 transitions, 420 flow [2022-11-02 20:07:27,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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:07:27,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:07:27,563 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] [2022-11-02 20:07:27,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:07:27,563 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-02 20:07:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:27,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1573740915, now seen corresponding path program 1 times [2022-11-02 20:07:27,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:27,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475318793] [2022-11-02 20:07:27,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:27,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:27,702 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:07:27,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:27,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475318793] [2022-11-02 20:07:27,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475318793] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:27,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:27,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:07:27,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891561070] [2022-11-02 20:07:27,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:27,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:07:27,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:27,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:07:27,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:07:27,710 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 265 [2022-11-02 20:07:27,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 207 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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:07:27,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:27,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 265 [2022-11-02 20:07:27,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:27,874 INFO L130 PetriNetUnfolder]: 49/593 cut-off events. [2022-11-02 20:07:27,874 INFO L131 PetriNetUnfolder]: For 7/26 co-relation queries the response was YES. [2022-11-02 20:07:27,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 593 events. 49/593 cut-off events. For 7/26 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2601 event pairs, 24 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 639. Up to 82 conditions per place. [2022-11-02 20:07:27,880 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 17 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2022-11-02 20:07:27,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 206 transitions, 456 flow [2022-11-02 20:07:27,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:07:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:07:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 680 transitions. [2022-11-02 20:07:27,883 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8553459119496856 [2022-11-02 20:07:27,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 680 transitions. [2022-11-02 20:07:27,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 680 transitions. [2022-11-02 20:07:27,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:07:27,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 680 transitions. [2022-11-02 20:07:27,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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:07:27,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:27,890 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:27,890 INFO L175 Difference]: Start difference. First operand has 207 places, 207 transitions, 420 flow. Second operand 3 states and 680 transitions. [2022-11-02 20:07:27,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 206 transitions, 456 flow [2022-11-02 20:07:27,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 206 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:07:27,896 INFO L231 Difference]: Finished difference. Result has 207 places, 206 transitions, 421 flow [2022-11-02 20:07:27,896 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=421, PETRI_PLACES=207, PETRI_TRANSITIONS=206} [2022-11-02 20:07:27,900 INFO L287 CegarLoopForPetriNet]: 238 programPoint places, -31 predicate places. [2022-11-02 20:07:27,901 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 206 transitions, 421 flow [2022-11-02 20:07:27,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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:07:27,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:07:27,903 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] [2022-11-02 20:07:27,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:07:27,904 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-02 20:07:27,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:27,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1222548057, now seen corresponding path program 1 times [2022-11-02 20:07:27,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:27,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125187312] [2022-11-02 20:07:27,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:27,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:28,633 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:07:28,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:28,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125187312] [2022-11-02 20:07:28,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125187312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:28,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:28,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:07:28,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869996266] [2022-11-02 20:07:28,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:28,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:07:28,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:28,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:07:28,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:07:28,646 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 265 [2022-11-02 20:07:28,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 206 transitions, 421 flow. Second operand has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states 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:07:28,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:28,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 265 [2022-11-02 20:07:28,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:29,267 INFO L130 PetriNetUnfolder]: 635/2394 cut-off events. [2022-11-02 20:07:29,267 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:07:29,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 2394 events. 635/2394 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 17357 event pairs, 465 based on Foata normal form. 0/2029 useless extension candidates. Maximal degree in co-relation 3330. Up to 963 conditions per place. [2022-11-02 20:07:29,328 INFO L137 encePairwiseOnDemand]: 259/265 looper letters, 40 selfloop transitions, 5 changer transitions 0/205 dead transitions. [2022-11-02 20:07:29,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 205 transitions, 509 flow [2022-11-02 20:07:29,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:07:29,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:07:29,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1210 transitions. [2022-11-02 20:07:29,335 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7610062893081762 [2022-11-02 20:07:29,335 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1210 transitions. [2022-11-02 20:07:29,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1210 transitions. [2022-11-02 20:07:29,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:07:29,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1210 transitions. [2022-11-02 20:07:29,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 201.66666666666666) internal successors, (1210), 6 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states 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:07:29,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states 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:07:29,347 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states 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:07:29,347 INFO L175 Difference]: Start difference. First operand has 207 places, 206 transitions, 421 flow. Second operand 6 states and 1210 transitions. [2022-11-02 20:07:29,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 205 transitions, 509 flow [2022-11-02 20:07:29,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 205 transitions, 505 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:07:29,354 INFO L231 Difference]: Finished difference. Result has 209 places, 205 transitions, 425 flow [2022-11-02 20:07:29,355 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=209, PETRI_TRANSITIONS=205} [2022-11-02 20:07:29,356 INFO L287 CegarLoopForPetriNet]: 238 programPoint places, -29 predicate places. [2022-11-02 20:07:29,356 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 205 transitions, 425 flow [2022-11-02 20:07:29,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states 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:07:29,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:07:29,358 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] [2022-11-02 20:07:29,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:07:29,358 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-02 20:07:29,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:29,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1280849672, now seen corresponding path program 1 times [2022-11-02 20:07:29,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:29,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795208730] [2022-11-02 20:07:29,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:29,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:29,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:07:29,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:29,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795208730] [2022-11-02 20:07:29,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795208730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:29,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:29,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:07:29,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606429989] [2022-11-02 20:07:29,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:29,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:07:29,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:29,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:07:29,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:07:29,919 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2022-11-02 20:07:29,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 205 transitions, 425 flow. Second operand has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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:07:29,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:29,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2022-11-02 20:07:29,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:30,583 INFO L130 PetriNetUnfolder]: 635/1599 cut-off events. [2022-11-02 20:07:30,583 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-02 20:07:30,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2576 conditions, 1599 events. 635/1599 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8855 event pairs, 102 based on Foata normal form. 0/1440 useless extension candidates. Maximal degree in co-relation 2553. Up to 335 conditions per place. [2022-11-02 20:07:30,598 INFO L137 encePairwiseOnDemand]: 260/265 looper letters, 85 selfloop transitions, 4 changer transitions 0/256 dead transitions. [2022-11-02 20:07:30,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 256 transitions, 705 flow [2022-11-02 20:07:30,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:07:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:07:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1284 transitions. [2022-11-02 20:07:30,603 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8075471698113208 [2022-11-02 20:07:30,603 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1284 transitions. [2022-11-02 20:07:30,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1284 transitions. [2022-11-02 20:07:30,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:07:30,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1284 transitions. [2022-11-02 20:07:30,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states 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:07:30,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states 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:07:30,642 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states 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:07:30,643 INFO L175 Difference]: Start difference. First operand has 209 places, 205 transitions, 425 flow. Second operand 6 states and 1284 transitions. [2022-11-02 20:07:30,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 256 transitions, 705 flow [2022-11-02 20:07:30,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 256 transitions, 695 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:07:30,649 INFO L231 Difference]: Finished difference. Result has 208 places, 204 transitions, 421 flow [2022-11-02 20:07:30,650 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=208, PETRI_TRANSITIONS=204} [2022-11-02 20:07:30,651 INFO L287 CegarLoopForPetriNet]: 238 programPoint places, -30 predicate places. [2022-11-02 20:07:30,651 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 204 transitions, 421 flow [2022-11-02 20:07:30,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states 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:07:30,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:07:30,652 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:07:30,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:07:30,653 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-02 20:07:30,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:30,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1955881516, now seen corresponding path program 1 times [2022-11-02 20:07:30,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:30,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534076395] [2022-11-02 20:07:30,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:30,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:30,703 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:07:30,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:30,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534076395] [2022-11-02 20:07:30,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534076395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:30,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:30,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:07:30,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902851803] [2022-11-02 20:07:30,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:30,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:07:30,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:30,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:07:30,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:07:30,707 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 265 [2022-11-02 20:07:30,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 204 transitions, 421 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states 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:07:30,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:30,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 265 [2022-11-02 20:07:30,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:30,847 INFO L130 PetriNetUnfolder]: 51/623 cut-off events. [2022-11-02 20:07:30,848 INFO L131 PetriNetUnfolder]: For 10/27 co-relation queries the response was YES. [2022-11-02 20:07:30,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 623 events. 51/623 cut-off events. For 10/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2728 event pairs, 7 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 675. Up to 70 conditions per place. [2022-11-02 20:07:30,854 INFO L137 encePairwiseOnDemand]: 261/265 looper letters, 20 selfloop transitions, 3 changer transitions 0/211 dead transitions. [2022-11-02 20:07:30,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 211 transitions, 484 flow [2022-11-02 20:07:30,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:07:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:07:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2022-11-02 20:07:30,857 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8716981132075472 [2022-11-02 20:07:30,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 693 transitions. [2022-11-02 20:07:30,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 693 transitions. [2022-11-02 20:07:30,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:07:30,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 693 transitions. [2022-11-02 20:07:30,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states 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:07:30,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:30,863 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:30,863 INFO L175 Difference]: Start difference. First operand has 208 places, 204 transitions, 421 flow. Second operand 3 states and 693 transitions. [2022-11-02 20:07:30,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 211 transitions, 484 flow [2022-11-02 20:07:30,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 211 transitions, 477 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:07:30,869 INFO L231 Difference]: Finished difference. Result has 206 places, 206 transitions, 433 flow [2022-11-02 20:07:30,870 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=206, PETRI_TRANSITIONS=206} [2022-11-02 20:07:30,871 INFO L287 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2022-11-02 20:07:30,871 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 206 transitions, 433 flow [2022-11-02 20:07:30,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states 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:07:30,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:07:30,872 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] [2022-11-02 20:07:30,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:07:30,873 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-02 20:07:30,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:30,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1872926674, now seen corresponding path program 1 times [2022-11-02 20:07:30,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:30,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949452203] [2022-11-02 20:07:30,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:30,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:31,362 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:07:31,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:31,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949452203] [2022-11-02 20:07:31,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949452203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:31,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:31,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:07:31,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349914562] [2022-11-02 20:07:31,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:31,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:07:31,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:31,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:07:31,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:07:31,375 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 265 [2022-11-02 20:07:31,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 206 transitions, 433 flow. Second operand has 6 states, 6 states have (on average 197.33333333333334) internal successors, (1184), 6 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states 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:07:31,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:31,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 265 [2022-11-02 20:07:31,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:32,115 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([817] L52-4-->L52-5: Formula: (= (select (select |v_#memory_int_1| v_~queue~0.base_1) (+ v_~queue~0.offset_1 (* v_~front~0_4 4))) |v_thread1Thread1of1ForFork1_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} OutVars{#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2#1][149], [Black: 300#true, 302#(= |#race~queue~0| 0), 102#L52-5true, 296#(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)), 280#(= |#race~n~0| 0), 305#true, 232#L68true]) [2022-11-02 20:07:32,115 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-02 20:07:32,115 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-02 20:07:32,116 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-02 20:07:32,116 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-02 20:07:32,120 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L77-->L79: Formula: (let ((.cse5 (* v_~back~0_143 4))) (let ((.cse2 (+ 2 .cse5 v_~queue~0.offset_74)) (.cse4 (+ 3 .cse5 v_~queue~0.offset_74)) (.cse1 (+ .cse5 v_~queue~0.offset_74)) (.cse0 (select |v_#race_149| v_~queue~0.base_74)) (.cse3 (+ .cse5 v_~queue~0.offset_74 1))) (and (= |v_#race~back~0_146| 0) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= |v_#race_149| (store |v_#race_150| v_~queue~0.base_74 (store (store (store (store (select |v_#race_150| v_~queue~0.base_74) .cse1 0) .cse3 0) .cse2 0) .cse4 0))) (= |v_#race~queue~0_39| 0) (= (select .cse0 .cse4) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (ite (= (+ (select (select |v_#memory_int_36| v_~queue~0.base_74) .cse1) 1) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= (select .cse0 .cse3) 0)))) InVars {#race=|v_#race_150|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, ~queue~0.offset=v_~queue~0.offset_74, ~queue~0.base=v_~queue~0.base_74} OutVars{#race=|v_#race_149|, ~queue~0.offset=v_~queue~0.offset_74, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~queue~0=|v_#race~queue~0_39|, thread2Thread1of1ForFork0_#t~mem12#1=|v_thread2Thread1of1ForFork0_#t~mem12#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, #race~back~0=|v_#race~back~0_146|, ~queue~0.base=v_~queue~0.base_74} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][150], [Black: 300#true, 172#L52-1true, 302#(= |#race~queue~0| 0), 280#(= |#race~n~0| 0), 238#L79true, 296#(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)), 305#true]) [2022-11-02 20:07:32,121 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-02 20:07:32,121 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-02 20:07:32,121 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-02 20:07:32,121 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-02 20:07:32,122 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([874] L70-->L72: Formula: (let ((.cse5 (* v_~back~0_147 4))) (let ((.cse3 (+ 2 .cse5 v_~queue~0.offset_78)) (.cse2 (+ 3 .cse5 v_~queue~0.offset_78)) (.cse1 (+ .cse5 v_~queue~0.offset_78)) (.cse0 (select |v_#race_157| v_~queue~0.base_78)) (.cse4 (+ .cse5 v_~queue~0.offset_78 1))) (and (= |v_#race~back~0_150| 0) (= |v_#race~queue~0_43| 0) (= (select .cse0 .cse1) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= 0 (select .cse0 .cse2)) (= (select .cse0 .cse3) 0) (= |v_#race_157| (store |v_#race_158| v_~queue~0.base_78 (store (store (store (store (select |v_#race_158| v_~queue~0.base_78) .cse1 0) .cse4 0) .cse3 0) .cse2 0))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_40| v_~queue~0.base_78) .cse1) 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (select .cse0 .cse4) 0)))) InVars {#race=|v_#race_158|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_78, ~queue~0.base=v_~queue~0.base_78} OutVars{#race=|v_#race_157|, ~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #race~queue~0=|v_#race~queue~0_43|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, #race~back~0=|v_#race~back~0_150|, ~queue~0.base=v_~queue~0.base_78} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][151], [Black: 300#true, 172#L52-1true, 199#L72true, 302#(= |#race~queue~0| 0), 280#(= |#race~n~0| 0), 296#(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)), 305#true]) [2022-11-02 20:07:32,122 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-02 20:07:32,123 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-02 20:07:32,123 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-02 20:07:32,123 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-02 20:07:32,124 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([817] L52-4-->L52-5: Formula: (= (select (select |v_#memory_int_1| v_~queue~0.base_1) (+ v_~queue~0.offset_1 (* v_~front~0_4 4))) |v_thread1Thread1of1ForFork1_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} OutVars{#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2#1][149], [Black: 300#true, 302#(= |#race~queue~0| 0), 7#L101-4true, 102#L52-5true, 280#(= |#race~n~0| 0), 305#true, 232#L68true]) [2022-11-02 20:07:32,124 INFO L383 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-11-02 20:07:32,124 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-02 20:07:32,125 INFO L386 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-11-02 20:07:32,125 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-02 20:07:32,139 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L77-->L79: Formula: (let ((.cse5 (* v_~back~0_143 4))) (let ((.cse2 (+ 2 .cse5 v_~queue~0.offset_74)) (.cse4 (+ 3 .cse5 v_~queue~0.offset_74)) (.cse1 (+ .cse5 v_~queue~0.offset_74)) (.cse0 (select |v_#race_149| v_~queue~0.base_74)) (.cse3 (+ .cse5 v_~queue~0.offset_74 1))) (and (= |v_#race~back~0_146| 0) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= |v_#race_149| (store |v_#race_150| v_~queue~0.base_74 (store (store (store (store (select |v_#race_150| v_~queue~0.base_74) .cse1 0) .cse3 0) .cse2 0) .cse4 0))) (= |v_#race~queue~0_39| 0) (= (select .cse0 .cse4) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (ite (= (+ (select (select |v_#memory_int_36| v_~queue~0.base_74) .cse1) 1) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= (select .cse0 .cse3) 0)))) InVars {#race=|v_#race_150|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, ~queue~0.offset=v_~queue~0.offset_74, ~queue~0.base=v_~queue~0.base_74} OutVars{#race=|v_#race_149|, ~queue~0.offset=v_~queue~0.offset_74, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~queue~0=|v_#race~queue~0_39|, thread2Thread1of1ForFork0_#t~mem12#1=|v_thread2Thread1of1ForFork0_#t~mem12#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, #race~back~0=|v_#race~back~0_146|, ~queue~0.base=v_~queue~0.base_74} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][150], [Black: 300#true, 172#L52-1true, 302#(= |#race~queue~0| 0), 7#L101-4true, 238#L79true, 280#(= |#race~n~0| 0), 305#true]) [2022-11-02 20:07:32,139 INFO L383 tUnfolder$Statistics]: this new event has 117 ancestors and is cut-off event [2022-11-02 20:07:32,139 INFO L386 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-11-02 20:07:32,140 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-02 20:07:32,140 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-02 20:07:32,141 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([874] L70-->L72: Formula: (let ((.cse5 (* v_~back~0_147 4))) (let ((.cse3 (+ 2 .cse5 v_~queue~0.offset_78)) (.cse2 (+ 3 .cse5 v_~queue~0.offset_78)) (.cse1 (+ .cse5 v_~queue~0.offset_78)) (.cse0 (select |v_#race_157| v_~queue~0.base_78)) (.cse4 (+ .cse5 v_~queue~0.offset_78 1))) (and (= |v_#race~back~0_150| 0) (= |v_#race~queue~0_43| 0) (= (select .cse0 .cse1) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= 0 (select .cse0 .cse2)) (= (select .cse0 .cse3) 0) (= |v_#race_157| (store |v_#race_158| v_~queue~0.base_78 (store (store (store (store (select |v_#race_158| v_~queue~0.base_78) .cse1 0) .cse4 0) .cse3 0) .cse2 0))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_40| v_~queue~0.base_78) .cse1) 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (select .cse0 .cse4) 0)))) InVars {#race=|v_#race_158|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_78, ~queue~0.base=v_~queue~0.base_78} OutVars{#race=|v_#race_157|, ~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #race~queue~0=|v_#race~queue~0_43|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, #race~back~0=|v_#race~back~0_150|, ~queue~0.base=v_~queue~0.base_78} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][151], [Black: 300#true, 172#L52-1true, 199#L72true, 302#(= |#race~queue~0| 0), 7#L101-4true, 280#(= |#race~n~0| 0), 305#true]) [2022-11-02 20:07:32,141 INFO L383 tUnfolder$Statistics]: this new event has 117 ancestors and is cut-off event [2022-11-02 20:07:32,141 INFO L386 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-11-02 20:07:32,141 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-02 20:07:32,141 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-02 20:07:32,142 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([817] L52-4-->L52-5: Formula: (= (select (select |v_#memory_int_1| v_~queue~0.base_1) (+ v_~queue~0.offset_1 (* v_~front~0_4 4))) |v_thread1Thread1of1ForFork1_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} OutVars{#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2#1][149], [Black: 300#true, 298#(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)), 302#(= |#race~queue~0| 0), 102#L52-5true, 280#(= |#race~n~0| 0), 305#true, 55#L101-5true, 232#L68true]) [2022-11-02 20:07:32,143 INFO L383 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-11-02 20:07:32,143 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-02 20:07:32,143 INFO L386 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-11-02 20:07:32,143 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-02 20:07:32,160 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L77-->L79: Formula: (let ((.cse5 (* v_~back~0_143 4))) (let ((.cse2 (+ 2 .cse5 v_~queue~0.offset_74)) (.cse4 (+ 3 .cse5 v_~queue~0.offset_74)) (.cse1 (+ .cse5 v_~queue~0.offset_74)) (.cse0 (select |v_#race_149| v_~queue~0.base_74)) (.cse3 (+ .cse5 v_~queue~0.offset_74 1))) (and (= |v_#race~back~0_146| 0) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= |v_#race_149| (store |v_#race_150| v_~queue~0.base_74 (store (store (store (store (select |v_#race_150| v_~queue~0.base_74) .cse1 0) .cse3 0) .cse2 0) .cse4 0))) (= |v_#race~queue~0_39| 0) (= (select .cse0 .cse4) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (ite (= (+ (select (select |v_#memory_int_36| v_~queue~0.base_74) .cse1) 1) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= (select .cse0 .cse3) 0)))) InVars {#race=|v_#race_150|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, ~queue~0.offset=v_~queue~0.offset_74, ~queue~0.base=v_~queue~0.base_74} OutVars{#race=|v_#race_149|, ~queue~0.offset=v_~queue~0.offset_74, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~queue~0=|v_#race~queue~0_39|, thread2Thread1of1ForFork0_#t~mem12#1=|v_thread2Thread1of1ForFork0_#t~mem12#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, #race~back~0=|v_#race~back~0_146|, ~queue~0.base=v_~queue~0.base_74} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][150], [Black: 300#true, 298#(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)), 172#L52-1true, 302#(= |#race~queue~0| 0), 280#(= |#race~n~0| 0), 238#L79true, 305#true, 55#L101-5true]) [2022-11-02 20:07:32,160 INFO L383 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-11-02 20:07:32,160 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-02 20:07:32,160 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-02 20:07:32,161 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-02 20:07:32,161 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([874] L70-->L72: Formula: (let ((.cse5 (* v_~back~0_147 4))) (let ((.cse3 (+ 2 .cse5 v_~queue~0.offset_78)) (.cse2 (+ 3 .cse5 v_~queue~0.offset_78)) (.cse1 (+ .cse5 v_~queue~0.offset_78)) (.cse0 (select |v_#race_157| v_~queue~0.base_78)) (.cse4 (+ .cse5 v_~queue~0.offset_78 1))) (and (= |v_#race~back~0_150| 0) (= |v_#race~queue~0_43| 0) (= (select .cse0 .cse1) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= 0 (select .cse0 .cse2)) (= (select .cse0 .cse3) 0) (= |v_#race_157| (store |v_#race_158| v_~queue~0.base_78 (store (store (store (store (select |v_#race_158| v_~queue~0.base_78) .cse1 0) .cse4 0) .cse3 0) .cse2 0))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_40| v_~queue~0.base_78) .cse1) 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (select .cse0 .cse4) 0)))) InVars {#race=|v_#race_158|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_78, ~queue~0.base=v_~queue~0.base_78} OutVars{#race=|v_#race_157|, ~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #race~queue~0=|v_#race~queue~0_43|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, #race~back~0=|v_#race~back~0_150|, ~queue~0.base=v_~queue~0.base_78} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][151], [Black: 300#true, 298#(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)), 172#L52-1true, 199#L72true, 302#(= |#race~queue~0| 0), 280#(= |#race~n~0| 0), 305#true, 55#L101-5true]) [2022-11-02 20:07:32,162 INFO L383 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-11-02 20:07:32,162 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-02 20:07:32,162 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-02 20:07:32,162 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-02 20:07:32,163 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([817] L52-4-->L52-5: Formula: (= (select (select |v_#memory_int_1| v_~queue~0.base_1) (+ v_~queue~0.offset_1 (* v_~front~0_4 4))) |v_thread1Thread1of1ForFork1_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} OutVars{#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2#1][149], [Black: 300#true, 298#(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)), 302#(= |#race~queue~0| 0), 102#L52-5true, 280#(= |#race~n~0| 0), 305#true, 256#L101-6true, 232#L68true]) [2022-11-02 20:07:32,163 INFO L383 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-11-02 20:07:32,164 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-02 20:07:32,164 INFO L386 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-11-02 20:07:32,164 INFO L386 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-11-02 20:07:32,165 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L77-->L79: Formula: (let ((.cse5 (* v_~back~0_143 4))) (let ((.cse2 (+ 2 .cse5 v_~queue~0.offset_74)) (.cse4 (+ 3 .cse5 v_~queue~0.offset_74)) (.cse1 (+ .cse5 v_~queue~0.offset_74)) (.cse0 (select |v_#race_149| v_~queue~0.base_74)) (.cse3 (+ .cse5 v_~queue~0.offset_74 1))) (and (= |v_#race~back~0_146| 0) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= |v_#race_149| (store |v_#race_150| v_~queue~0.base_74 (store (store (store (store (select |v_#race_150| v_~queue~0.base_74) .cse1 0) .cse3 0) .cse2 0) .cse4 0))) (= |v_#race~queue~0_39| 0) (= (select .cse0 .cse4) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (ite (= (+ (select (select |v_#memory_int_36| v_~queue~0.base_74) .cse1) 1) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= (select .cse0 .cse3) 0)))) InVars {#race=|v_#race_150|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, ~queue~0.offset=v_~queue~0.offset_74, ~queue~0.base=v_~queue~0.base_74} OutVars{#race=|v_#race_149|, ~queue~0.offset=v_~queue~0.offset_74, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~queue~0=|v_#race~queue~0_39|, thread2Thread1of1ForFork0_#t~mem12#1=|v_thread2Thread1of1ForFork0_#t~mem12#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, #race~back~0=|v_#race~back~0_146|, ~queue~0.base=v_~queue~0.base_74} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][150], [Black: 300#true, 298#(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)), 172#L52-1true, 302#(= |#race~queue~0| 0), 238#L79true, 280#(= |#race~n~0| 0), 305#true, 256#L101-6true]) [2022-11-02 20:07:32,165 INFO L383 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-11-02 20:07:32,165 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-02 20:07:32,165 INFO L386 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-11-02 20:07:32,166 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-02 20:07:32,166 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([874] L70-->L72: Formula: (let ((.cse5 (* v_~back~0_147 4))) (let ((.cse3 (+ 2 .cse5 v_~queue~0.offset_78)) (.cse2 (+ 3 .cse5 v_~queue~0.offset_78)) (.cse1 (+ .cse5 v_~queue~0.offset_78)) (.cse0 (select |v_#race_157| v_~queue~0.base_78)) (.cse4 (+ .cse5 v_~queue~0.offset_78 1))) (and (= |v_#race~back~0_150| 0) (= |v_#race~queue~0_43| 0) (= (select .cse0 .cse1) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= 0 (select .cse0 .cse2)) (= (select .cse0 .cse3) 0) (= |v_#race_157| (store |v_#race_158| v_~queue~0.base_78 (store (store (store (store (select |v_#race_158| v_~queue~0.base_78) .cse1 0) .cse4 0) .cse3 0) .cse2 0))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_40| v_~queue~0.base_78) .cse1) 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (select .cse0 .cse4) 0)))) InVars {#race=|v_#race_158|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_78, ~queue~0.base=v_~queue~0.base_78} OutVars{#race=|v_#race_157|, ~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #race~queue~0=|v_#race~queue~0_43|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, #race~back~0=|v_#race~back~0_150|, ~queue~0.base=v_~queue~0.base_78} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][151], [Black: 300#true, 298#(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)), 172#L52-1true, 199#L72true, 302#(= |#race~queue~0| 0), 280#(= |#race~n~0| 0), 305#true, 256#L101-6true]) [2022-11-02 20:07:32,167 INFO L383 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-11-02 20:07:32,167 INFO L386 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-11-02 20:07:32,167 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-02 20:07:32,167 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-02 20:07:32,467 INFO L130 PetriNetUnfolder]: 988/3016 cut-off events. [2022-11-02 20:07:32,467 INFO L131 PetriNetUnfolder]: For 263/357 co-relation queries the response was YES. [2022-11-02 20:07:32,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4914 conditions, 3016 events. 988/3016 cut-off events. For 263/357 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 21309 event pairs, 332 based on Foata normal form. 0/2657 useless extension candidates. Maximal degree in co-relation 4864. Up to 901 conditions per place. [2022-11-02 20:07:32,495 INFO L137 encePairwiseOnDemand]: 259/265 looper letters, 83 selfloop transitions, 5 changer transitions 0/249 dead transitions. [2022-11-02 20:07:32,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 249 transitions, 719 flow [2022-11-02 20:07:32,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:07:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:07:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1257 transitions. [2022-11-02 20:07:32,502 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7905660377358491 [2022-11-02 20:07:32,502 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1257 transitions. [2022-11-02 20:07:32,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1257 transitions. [2022-11-02 20:07:32,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:07:32,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1257 transitions. [2022-11-02 20:07:32,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states 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:07:32,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states 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:07:32,515 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states 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:07:32,516 INFO L175 Difference]: Start difference. First operand has 206 places, 206 transitions, 433 flow. Second operand 6 states and 1257 transitions. [2022-11-02 20:07:32,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 249 transitions, 719 flow [2022-11-02 20:07:32,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 249 transitions, 719 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:07:32,525 INFO L231 Difference]: Finished difference. Result has 210 places, 205 transitions, 441 flow [2022-11-02 20:07:32,526 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=441, PETRI_PLACES=210, PETRI_TRANSITIONS=205} [2022-11-02 20:07:32,527 INFO L287 CegarLoopForPetriNet]: 238 programPoint places, -28 predicate places. [2022-11-02 20:07:32,527 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 205 transitions, 441 flow [2022-11-02 20:07:32,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.33333333333334) internal successors, (1184), 6 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states 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:07:32,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:07:32,529 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:07:32,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:07:32,529 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-02 20:07:32,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:32,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1398280772, now seen corresponding path program 1 times [2022-11-02 20:07:32,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:32,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29025536] [2022-11-02 20:07:32,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:32,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:33,186 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:07:33,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:33,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29025536] [2022-11-02 20:07:33,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29025536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:33,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:33,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:07:33,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874420530] [2022-11-02 20:07:33,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:33,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:07:33,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:33,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:07:33,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:07:33,192 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2022-11-02 20:07:33,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 205 transitions, 441 flow. Second operand has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states 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:07:33,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:33,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2022-11-02 20:07:33,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:33,900 INFO L130 PetriNetUnfolder]: 616/2429 cut-off events. [2022-11-02 20:07:33,901 INFO L131 PetriNetUnfolder]: For 255/407 co-relation queries the response was YES. [2022-11-02 20:07:33,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3815 conditions, 2429 events. 616/2429 cut-off events. For 255/407 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 17402 event pairs, 311 based on Foata normal form. 0/2122 useless extension candidates. Maximal degree in co-relation 3766. Up to 838 conditions per place. [2022-11-02 20:07:33,925 INFO L137 encePairwiseOnDemand]: 260/265 looper letters, 61 selfloop transitions, 4 changer transitions 0/232 dead transitions. [2022-11-02 20:07:33,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 232 transitions, 665 flow [2022-11-02 20:07:33,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:07:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:07:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1250 transitions. [2022-11-02 20:07:33,931 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7861635220125787 [2022-11-02 20:07:33,931 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1250 transitions. [2022-11-02 20:07:33,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1250 transitions. [2022-11-02 20:07:33,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:07:33,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1250 transitions. [2022-11-02 20:07:33,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 208.33333333333334) internal successors, (1250), 6 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states 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:07:33,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states 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:07:33,942 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states 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:07:33,942 INFO L175 Difference]: Start difference. First operand has 210 places, 205 transitions, 441 flow. Second operand 6 states and 1250 transitions. [2022-11-02 20:07:33,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 232 transitions, 665 flow [2022-11-02 20:07:33,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 232 transitions, 655 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:07:33,950 INFO L231 Difference]: Finished difference. Result has 209 places, 204 transitions, 437 flow [2022-11-02 20:07:33,951 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=437, PETRI_PLACES=209, PETRI_TRANSITIONS=204} [2022-11-02 20:07:33,952 INFO L287 CegarLoopForPetriNet]: 238 programPoint places, -29 predicate places. [2022-11-02 20:07:33,952 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 204 transitions, 437 flow [2022-11-02 20:07:33,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states 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:07:33,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:07:33,953 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:07:33,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:07:33,954 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-02 20:07:33,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:33,955 INFO L85 PathProgramCache]: Analyzing trace with hash 731875413, now seen corresponding path program 1 times [2022-11-02 20:07:33,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:33,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313481105] [2022-11-02 20:07:33,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:33,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:34,035 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:07:34,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:34,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313481105] [2022-11-02 20:07:34,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313481105] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:34,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:34,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:07:34,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092872586] [2022-11-02 20:07:34,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:34,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:07:34,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:34,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:07:34,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:07:34,040 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 265 [2022-11-02 20:07:34,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 204 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states 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:07:34,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:34,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 265 [2022-11-02 20:07:34,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:34,212 INFO L130 PetriNetUnfolder]: 92/678 cut-off events. [2022-11-02 20:07:34,212 INFO L131 PetriNetUnfolder]: For 40/64 co-relation queries the response was YES. [2022-11-02 20:07:34,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 678 events. 92/678 cut-off events. For 40/64 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3034 event pairs, 27 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 863. Up to 124 conditions per place. [2022-11-02 20:07:34,219 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 24 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2022-11-02 20:07:34,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 209 transitions, 504 flow [2022-11-02 20:07:34,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:07:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:07:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2022-11-02 20:07:34,223 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8654088050314466 [2022-11-02 20:07:34,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 688 transitions. [2022-11-02 20:07:34,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 688 transitions. [2022-11-02 20:07:34,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:07:34,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 688 transitions. [2022-11-02 20:07:34,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states 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:07:34,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:34,229 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:34,229 INFO L175 Difference]: Start difference. First operand has 209 places, 204 transitions, 437 flow. Second operand 3 states and 688 transitions. [2022-11-02 20:07:34,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 209 transitions, 504 flow [2022-11-02 20:07:34,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 209 transitions, 497 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:07:34,236 INFO L231 Difference]: Finished difference. Result has 206 places, 203 transitions, 432 flow [2022-11-02 20:07:34,236 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=206, PETRI_TRANSITIONS=203} [2022-11-02 20:07:34,237 INFO L287 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2022-11-02 20:07:34,237 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 203 transitions, 432 flow [2022-11-02 20:07:34,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states 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:07:34,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:07:34,239 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] [2022-11-02 20:07:34,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:07:34,239 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-02 20:07:34,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:34,240 INFO L85 PathProgramCache]: Analyzing trace with hash -113345370, now seen corresponding path program 1 times [2022-11-02 20:07:34,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:34,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166277192] [2022-11-02 20:07:34,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:34,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:34,304 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:07:34,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:34,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166277192] [2022-11-02 20:07:34,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166277192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:34,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:34,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:07:34,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392522908] [2022-11-02 20:07:34,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:34,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:07:34,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:34,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:07:34,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:07:34,308 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 265 [2022-11-02 20:07:34,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 203 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states 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:07:34,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:34,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 265 [2022-11-02 20:07:34,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:34,465 INFO L130 PetriNetUnfolder]: 78/639 cut-off events. [2022-11-02 20:07:34,466 INFO L131 PetriNetUnfolder]: For 36/60 co-relation queries the response was YES. [2022-11-02 20:07:34,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 639 events. 78/639 cut-off events. For 36/60 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2800 event pairs, 21 based on Foata normal form. 2/583 useless extension candidates. Maximal degree in co-relation 793. Up to 97 conditions per place. [2022-11-02 20:07:34,472 INFO L137 encePairwiseOnDemand]: 259/265 looper letters, 20 selfloop transitions, 2 changer transitions 15/206 dead transitions. [2022-11-02 20:07:34,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 206 transitions, 497 flow [2022-11-02 20:07:34,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:07:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:07:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2022-11-02 20:07:34,476 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8540880503144654 [2022-11-02 20:07:34,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2022-11-02 20:07:34,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2022-11-02 20:07:34,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:07:34,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2022-11-02 20:07:34,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states 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:07:34,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:34,482 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:34,482 INFO L175 Difference]: Start difference. First operand has 206 places, 203 transitions, 432 flow. Second operand 3 states and 679 transitions. [2022-11-02 20:07:34,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 206 transitions, 497 flow [2022-11-02 20:07:34,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 206 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:07:34,488 INFO L231 Difference]: Finished difference. Result has 203 places, 185 transitions, 393 flow [2022-11-02 20:07:34,489 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=203, PETRI_TRANSITIONS=185} [2022-11-02 20:07:34,490 INFO L287 CegarLoopForPetriNet]: 238 programPoint places, -35 predicate places. [2022-11-02 20:07:34,490 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 185 transitions, 393 flow [2022-11-02 20:07:34,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states 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:07:34,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:07:34,491 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] [2022-11-02 20:07:34,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:07:34,492 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-02 20:07:34,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:34,492 INFO L85 PathProgramCache]: Analyzing trace with hash -303010293, now seen corresponding path program 1 times [2022-11-02 20:07:34,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:34,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046852791] [2022-11-02 20:07:34,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:34,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:34,552 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:07:34,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:34,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046852791] [2022-11-02 20:07:34,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046852791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:34,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:34,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:07:34,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908672934] [2022-11-02 20:07:34,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:34,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:07:34,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:34,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:07:34,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:07:34,557 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 265 [2022-11-02 20:07:34,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 185 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states 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:07:34,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:34,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 265 [2022-11-02 20:07:34,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:34,752 INFO L130 PetriNetUnfolder]: 133/691 cut-off events. [2022-11-02 20:07:34,752 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-11-02 20:07:34,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 691 events. 133/691 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3032 event pairs, 53 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 971. Up to 202 conditions per place. [2022-11-02 20:07:34,759 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 31 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2022-11-02 20:07:34,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 190 transitions, 474 flow [2022-11-02 20:07:34,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:07:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:07:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2022-11-02 20:07:34,762 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8176100628930818 [2022-11-02 20:07:34,763 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 650 transitions. [2022-11-02 20:07:34,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 650 transitions. [2022-11-02 20:07:34,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:07:34,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 650 transitions. [2022-11-02 20:07:34,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states 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:07:34,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:34,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:34,769 INFO L175 Difference]: Start difference. First operand has 203 places, 185 transitions, 393 flow. Second operand 3 states and 650 transitions. [2022-11-02 20:07:34,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 190 transitions, 474 flow [2022-11-02 20:07:34,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 190 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:07:34,774 INFO L231 Difference]: Finished difference. Result has 186 places, 184 transitions, 391 flow [2022-11-02 20:07:34,775 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2022-11-02 20:07:34,776 INFO L287 CegarLoopForPetriNet]: 238 programPoint places, -52 predicate places. [2022-11-02 20:07:34,776 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 391 flow [2022-11-02 20:07:34,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states 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:07:34,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:07:34,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:07:34,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:07:34,777 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-02 20:07:34,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:34,778 INFO L85 PathProgramCache]: Analyzing trace with hash -345096208, now seen corresponding path program 1 times [2022-11-02 20:07:34,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:34,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434578328] [2022-11-02 20:07:34,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:34,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:34,867 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:07:34,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:34,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434578328] [2022-11-02 20:07:34,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434578328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:34,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:34,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:07:34,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261578775] [2022-11-02 20:07:34,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:34,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:07:34,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:34,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:07:34,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:07:34,872 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 265 [2022-11-02 20:07:34,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states 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:07:34,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:34,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 265 [2022-11-02 20:07:34,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:35,041 INFO L130 PetriNetUnfolder]: 72/730 cut-off events. [2022-11-02 20:07:35,042 INFO L131 PetriNetUnfolder]: For 24/28 co-relation queries the response was YES. [2022-11-02 20:07:35,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 730 events. 72/730 cut-off events. For 24/28 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2996 event pairs, 12 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 855. Up to 64 conditions per place. [2022-11-02 20:07:35,049 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 20 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2022-11-02 20:07:35,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 190 transitions, 452 flow [2022-11-02 20:07:35,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:07:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:07:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2022-11-02 20:07:35,052 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8679245283018868 [2022-11-02 20:07:35,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 690 transitions. [2022-11-02 20:07:35,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 690 transitions. [2022-11-02 20:07:35,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:07:35,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 690 transitions. [2022-11-02 20:07:35,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states 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:07:35,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:35,058 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:35,058 INFO L175 Difference]: Start difference. First operand has 186 places, 184 transitions, 391 flow. Second operand 3 states and 690 transitions. [2022-11-02 20:07:35,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 190 transitions, 452 flow [2022-11-02 20:07:35,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 190 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:07:35,063 INFO L231 Difference]: Finished difference. Result has 186 places, 184 transitions, 395 flow [2022-11-02 20:07:35,064 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2022-11-02 20:07:35,065 INFO L287 CegarLoopForPetriNet]: 238 programPoint places, -52 predicate places. [2022-11-02 20:07:35,065 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 395 flow [2022-11-02 20:07:35,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states 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:07:35,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:07:35,066 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] [2022-11-02 20:07:35,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:07:35,066 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-02 20:07:35,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:07:35,067 INFO L85 PathProgramCache]: Analyzing trace with hash 185153395, now seen corresponding path program 1 times [2022-11-02 20:07:35,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:07:35,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440862960] [2022-11-02 20:07:35,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:07:35,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:07:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:07:35,123 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:07:35,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:07:35,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440862960] [2022-11-02 20:07:35,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440862960] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:07:35,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:07:35,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:07:35,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563139350] [2022-11-02 20:07:35,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:07:35,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:07:35,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:07:35,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:07:35,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:07:35,128 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 265 [2022-11-02 20:07:35,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states 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:07:35,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:07:35,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 265 [2022-11-02 20:07:35,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:07:35,296 INFO L130 PetriNetUnfolder]: 86/738 cut-off events. [2022-11-02 20:07:35,296 INFO L131 PetriNetUnfolder]: For 34/38 co-relation queries the response was YES. [2022-11-02 20:07:35,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 738 events. 86/738 cut-off events. For 34/38 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2956 event pairs, 21 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 901. Up to 100 conditions per place. [2022-11-02 20:07:35,302 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 0 selfloop transitions, 0 changer transitions 189/189 dead transitions. [2022-11-02 20:07:35,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 189 transitions, 456 flow [2022-11-02 20:07:35,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:07:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:07:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2022-11-02 20:07:35,305 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8389937106918239 [2022-11-02 20:07:35,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 667 transitions. [2022-11-02 20:07:35,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 667 transitions. [2022-11-02 20:07:35,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:07:35,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 667 transitions. [2022-11-02 20:07:35,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states 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:07:35,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:35,310 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states 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:07:35,310 INFO L175 Difference]: Start difference. First operand has 186 places, 184 transitions, 395 flow. Second operand 3 states and 667 transitions. [2022-11-02 20:07:35,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 189 transitions, 456 flow [2022-11-02 20:07:35,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 189 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:07:35,314 INFO L231 Difference]: Finished difference. Result has 186 places, 0 transitions, 0 flow [2022-11-02 20:07:35,315 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=186, PETRI_TRANSITIONS=0} [2022-11-02 20:07:35,316 INFO L287 CegarLoopForPetriNet]: 238 programPoint places, -52 predicate places. [2022-11-02 20:07:35,316 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 0 transitions, 0 flow [2022-11-02 20:07:35,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states 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:07:35,320 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2022-11-02 20:07:35,320 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2022-11-02 20:07:35,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2022-11-02 20:07:35,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2022-11-02 20:07:35,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2022-11-02 20:07:35,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2022-11-02 20:07:35,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2022-11-02 20:07:35,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2022-11-02 20:07:35,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2022-11-02 20:07:35,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2022-11-02 20:07:35,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2022-11-02 20:07:35,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2022-11-02 20:07:35,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2022-11-02 20:07:35,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2022-11-02 20:07:35,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2022-11-02 20:07:35,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2022-11-02 20:07:35,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2022-11-02 20:07:35,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2022-11-02 20:07:35,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2022-11-02 20:07:35,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2022-11-02 20:07:35,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2022-11-02 20:07:35,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2022-11-02 20:07:35,326 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2022-11-02 20:07:35,326 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2022-11-02 20:07:35,326 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2022-11-02 20:07:35,326 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2022-11-02 20:07:35,326 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2022-11-02 20:07:35,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2022-11-02 20:07:35,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2022-11-02 20:07:35,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2022-11-02 20:07:35,327 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2022-11-02 20:07:35,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2022-11-02 20:07:35,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2022-11-02 20:07:35,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2022-11-02 20:07:35,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2022-11-02 20:07:35,329 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2022-11-02 20:07:35,329 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2022-11-02 20:07:35,329 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2022-11-02 20:07:35,329 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2022-11-02 20:07:35,330 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2022-11-02 20:07:35,330 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 71 remaining) [2022-11-02 20:07:35,330 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2022-11-02 20:07:35,330 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 71 remaining) [2022-11-02 20:07:35,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (27 of 71 remaining) [2022-11-02 20:07:35,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2022-11-02 20:07:35,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2022-11-02 20:07:35,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2022-11-02 20:07:35,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2022-11-02 20:07:35,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2022-11-02 20:07:35,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2022-11-02 20:07:35,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2022-11-02 20:07:35,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2022-11-02 20:07:35,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2022-11-02 20:07:35,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2022-11-02 20:07:35,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2022-11-02 20:07:35,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2022-11-02 20:07:35,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2022-11-02 20:07:35,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2022-11-02 20:07:35,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2022-11-02 20:07:35,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2022-11-02 20:07:35,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2022-11-02 20:07:35,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2022-11-02 20:07:35,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2022-11-02 20:07:35,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2022-11-02 20:07:35,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2022-11-02 20:07:35,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2022-11-02 20:07:35,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2022-11-02 20:07:35,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2022-11-02 20:07:35,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2022-11-02 20:07:35,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2022-11-02 20:07:35,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2022-11-02 20:07:35,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:07:35,338 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:07:35,345 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:07:35,345 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:07:35,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:07:35 BasicIcfg [2022-11-02 20:07:35,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:07:35,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:07:35,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:07:35,353 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:07:35,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:07:24" (3/4) ... [2022-11-02 20:07:35,357 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:07:35,364 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:07:35,364 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:07:35,373 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-02 20:07:35,373 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:07:35,374 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:07:35,374 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:07:35,420 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4aba10c-9bc7-4c55-8906-dabe091bed04/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:07:35,421 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:07:35,422 INFO L158 Benchmark]: Toolchain (without parser) took 12735.85ms. Allocated memory was 94.4MB in the beginning and 312.5MB in the end (delta: 218.1MB). Free memory was 51.7MB in the beginning and 129.3MB in the end (delta: -77.6MB). Peak memory consumption was 140.0MB. Max. memory is 16.1GB. [2022-11-02 20:07:35,422 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 94.4MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:07:35,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 540.22ms. Allocated memory is still 94.4MB. Free memory was 51.5MB in the beginning and 67.4MB in the end (delta: -15.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:07:35,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.34ms. Allocated memory is still 94.4MB. Free memory was 67.1MB in the beginning and 64.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:07:35,423 INFO L158 Benchmark]: Boogie Preprocessor took 88.55ms. Allocated memory is still 94.4MB. Free memory was 64.3MB in the beginning and 62.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:07:35,424 INFO L158 Benchmark]: RCFGBuilder took 1224.92ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 61.9MB in the beginning and 79.1MB in the end (delta: -17.2MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2022-11-02 20:07:35,424 INFO L158 Benchmark]: TraceAbstraction took 10699.90ms. Allocated memory was 115.3MB in the beginning and 312.5MB in the end (delta: 197.1MB). Free memory was 78.5MB in the beginning and 132.5MB in the end (delta: -54.0MB). Peak memory consumption was 141.7MB. Max. memory is 16.1GB. [2022-11-02 20:07:35,425 INFO L158 Benchmark]: Witness Printer took 68.70ms. Allocated memory is still 312.5MB. Free memory was 132.5MB in the beginning and 129.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:07:35,427 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.41ms. Allocated memory is still 94.4MB. Free memory is still 68.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 540.22ms. Allocated memory is still 94.4MB. Free memory was 51.5MB in the beginning and 67.4MB in the end (delta: -15.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.34ms. Allocated memory is still 94.4MB. Free memory was 67.1MB in the beginning and 64.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.55ms. Allocated memory is still 94.4MB. Free memory was 64.3MB in the beginning and 62.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1224.92ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 61.9MB in the beginning and 79.1MB in the end (delta: -17.2MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10699.90ms. Allocated memory was 115.3MB in the beginning and 312.5MB in the end (delta: 197.1MB). Free memory was 78.5MB in the beginning and 132.5MB in the end (delta: -54.0MB). Peak memory consumption was 141.7MB. Max. memory is 16.1GB. * Witness Printer took 68.70ms. Allocated memory is still 312.5MB. Free memory was 132.5MB in the beginning and 129.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: 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: 67]: 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: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: 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: 78]: 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 355 locations, 71 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: 10.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 189 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 220 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 189 mSDtfsCounter, 1012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=496occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1280 NumberOfCodeBlocks, 1280 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1264 ConstructedInterpolants, 0 QuantifiedInterpolants, 1680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 40 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:07:35,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c4aba10c-9bc7-4c55-8906-dabe091bed04/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