./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-commit-1.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_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/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_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/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_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/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 4b2db95108d1ec3739bf941ab9d238fd5c3dd7467faa747c6c0552ae2048ee95 --- 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 21:07:37,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:07:37,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:07:37,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:07:37,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:07:37,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:07:37,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:07:37,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:07:37,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:07:37,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:07:37,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:07:37,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:07:37,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:07:37,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:07:37,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:07:37,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:07:37,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:07:37,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:07:37,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:07:37,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:07:37,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:07:37,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:07:37,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:07:37,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:07:37,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:07:37,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:07:37,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:07:37,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:07:37,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:07:37,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:07:37,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:07:37,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:07:37,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:07:37,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:07:37,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:07:37,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:07:37,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:07:37,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:07:37,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:07:37,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:07:37,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:07:37,081 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 21:07:37,105 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:07:37,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:07:37,106 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:07:37,106 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:07:37,107 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:07:37,107 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:07:37,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:07:37,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:07:37,109 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:07:37,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:07:37,109 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:07:37,110 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:07:37,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:07:37,110 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:07:37,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:07:37,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:07:37,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:07:37,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:07:37,112 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 21:07:37,112 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:07:37,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:07:37,113 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:07:37,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:07:37,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:07:37,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:07:37,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:07:37,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:07:37,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:07:37,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:07:37,115 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:07:37,116 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:07:37,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:07:37,116 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:07:37,117 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:07:37,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:07:37,117 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_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/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_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/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 -> 4b2db95108d1ec3739bf941ab9d238fd5c3dd7467faa747c6c0552ae2048ee95 [2022-11-02 21:07:37,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:07:37,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:07:37,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:07:37,471 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:07:37,472 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:07:37,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2022-11-02 21:07:37,565 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/bin/uautomizer-Dbtcem3rbc/data/961ba44bf/ef5fbe284a8e464ea1818927b1ede1fb/FLAGa4e2dfb40 [2022-11-02 21:07:38,120 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:07:38,120 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2022-11-02 21:07:38,129 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/bin/uautomizer-Dbtcem3rbc/data/961ba44bf/ef5fbe284a8e464ea1818927b1ede1fb/FLAGa4e2dfb40 [2022-11-02 21:07:38,470 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/bin/uautomizer-Dbtcem3rbc/data/961ba44bf/ef5fbe284a8e464ea1818927b1ede1fb [2022-11-02 21:07:38,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:07:38,474 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:07:38,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:07:38,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:07:38,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:07:38,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:07:38" (1/1) ... [2022-11-02 21:07:38,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd1ff9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:38, skipping insertion in model container [2022-11-02 21:07:38,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:07:38" (1/1) ... [2022-11-02 21:07:38,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:07:38,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:07:38,874 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_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/sv-benchmarks/c/weaver/popl20-commit-1.wvr.c[4604,4617] [2022-11-02 21:07:38,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:07:38,898 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:07:38,944 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_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/sv-benchmarks/c/weaver/popl20-commit-1.wvr.c[4604,4617] [2022-11-02 21:07:38,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:07:38,966 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:07:38,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:38 WrapperNode [2022-11-02 21:07:38,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:07:38,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:07:38,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:07:38,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:07:38,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:38" (1/1) ... [2022-11-02 21:07:38,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:38" (1/1) ... [2022-11-02 21:07:39,039 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 715 [2022-11-02 21:07:39,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:07:39,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:07:39,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:07:39,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:07:39,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:38" (1/1) ... [2022-11-02 21:07:39,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:38" (1/1) ... [2022-11-02 21:07:39,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:38" (1/1) ... [2022-11-02 21:07:39,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:38" (1/1) ... [2022-11-02 21:07:39,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:38" (1/1) ... [2022-11-02 21:07:39,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:38" (1/1) ... [2022-11-02 21:07:39,122 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:38" (1/1) ... [2022-11-02 21:07:39,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:38" (1/1) ... [2022-11-02 21:07:39,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:07:39,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:07:39,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:07:39,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:07:39,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:38" (1/1) ... [2022-11-02 21:07:39,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:07:39,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:07:39,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:07:39,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:07:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:07:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:07:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:07:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:07:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 21:07:39,224 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 21:07:39,224 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 21:07:39,225 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 21:07:39,225 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 21:07:39,225 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 21:07:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:07:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 21:07:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 21:07:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:07:39,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:07:39,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:07:39,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:07:39,229 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 21:07:39,436 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:07:39,439 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:07:40,590 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:07:41,570 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:07:41,571 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-02 21:07:41,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:41 BoogieIcfgContainer [2022-11-02 21:07:41,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:07:41,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:07:41,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:07:41,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:07:41,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:07:38" (1/3) ... [2022-11-02 21:07:41,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c31733c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:07:41, skipping insertion in model container [2022-11-02 21:07:41,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:07:38" (2/3) ... [2022-11-02 21:07:41,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c31733c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:07:41, skipping insertion in model container [2022-11-02 21:07:41,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:41" (3/3) ... [2022-11-02 21:07:41,591 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2022-11-02 21:07:41,608 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 21:07:41,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:07:41,620 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 116 error locations. [2022-11-02 21:07:41,620 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 21:07:41,893 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 21:07:41,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 470 places, 479 transitions, 982 flow [2022-11-02 21:07:42,277 INFO L130 PetriNetUnfolder]: 19/476 cut-off events. [2022-11-02 21:07:42,277 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 21:07:42,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 476 events. 19/476 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 732 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 397. Up to 2 conditions per place. [2022-11-02 21:07:42,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 470 places, 479 transitions, 982 flow [2022-11-02 21:07:42,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 448 places, 456 transitions, 930 flow [2022-11-02 21:07:42,305 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:07:42,312 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;@41091d54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:07:42,313 INFO L358 AbstractCegarLoop]: Starting to check reachability of 207 error locations. [2022-11-02 21:07:42,318 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-11-02 21:07:42,319 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:07:42,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:42,320 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] [2022-11-02 21:07:42,320 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:42,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:42,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1243772581, now seen corresponding path program 1 times [2022-11-02 21:07:42,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:42,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887450471] [2022-11-02 21:07:42,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:42,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:42,567 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 21:07:42,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:42,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887450471] [2022-11-02 21:07:42,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887450471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:42,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:42,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:42,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116972985] [2022-11-02 21:07:42,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:42,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:42,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:42,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:42,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:42,629 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-02 21:07:42,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 456 transitions, 930 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 21:07:42,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:42,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-02 21:07:42,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:43,060 INFO L130 PetriNetUnfolder]: 66/439 cut-off events. [2022-11-02 21:07:43,060 INFO L131 PetriNetUnfolder]: For 37/49 co-relation queries the response was YES. [2022-11-02 21:07:43,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 439 events. 66/439 cut-off events. For 37/49 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 544 event pairs, 31 based on Foata normal form. 41/431 useless extension candidates. Maximal degree in co-relation 372. Up to 104 conditions per place. [2022-11-02 21:07:43,065 INFO L137 encePairwiseOnDemand]: 376/479 looper letters, 19 selfloop transitions, 2 changer transitions 6/355 dead transitions. [2022-11-02 21:07:43,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 355 transitions, 770 flow [2022-11-02 21:07:43,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1184 transitions. [2022-11-02 21:07:43,084 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8239387613082811 [2022-11-02 21:07:43,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1184 transitions. [2022-11-02 21:07:43,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1184 transitions. [2022-11-02 21:07:43,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:43,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1184 transitions. [2022-11-02 21:07:43,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 394.6666666666667) internal successors, (1184), 3 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 21:07:43,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:43,115 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:43,117 INFO L175 Difference]: Start difference. First operand has 448 places, 456 transitions, 930 flow. Second operand 3 states and 1184 transitions. [2022-11-02 21:07:43,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 355 transitions, 770 flow [2022-11-02 21:07:43,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 355 transitions, 758 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 21:07:43,140 INFO L231 Difference]: Finished difference. Result has 355 places, 349 transitions, 708 flow [2022-11-02 21:07:43,143 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=355, PETRI_TRANSITIONS=349} [2022-11-02 21:07:43,147 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -93 predicate places. [2022-11-02 21:07:43,147 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 349 transitions, 708 flow [2022-11-02 21:07:43,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 21:07:43,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:43,149 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] [2022-11-02 21:07:43,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:07:43,150 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:43,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:43,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1255377645, now seen corresponding path program 1 times [2022-11-02 21:07:43,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:43,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130185790] [2022-11-02 21:07:43,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:43,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:43,301 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 21:07:43,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:43,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130185790] [2022-11-02 21:07:43,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130185790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:43,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:43,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:43,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059882652] [2022-11-02 21:07:43,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:43,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:43,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:43,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:43,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:43,309 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-02 21:07:43,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 349 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 21:07:43,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:43,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-02 21:07:43,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:43,574 INFO L130 PetriNetUnfolder]: 66/432 cut-off events. [2022-11-02 21:07:43,574 INFO L131 PetriNetUnfolder]: For 7/19 co-relation queries the response was YES. [2022-11-02 21:07:43,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 432 events. 66/432 cut-off events. For 7/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 532 event pairs, 31 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 515. Up to 105 conditions per place. [2022-11-02 21:07:43,579 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/348 dead transitions. [2022-11-02 21:07:43,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 348 transitions, 750 flow [2022-11-02 21:07:43,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-02 21:07:43,584 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-02 21:07:43,584 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-02 21:07:43,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-02 21:07:43,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:43,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-02 21:07:43,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states 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 21:07:43,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:43,595 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:43,595 INFO L175 Difference]: Start difference. First operand has 355 places, 349 transitions, 708 flow. Second operand 3 states and 1085 transitions. [2022-11-02 21:07:43,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 348 transitions, 750 flow [2022-11-02 21:07:43,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 348 transitions, 746 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:43,609 INFO L231 Difference]: Finished difference. Result has 348 places, 348 transitions, 706 flow [2022-11-02 21:07:43,609 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=348, PETRI_TRANSITIONS=348} [2022-11-02 21:07:43,610 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -100 predicate places. [2022-11-02 21:07:43,611 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 348 transitions, 706 flow [2022-11-02 21:07:43,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 21:07:43,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:43,612 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] [2022-11-02 21:07:43,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:07:43,613 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:43,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1225050503, now seen corresponding path program 1 times [2022-11-02 21:07:43,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:43,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917638447] [2022-11-02 21:07:43,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:43,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:43,729 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 21:07:43,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:43,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917638447] [2022-11-02 21:07:43,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917638447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:43,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:43,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:43,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421263695] [2022-11-02 21:07:43,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:43,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:43,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:43,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:43,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:43,734 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-02 21:07:43,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 348 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 21:07:43,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:43,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-02 21:07:43,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:43,989 INFO L130 PetriNetUnfolder]: 66/431 cut-off events. [2022-11-02 21:07:43,990 INFO L131 PetriNetUnfolder]: For 7/19 co-relation queries the response was YES. [2022-11-02 21:07:43,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 431 events. 66/431 cut-off events. For 7/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 531 event pairs, 31 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 507. Up to 105 conditions per place. [2022-11-02 21:07:43,993 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2022-11-02 21:07:43,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 347 transitions, 748 flow [2022-11-02 21:07:43,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:43,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-02 21:07:43,996 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-02 21:07:43,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-02 21:07:43,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-02 21:07:43,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:43,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-02 21:07:44,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states 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 21:07:44,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:44,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:44,006 INFO L175 Difference]: Start difference. First operand has 348 places, 348 transitions, 706 flow. Second operand 3 states and 1085 transitions. [2022-11-02 21:07:44,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 347 transitions, 748 flow [2022-11-02 21:07:44,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 347 transitions, 744 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:44,014 INFO L231 Difference]: Finished difference. Result has 347 places, 347 transitions, 704 flow [2022-11-02 21:07:44,014 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=704, PETRI_PLACES=347, PETRI_TRANSITIONS=347} [2022-11-02 21:07:44,015 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -101 predicate places. [2022-11-02 21:07:44,016 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 347 transitions, 704 flow [2022-11-02 21:07:44,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 21:07:44,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:44,017 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] [2022-11-02 21:07:44,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:07:44,018 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:44,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:44,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1126040281, now seen corresponding path program 1 times [2022-11-02 21:07:44,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:44,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982836209] [2022-11-02 21:07:44,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:44,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:44,087 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 21:07:44,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:44,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982836209] [2022-11-02 21:07:44,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982836209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:44,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:44,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:44,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037001215] [2022-11-02 21:07:44,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:44,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:44,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:44,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:44,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:44,094 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-02 21:07:44,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 347 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:44,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:44,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-02 21:07:44,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:44,390 INFO L130 PetriNetUnfolder]: 89/558 cut-off events. [2022-11-02 21:07:44,390 INFO L131 PetriNetUnfolder]: For 15/33 co-relation queries the response was YES. [2022-11-02 21:07:44,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 558 events. 89/558 cut-off events. For 15/33 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1201 event pairs, 38 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 662. Up to 107 conditions per place. [2022-11-02 21:07:44,394 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 26 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2022-11-02 21:07:44,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 356 transitions, 783 flow [2022-11-02 21:07:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2022-11-02 21:07:44,398 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7654836464857342 [2022-11-02 21:07:44,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1100 transitions. [2022-11-02 21:07:44,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1100 transitions. [2022-11-02 21:07:44,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:44,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1100 transitions. [2022-11-02 21:07:44,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 366.6666666666667) internal successors, (1100), 3 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:07:44,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:44,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:44,406 INFO L175 Difference]: Start difference. First operand has 347 places, 347 transitions, 704 flow. Second operand 3 states and 1100 transitions. [2022-11-02 21:07:44,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 356 transitions, 783 flow [2022-11-02 21:07:44,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 356 transitions, 779 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:44,414 INFO L231 Difference]: Finished difference. Result has 347 places, 347 transitions, 708 flow [2022-11-02 21:07:44,415 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=347, PETRI_TRANSITIONS=347} [2022-11-02 21:07:44,416 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -101 predicate places. [2022-11-02 21:07:44,416 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 347 transitions, 708 flow [2022-11-02 21:07:44,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:44,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:44,417 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] [2022-11-02 21:07:44,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:07:44,418 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:44,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:44,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1338429894, now seen corresponding path program 1 times [2022-11-02 21:07:44,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:44,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807302061] [2022-11-02 21:07:44,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:44,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:44,503 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 21:07:44,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:44,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807302061] [2022-11-02 21:07:44,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807302061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:44,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:44,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:44,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320195389] [2022-11-02 21:07:44,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:44,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:44,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:44,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:44,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:44,507 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-02 21:07:44,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 347 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:44,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:44,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-02 21:07:44,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:44,793 INFO L130 PetriNetUnfolder]: 89/531 cut-off events. [2022-11-02 21:07:44,793 INFO L131 PetriNetUnfolder]: For 29/44 co-relation queries the response was YES. [2022-11-02 21:07:44,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 531 events. 89/531 cut-off events. For 29/44 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1045 event pairs, 44 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 351. Up to 139 conditions per place. [2022-11-02 21:07:44,797 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 18 selfloop transitions, 2 changer transitions 0/346 dead transitions. [2022-11-02 21:07:44,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 346 transitions, 746 flow [2022-11-02 21:07:44,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-02 21:07:44,800 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-02 21:07:44,800 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-02 21:07:44,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-02 21:07:44,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:44,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-02 21:07:44,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states 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 21:07:44,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:44,809 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:44,810 INFO L175 Difference]: Start difference. First operand has 347 places, 347 transitions, 708 flow. Second operand 3 states and 1091 transitions. [2022-11-02 21:07:44,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 346 transitions, 746 flow [2022-11-02 21:07:44,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 346 transitions, 744 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:07:44,818 INFO L231 Difference]: Finished difference. Result has 347 places, 346 transitions, 708 flow [2022-11-02 21:07:44,819 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=347, PETRI_TRANSITIONS=346} [2022-11-02 21:07:44,822 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -101 predicate places. [2022-11-02 21:07:44,823 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 346 transitions, 708 flow [2022-11-02 21:07:44,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:44,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:44,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:44,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:07:44,825 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:44,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1313483225, now seen corresponding path program 1 times [2022-11-02 21:07:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:44,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986595162] [2022-11-02 21:07:44,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:44,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:44,910 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 21:07:44,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:44,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986595162] [2022-11-02 21:07:44,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986595162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:44,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:44,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:44,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116561910] [2022-11-02 21:07:44,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:44,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:44,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:44,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:44,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:44,914 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-02 21:07:44,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 346 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:44,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:44,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-02 21:07:44,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:45,139 INFO L130 PetriNetUnfolder]: 89/530 cut-off events. [2022-11-02 21:07:45,140 INFO L131 PetriNetUnfolder]: For 28/43 co-relation queries the response was YES. [2022-11-02 21:07:45,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 530 events. 89/530 cut-off events. For 28/43 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1050 event pairs, 44 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 641. Up to 137 conditions per place. [2022-11-02 21:07:45,144 INFO L137 encePairwiseOnDemand]: 477/479 looper letters, 18 selfloop transitions, 1 changer transitions 0/345 dead transitions. [2022-11-02 21:07:45,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 345 transitions, 744 flow [2022-11-02 21:07:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2022-11-02 21:07:45,148 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7585247042449548 [2022-11-02 21:07:45,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1090 transitions. [2022-11-02 21:07:45,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1090 transitions. [2022-11-02 21:07:45,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:45,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1090 transitions. [2022-11-02 21:07:45,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states 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 21:07:45,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:45,157 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:45,157 INFO L175 Difference]: Start difference. First operand has 347 places, 346 transitions, 708 flow. Second operand 3 states and 1090 transitions. [2022-11-02 21:07:45,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 345 transitions, 744 flow [2022-11-02 21:07:45,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 345 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:45,165 INFO L231 Difference]: Finished difference. Result has 346 places, 345 transitions, 704 flow [2022-11-02 21:07:45,166 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=704, PETRI_PLACES=346, PETRI_TRANSITIONS=345} [2022-11-02 21:07:45,166 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -102 predicate places. [2022-11-02 21:07:45,167 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 345 transitions, 704 flow [2022-11-02 21:07:45,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:45,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:45,168 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] [2022-11-02 21:07:45,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:07:45,169 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:45,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:45,169 INFO L85 PathProgramCache]: Analyzing trace with hash 725335898, now seen corresponding path program 1 times [2022-11-02 21:07:45,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:45,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780646634] [2022-11-02 21:07:45,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:45,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:45,248 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 21:07:45,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:45,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780646634] [2022-11-02 21:07:45,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780646634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:45,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:45,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:45,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573859688] [2022-11-02 21:07:45,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:45,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:45,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:45,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:45,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:45,253 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-02 21:07:45,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 345 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:45,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:45,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-02 21:07:45,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:45,492 INFO L130 PetriNetUnfolder]: 89/529 cut-off events. [2022-11-02 21:07:45,492 INFO L131 PetriNetUnfolder]: For 28/43 co-relation queries the response was YES. [2022-11-02 21:07:45,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 529 events. 89/529 cut-off events. For 28/43 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1045 event pairs, 44 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 641. Up to 139 conditions per place. [2022-11-02 21:07:45,496 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 18 selfloop transitions, 2 changer transitions 0/344 dead transitions. [2022-11-02 21:07:45,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 344 transitions, 742 flow [2022-11-02 21:07:45,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-02 21:07:45,500 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-02 21:07:45,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-02 21:07:45,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-02 21:07:45,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:45,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-02 21:07:45,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states 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 21:07:45,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:45,508 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:45,508 INFO L175 Difference]: Start difference. First operand has 346 places, 345 transitions, 704 flow. Second operand 3 states and 1091 transitions. [2022-11-02 21:07:45,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 344 transitions, 742 flow [2022-11-02 21:07:45,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 344 transitions, 741 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:07:45,516 INFO L231 Difference]: Finished difference. Result has 346 places, 344 transitions, 705 flow [2022-11-02 21:07:45,516 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=346, PETRI_TRANSITIONS=344} [2022-11-02 21:07:45,517 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -102 predicate places. [2022-11-02 21:07:45,517 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 344 transitions, 705 flow [2022-11-02 21:07:45,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:45,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:45,519 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] [2022-11-02 21:07:45,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:07:45,519 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:45,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:45,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1967496559, now seen corresponding path program 1 times [2022-11-02 21:07:45,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:45,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89216393] [2022-11-02 21:07:45,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:45,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:46,089 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 21:07:46,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:46,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89216393] [2022-11-02 21:07:46,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89216393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:46,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:46,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:07:46,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686529462] [2022-11-02 21:07:46,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:46,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:07:46,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:46,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:07:46,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:07:46,095 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 479 [2022-11-02 21:07:46,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 344 transitions, 705 flow. Second operand has 6 states, 6 states have (on average 295.8333333333333) internal successors, (1775), 6 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states 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 21:07:46,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:46,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 479 [2022-11-02 21:07:46,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:47,034 INFO L130 PetriNetUnfolder]: 569/1174 cut-off events. [2022-11-02 21:07:47,035 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-11-02 21:07:47,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 1174 events. 569/1174 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3659 event pairs, 320 based on Foata normal form. 0/1106 useless extension candidates. Maximal degree in co-relation 2052. Up to 841 conditions per place. [2022-11-02 21:07:47,043 INFO L137 encePairwiseOnDemand]: 461/479 looper letters, 66 selfloop transitions, 15 changer transitions 0/341 dead transitions. [2022-11-02 21:07:47,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 341 transitions, 861 flow [2022-11-02 21:07:47,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:07:47,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 21:07:47,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1847 transitions. [2022-11-02 21:07:47,048 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6426583159359778 [2022-11-02 21:07:47,052 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1847 transitions. [2022-11-02 21:07:47,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1847 transitions. [2022-11-02 21:07:47,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:47,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1847 transitions. [2022-11-02 21:07:47,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 307.8333333333333) internal successors, (1847), 6 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states 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 21:07:47,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 0 states 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 21:07:47,065 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 0 states 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 21:07:47,066 INFO L175 Difference]: Start difference. First operand has 346 places, 344 transitions, 705 flow. Second operand 6 states and 1847 transitions. [2022-11-02 21:07:47,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 341 transitions, 861 flow [2022-11-02 21:07:47,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 341 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:47,073 INFO L231 Difference]: Finished difference. Result has 346 places, 341 transitions, 725 flow [2022-11-02 21:07:47,074 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=725, PETRI_PLACES=346, PETRI_TRANSITIONS=341} [2022-11-02 21:07:47,077 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -102 predicate places. [2022-11-02 21:07:47,077 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 341 transitions, 725 flow [2022-11-02 21:07:47,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 295.8333333333333) internal successors, (1775), 6 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states 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 21:07:47,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:47,079 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] [2022-11-02 21:07:47,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:07:47,079 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:47,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:47,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1775996735, now seen corresponding path program 1 times [2022-11-02 21:07:47,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:47,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969337538] [2022-11-02 21:07:47,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:47,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,138 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 21:07:47,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:47,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969337538] [2022-11-02 21:07:47,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969337538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:47,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:47,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:47,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371565507] [2022-11-02 21:07:47,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:47,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:47,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:47,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:47,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:47,142 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-02 21:07:47,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 341 transitions, 725 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 21:07:47,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:47,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-02 21:07:47,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:47,402 INFO L130 PetriNetUnfolder]: 89/525 cut-off events. [2022-11-02 21:07:47,402 INFO L131 PetriNetUnfolder]: For 28/43 co-relation queries the response was YES. [2022-11-02 21:07:47,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 525 events. 89/525 cut-off events. For 28/43 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1026 event pairs, 44 based on Foata normal form. 0/481 useless extension candidates. Maximal degree in co-relation 670. Up to 142 conditions per place. [2022-11-02 21:07:47,406 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 21 selfloop transitions, 2 changer transitions 0/340 dead transitions. [2022-11-02 21:07:47,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 340 transitions, 769 flow [2022-11-02 21:07:47,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-02 21:07:47,409 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-02 21:07:47,410 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-02 21:07:47,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-02 21:07:47,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:47,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-02 21:07:47,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states 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 21:07:47,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:47,418 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:47,418 INFO L175 Difference]: Start difference. First operand has 346 places, 341 transitions, 725 flow. Second operand 3 states and 1085 transitions. [2022-11-02 21:07:47,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 340 transitions, 769 flow [2022-11-02 21:07:47,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 340 transitions, 739 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 21:07:47,426 INFO L231 Difference]: Finished difference. Result has 342 places, 340 transitions, 697 flow [2022-11-02 21:07:47,426 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=342, PETRI_TRANSITIONS=340} [2022-11-02 21:07:47,427 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -106 predicate places. [2022-11-02 21:07:47,427 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 340 transitions, 697 flow [2022-11-02 21:07:47,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 21:07:47,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:47,429 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] [2022-11-02 21:07:47,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:07:47,429 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:47,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:47,430 INFO L85 PathProgramCache]: Analyzing trace with hash -354326769, now seen corresponding path program 1 times [2022-11-02 21:07:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:47,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094093848] [2022-11-02 21:07:47,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:47,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,471 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 21:07:47,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:47,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094093848] [2022-11-02 21:07:47,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094093848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:47,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:47,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:47,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938931347] [2022-11-02 21:07:47,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:47,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:47,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:47,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:47,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:47,475 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-02 21:07:47,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 340 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:47,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:47,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-02 21:07:47,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:47,828 INFO L130 PetriNetUnfolder]: 149/740 cut-off events. [2022-11-02 21:07:47,828 INFO L131 PetriNetUnfolder]: For 51/70 co-relation queries the response was YES. [2022-11-02 21:07:47,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 740 events. 149/740 cut-off events. For 51/70 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2369 event pairs, 50 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 956. Up to 121 conditions per place. [2022-11-02 21:07:47,833 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 29 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2022-11-02 21:07:47,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 351 transitions, 788 flow [2022-11-02 21:07:47,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:47,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1101 transitions. [2022-11-02 21:07:47,837 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7661795407098121 [2022-11-02 21:07:47,837 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1101 transitions. [2022-11-02 21:07:47,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1101 transitions. [2022-11-02 21:07:47,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:47,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1101 transitions. [2022-11-02 21:07:47,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states 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 21:07:47,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:47,846 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:47,847 INFO L175 Difference]: Start difference. First operand has 342 places, 340 transitions, 697 flow. Second operand 3 states and 1101 transitions. [2022-11-02 21:07:47,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 351 transitions, 788 flow [2022-11-02 21:07:47,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 351 transitions, 784 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:47,856 INFO L231 Difference]: Finished difference. Result has 342 places, 340 transitions, 701 flow [2022-11-02 21:07:47,858 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=342, PETRI_TRANSITIONS=340} [2022-11-02 21:07:47,859 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -106 predicate places. [2022-11-02 21:07:47,859 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 340 transitions, 701 flow [2022-11-02 21:07:47,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:47,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:47,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:47,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:07:47,860 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:47,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:47,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1115377268, now seen corresponding path program 1 times [2022-11-02 21:07:47,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:47,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703516361] [2022-11-02 21:07:47,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:47,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,918 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 21:07:47,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:47,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703516361] [2022-11-02 21:07:47,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703516361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:47,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:47,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:47,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384086537] [2022-11-02 21:07:47,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:47,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:47,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:47,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:47,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:47,923 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-02 21:07:47,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 340 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:47,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:47,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-02 21:07:47,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:48,296 INFO L130 PetriNetUnfolder]: 149/719 cut-off events. [2022-11-02 21:07:48,296 INFO L131 PetriNetUnfolder]: For 63/87 co-relation queries the response was YES. [2022-11-02 21:07:48,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 719 events. 149/719 cut-off events. For 63/87 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2279 event pairs, 86 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 982. Up to 233 conditions per place. [2022-11-02 21:07:48,301 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 19 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2022-11-02 21:07:48,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 339 transitions, 741 flow [2022-11-02 21:07:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-02 21:07:48,306 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-02 21:07:48,306 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-02 21:07:48,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-02 21:07:48,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:48,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-02 21:07:48,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states 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 21:07:48,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:48,312 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:48,312 INFO L175 Difference]: Start difference. First operand has 342 places, 340 transitions, 701 flow. Second operand 3 states and 1091 transitions. [2022-11-02 21:07:48,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 339 transitions, 741 flow [2022-11-02 21:07:48,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 339 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:07:48,320 INFO L231 Difference]: Finished difference. Result has 342 places, 339 transitions, 701 flow [2022-11-02 21:07:48,321 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=342, PETRI_TRANSITIONS=339} [2022-11-02 21:07:48,322 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -106 predicate places. [2022-11-02 21:07:48,322 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 339 transitions, 701 flow [2022-11-02 21:07:48,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:48,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:48,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:48,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:07:48,323 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:48,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:48,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2138874536, now seen corresponding path program 1 times [2022-11-02 21:07:48,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:48,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850993298] [2022-11-02 21:07:48,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:48,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:48,367 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 21:07:48,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:48,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850993298] [2022-11-02 21:07:48,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850993298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:48,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:48,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:48,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330558543] [2022-11-02 21:07:48,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:48,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:48,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:48,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:48,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:48,371 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-02 21:07:48,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 339 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 21:07:48,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:48,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-02 21:07:48,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:48,686 INFO L130 PetriNetUnfolder]: 149/718 cut-off events. [2022-11-02 21:07:48,686 INFO L131 PetriNetUnfolder]: For 62/86 co-relation queries the response was YES. [2022-11-02 21:07:48,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 718 events. 149/718 cut-off events. For 62/86 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2331 event pairs, 86 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 970. Up to 236 conditions per place. [2022-11-02 21:07:48,692 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 22 selfloop transitions, 2 changer transitions 0/338 dead transitions. [2022-11-02 21:07:48,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 338 transitions, 747 flow [2022-11-02 21:07:48,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:48,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:48,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-02 21:07:48,696 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-02 21:07:48,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-02 21:07:48,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-02 21:07:48,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:48,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-02 21:07:48,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states 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 21:07:48,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:48,704 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:48,704 INFO L175 Difference]: Start difference. First operand has 342 places, 339 transitions, 701 flow. Second operand 3 states and 1085 transitions. [2022-11-02 21:07:48,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 338 transitions, 747 flow [2022-11-02 21:07:48,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 338 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:48,711 INFO L231 Difference]: Finished difference. Result has 341 places, 338 transitions, 699 flow [2022-11-02 21:07:48,712 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=341, PETRI_TRANSITIONS=338} [2022-11-02 21:07:48,713 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -107 predicate places. [2022-11-02 21:07:48,713 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 338 transitions, 699 flow [2022-11-02 21:07:48,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 21:07:48,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:48,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:48,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:07:48,715 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:48,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:48,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1368554899, now seen corresponding path program 1 times [2022-11-02 21:07:48,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:48,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973000667] [2022-11-02 21:07:48,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:48,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:48,763 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 21:07:48,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:48,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973000667] [2022-11-02 21:07:48,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973000667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:48,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:48,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:48,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664677946] [2022-11-02 21:07:48,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:48,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:48,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:48,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:48,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:48,770 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-02 21:07:48,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 338 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:48,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:48,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-02 21:07:48,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:49,098 INFO L130 PetriNetUnfolder]: 149/717 cut-off events. [2022-11-02 21:07:49,099 INFO L131 PetriNetUnfolder]: For 63/87 co-relation queries the response was YES. [2022-11-02 21:07:49,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 717 events. 149/717 cut-off events. For 63/87 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2296 event pairs, 86 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 966. Up to 231 conditions per place. [2022-11-02 21:07:49,104 INFO L137 encePairwiseOnDemand]: 477/479 looper letters, 19 selfloop transitions, 1 changer transitions 0/337 dead transitions. [2022-11-02 21:07:49,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 337 transitions, 737 flow [2022-11-02 21:07:49,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2022-11-02 21:07:49,108 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7585247042449548 [2022-11-02 21:07:49,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1090 transitions. [2022-11-02 21:07:49,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1090 transitions. [2022-11-02 21:07:49,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:49,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1090 transitions. [2022-11-02 21:07:49,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states 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 21:07:49,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:49,115 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:49,115 INFO L175 Difference]: Start difference. First operand has 341 places, 338 transitions, 699 flow. Second operand 3 states and 1090 transitions. [2022-11-02 21:07:49,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 337 transitions, 737 flow [2022-11-02 21:07:49,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 337 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:49,122 INFO L231 Difference]: Finished difference. Result has 340 places, 337 transitions, 695 flow [2022-11-02 21:07:49,123 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=340, PETRI_TRANSITIONS=337} [2022-11-02 21:07:49,124 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -108 predicate places. [2022-11-02 21:07:49,125 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 337 transitions, 695 flow [2022-11-02 21:07:49,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:49,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:49,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:49,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:07:49,127 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:49,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:49,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1519574607, now seen corresponding path program 1 times [2022-11-02 21:07:49,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:49,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187177865] [2022-11-02 21:07:49,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:49,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:49,190 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 21:07:49,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:49,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187177865] [2022-11-02 21:07:49,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187177865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:49,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:49,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:49,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899949374] [2022-11-02 21:07:49,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:49,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:49,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:49,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:49,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:49,195 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-02 21:07:49,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 337 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:49,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:49,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-02 21:07:49,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:49,524 INFO L130 PetriNetUnfolder]: 149/716 cut-off events. [2022-11-02 21:07:49,525 INFO L131 PetriNetUnfolder]: For 62/86 co-relation queries the response was YES. [2022-11-02 21:07:49,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 716 events. 149/716 cut-off events. For 62/86 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2281 event pairs, 86 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 964. Up to 233 conditions per place. [2022-11-02 21:07:49,530 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 19 selfloop transitions, 2 changer transitions 0/336 dead transitions. [2022-11-02 21:07:49,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 336 transitions, 735 flow [2022-11-02 21:07:49,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-02 21:07:49,534 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-02 21:07:49,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-02 21:07:49,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-02 21:07:49,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:49,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-02 21:07:49,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states 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 21:07:49,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:49,541 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:49,541 INFO L175 Difference]: Start difference. First operand has 340 places, 337 transitions, 695 flow. Second operand 3 states and 1091 transitions. [2022-11-02 21:07:49,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 336 transitions, 735 flow [2022-11-02 21:07:49,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 336 transitions, 734 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:07:49,550 INFO L231 Difference]: Finished difference. Result has 340 places, 336 transitions, 696 flow [2022-11-02 21:07:49,551 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=340, PETRI_TRANSITIONS=336} [2022-11-02 21:07:49,552 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -108 predicate places. [2022-11-02 21:07:49,552 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 336 transitions, 696 flow [2022-11-02 21:07:49,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:49,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:49,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:49,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:07:49,554 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:49,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:49,554 INFO L85 PathProgramCache]: Analyzing trace with hash 721343885, now seen corresponding path program 1 times [2022-11-02 21:07:49,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:49,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272959788] [2022-11-02 21:07:49,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:49,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:49,640 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 21:07:49,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:49,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272959788] [2022-11-02 21:07:49,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272959788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:49,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:49,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:49,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503658672] [2022-11-02 21:07:49,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:49,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:49,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:49,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:49,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:49,645 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-02 21:07:49,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 336 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 21:07:49,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:49,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-02 21:07:49,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:49,984 INFO L130 PetriNetUnfolder]: 149/715 cut-off events. [2022-11-02 21:07:49,984 INFO L131 PetriNetUnfolder]: For 62/86 co-relation queries the response was YES. [2022-11-02 21:07:49,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 715 events. 149/715 cut-off events. For 62/86 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2302 event pairs, 86 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 968. Up to 236 conditions per place. [2022-11-02 21:07:49,990 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 22 selfloop transitions, 2 changer transitions 0/335 dead transitions. [2022-11-02 21:07:49,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 335 transitions, 742 flow [2022-11-02 21:07:49,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:49,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-02 21:07:49,994 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-02 21:07:49,994 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-02 21:07:49,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-02 21:07:49,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:49,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-02 21:07:49,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states 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 21:07:50,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:50,002 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:50,002 INFO L175 Difference]: Start difference. First operand has 340 places, 336 transitions, 696 flow. Second operand 3 states and 1085 transitions. [2022-11-02 21:07:50,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 335 transitions, 742 flow [2022-11-02 21:07:50,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 335 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:50,010 INFO L231 Difference]: Finished difference. Result has 339 places, 335 transitions, 694 flow [2022-11-02 21:07:50,012 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=339, PETRI_TRANSITIONS=335} [2022-11-02 21:07:50,012 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -109 predicate places. [2022-11-02 21:07:50,013 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 335 transitions, 694 flow [2022-11-02 21:07:50,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 21:07:50,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:50,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:50,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:07:50,014 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:50,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1092579755, now seen corresponding path program 1 times [2022-11-02 21:07:50,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:50,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745795217] [2022-11-02 21:07:50,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:50,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:07:50,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:50,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745795217] [2022-11-02 21:07:50,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745795217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:50,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:50,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:50,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614897713] [2022-11-02 21:07:50,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:50,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:50,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:50,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:50,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:50,105 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-02 21:07:50,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 335 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:50,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:50,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-02 21:07:50,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:50,637 INFO L130 PetriNetUnfolder]: 223/1059 cut-off events. [2022-11-02 21:07:50,637 INFO L131 PetriNetUnfolder]: For 119/150 co-relation queries the response was YES. [2022-11-02 21:07:50,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 1059 events. 223/1059 cut-off events. For 119/150 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4946 event pairs, 32 based on Foata normal form. 3/967 useless extension candidates. Maximal degree in co-relation 1461. Up to 254 conditions per place. [2022-11-02 21:07:50,645 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 31 selfloop transitions, 2 changer transitions 0/347 dead transitions. [2022-11-02 21:07:50,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 347 transitions, 796 flow [2022-11-02 21:07:50,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:50,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1101 transitions. [2022-11-02 21:07:50,648 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7661795407098121 [2022-11-02 21:07:50,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1101 transitions. [2022-11-02 21:07:50,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1101 transitions. [2022-11-02 21:07:50,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:50,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1101 transitions. [2022-11-02 21:07:50,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states 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 21:07:50,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:50,655 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:50,656 INFO L175 Difference]: Start difference. First operand has 339 places, 335 transitions, 694 flow. Second operand 3 states and 1101 transitions. [2022-11-02 21:07:50,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 347 transitions, 796 flow [2022-11-02 21:07:50,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 347 transitions, 792 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:50,663 INFO L231 Difference]: Finished difference. Result has 339 places, 335 transitions, 698 flow [2022-11-02 21:07:50,664 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=339, PETRI_TRANSITIONS=335} [2022-11-02 21:07:50,665 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -109 predicate places. [2022-11-02 21:07:50,665 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 335 transitions, 698 flow [2022-11-02 21:07:50,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:50,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:50,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:50,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:07:50,666 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:50,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:50,667 INFO L85 PathProgramCache]: Analyzing trace with hash -552934032, now seen corresponding path program 1 times [2022-11-02 21:07:50,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:50,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045409150] [2022-11-02 21:07:50,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:50,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:50,730 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 21:07:50,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:50,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045409150] [2022-11-02 21:07:50,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045409150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:50,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:50,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:50,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206443142] [2022-11-02 21:07:50,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:50,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:50,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:50,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:50,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:50,734 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-02 21:07:50,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 335 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:50,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:50,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-02 21:07:50,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:51,201 INFO L130 PetriNetUnfolder]: 223/1030 cut-off events. [2022-11-02 21:07:51,202 INFO L131 PetriNetUnfolder]: For 166/202 co-relation queries the response was YES. [2022-11-02 21:07:51,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 1030 events. 223/1030 cut-off events. For 166/202 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4842 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1530. Up to 352 conditions per place. [2022-11-02 21:07:51,210 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/334 dead transitions. [2022-11-02 21:07:51,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 334 transitions, 740 flow [2022-11-02 21:07:51,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-02 21:07:51,213 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-02 21:07:51,213 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-02 21:07:51,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-02 21:07:51,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:51,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-02 21:07:51,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states 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 21:07:51,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:51,220 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:51,220 INFO L175 Difference]: Start difference. First operand has 339 places, 335 transitions, 698 flow. Second operand 3 states and 1091 transitions. [2022-11-02 21:07:51,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 334 transitions, 740 flow [2022-11-02 21:07:51,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 334 transitions, 738 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:07:51,226 INFO L231 Difference]: Finished difference. Result has 339 places, 334 transitions, 698 flow [2022-11-02 21:07:51,227 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=339, PETRI_TRANSITIONS=334} [2022-11-02 21:07:51,227 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -109 predicate places. [2022-11-02 21:07:51,228 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 334 transitions, 698 flow [2022-11-02 21:07:51,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:51,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:51,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:51,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:07:51,229 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:51,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:51,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1050772823, now seen corresponding path program 1 times [2022-11-02 21:07:51,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:51,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941052227] [2022-11-02 21:07:51,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:51,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:51,293 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 21:07:51,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:51,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941052227] [2022-11-02 21:07:51,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941052227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:51,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:51,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:51,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132404186] [2022-11-02 21:07:51,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:51,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:51,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:51,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:51,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:51,298 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 479 [2022-11-02 21:07:51,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 334 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 21:07:51,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:51,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 479 [2022-11-02 21:07:51,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:51,771 INFO L130 PetriNetUnfolder]: 223/1029 cut-off events. [2022-11-02 21:07:51,771 INFO L131 PetriNetUnfolder]: For 165/201 co-relation queries the response was YES. [2022-11-02 21:07:51,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1567 conditions, 1029 events. 223/1029 cut-off events. For 165/201 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4877 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1501. Up to 355 conditions per place. [2022-11-02 21:07:51,782 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 23 selfloop transitions, 2 changer transitions 0/333 dead transitions. [2022-11-02 21:07:51,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 333 transitions, 746 flow [2022-11-02 21:07:51,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2022-11-02 21:07:51,785 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7550452331245651 [2022-11-02 21:07:51,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1085 transitions. [2022-11-02 21:07:51,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1085 transitions. [2022-11-02 21:07:51,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:51,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1085 transitions. [2022-11-02 21:07:51,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 361.6666666666667) internal successors, (1085), 3 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states 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 21:07:51,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:51,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:51,792 INFO L175 Difference]: Start difference. First operand has 339 places, 334 transitions, 698 flow. Second operand 3 states and 1085 transitions. [2022-11-02 21:07:51,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 333 transitions, 746 flow [2022-11-02 21:07:51,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 333 transitions, 742 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:51,800 INFO L231 Difference]: Finished difference. Result has 338 places, 333 transitions, 696 flow [2022-11-02 21:07:51,800 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=338, PETRI_TRANSITIONS=333} [2022-11-02 21:07:51,801 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -110 predicate places. [2022-11-02 21:07:51,801 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 333 transitions, 696 flow [2022-11-02 21:07:51,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.3333333333333) internal successors, (1066), 3 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states 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 21:07:51,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:51,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:51,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:07:51,803 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:51,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1501112421, now seen corresponding path program 1 times [2022-11-02 21:07:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:51,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146083230] [2022-11-02 21:07:51,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:51,863 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 21:07:51,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:51,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146083230] [2022-11-02 21:07:51,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146083230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:51,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:51,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:51,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266169479] [2022-11-02 21:07:51,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:51,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:51,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:51,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:51,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:51,868 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-02 21:07:51,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 333 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:51,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:51,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-02 21:07:51,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:52,333 INFO L130 PetriNetUnfolder]: 223/1028 cut-off events. [2022-11-02 21:07:52,333 INFO L131 PetriNetUnfolder]: For 166/202 co-relation queries the response was YES. [2022-11-02 21:07:52,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 1028 events. 223/1028 cut-off events. For 166/202 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4815 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1497. Up to 350 conditions per place. [2022-11-02 21:07:52,340 INFO L137 encePairwiseOnDemand]: 477/479 looper letters, 20 selfloop transitions, 1 changer transitions 0/332 dead transitions. [2022-11-02 21:07:52,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 332 transitions, 736 flow [2022-11-02 21:07:52,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1090 transitions. [2022-11-02 21:07:52,344 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7585247042449548 [2022-11-02 21:07:52,344 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1090 transitions. [2022-11-02 21:07:52,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1090 transitions. [2022-11-02 21:07:52,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:52,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1090 transitions. [2022-11-02 21:07:52,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.3333333333333) internal successors, (1090), 3 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states 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 21:07:52,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:52,350 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:52,350 INFO L175 Difference]: Start difference. First operand has 338 places, 333 transitions, 696 flow. Second operand 3 states and 1090 transitions. [2022-11-02 21:07:52,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 332 transitions, 736 flow [2022-11-02 21:07:52,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 332 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:52,357 INFO L231 Difference]: Finished difference. Result has 337 places, 332 transitions, 692 flow [2022-11-02 21:07:52,357 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=692, PETRI_PLACES=337, PETRI_TRANSITIONS=332} [2022-11-02 21:07:52,358 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -111 predicate places. [2022-11-02 21:07:52,358 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 332 transitions, 692 flow [2022-11-02 21:07:52,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:52,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:52,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:52,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:07:52,359 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:52,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:52,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1481930649, now seen corresponding path program 1 times [2022-11-02 21:07:52,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:52,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925875637] [2022-11-02 21:07:52,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:52,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:52,426 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 21:07:52,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:52,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925875637] [2022-11-02 21:07:52,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925875637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:52,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:52,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:52,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299486861] [2022-11-02 21:07:52,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:52,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:52,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:52,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:52,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:52,430 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-02 21:07:52,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 332 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:52,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:52,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-02 21:07:52,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:52,890 INFO L130 PetriNetUnfolder]: 223/1027 cut-off events. [2022-11-02 21:07:52,890 INFO L131 PetriNetUnfolder]: For 165/201 co-relation queries the response was YES. [2022-11-02 21:07:52,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 1027 events. 223/1027 cut-off events. For 165/201 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4837 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1495. Up to 352 conditions per place. [2022-11-02 21:07:52,899 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2022-11-02 21:07:52,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 331 transitions, 734 flow [2022-11-02 21:07:52,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-02 21:07:52,903 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-02 21:07:52,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-02 21:07:52,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-02 21:07:52,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:52,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-02 21:07:52,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states 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 21:07:52,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:52,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:52,909 INFO L175 Difference]: Start difference. First operand has 337 places, 332 transitions, 692 flow. Second operand 3 states and 1091 transitions. [2022-11-02 21:07:52,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 331 transitions, 734 flow [2022-11-02 21:07:52,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 331 transitions, 733 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:07:52,917 INFO L231 Difference]: Finished difference. Result has 337 places, 331 transitions, 693 flow [2022-11-02 21:07:52,917 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=337, PETRI_TRANSITIONS=331} [2022-11-02 21:07:52,918 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -111 predicate places. [2022-11-02 21:07:52,918 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 331 transitions, 693 flow [2022-11-02 21:07:52,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:52,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:52,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:52,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 21:07:52,919 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:52,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1591464817, now seen corresponding path program 1 times [2022-11-02 21:07:52,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:52,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922400367] [2022-11-02 21:07:52,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:52,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,018 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 21:07:53,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:53,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922400367] [2022-11-02 21:07:53,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922400367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:53,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:53,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:53,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307439850] [2022-11-02 21:07:53,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:53,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:53,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:53,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:53,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:53,023 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-02 21:07:53,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 331 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:53,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:53,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-02 21:07:53,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:53,534 INFO L130 PetriNetUnfolder]: 223/1026 cut-off events. [2022-11-02 21:07:53,534 INFO L131 PetriNetUnfolder]: For 165/201 co-relation queries the response was YES. [2022-11-02 21:07:53,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 1026 events. 223/1026 cut-off events. For 165/201 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4889 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1496. Up to 352 conditions per place. [2022-11-02 21:07:53,543 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2022-11-02 21:07:53,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 330 transitions, 735 flow [2022-11-02 21:07:53,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-02 21:07:53,547 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-02 21:07:53,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-02 21:07:53,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-02 21:07:53,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:53,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-02 21:07:53,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states 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 21:07:53,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:53,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:53,553 INFO L175 Difference]: Start difference. First operand has 337 places, 331 transitions, 693 flow. Second operand 3 states and 1091 transitions. [2022-11-02 21:07:53,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 330 transitions, 735 flow [2022-11-02 21:07:53,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 330 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:53,560 INFO L231 Difference]: Finished difference. Result has 336 places, 330 transitions, 691 flow [2022-11-02 21:07:53,560 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=336, PETRI_TRANSITIONS=330} [2022-11-02 21:07:53,561 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -112 predicate places. [2022-11-02 21:07:53,561 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 330 transitions, 691 flow [2022-11-02 21:07:53,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:53,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:53,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:53,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 21:07:53,562 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:53,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:53,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2004363717, now seen corresponding path program 1 times [2022-11-02 21:07:53,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:53,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101384688] [2022-11-02 21:07:53,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:53,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,631 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 21:07:53,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:53,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101384688] [2022-11-02 21:07:53,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101384688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:53,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:53,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:07:53,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465714310] [2022-11-02 21:07:53,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:53,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:07:53,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:53,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:07:53,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:07:53,635 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-02 21:07:53,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 330 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:53,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:53,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-02 21:07:53,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:54,042 INFO L130 PetriNetUnfolder]: 223/1025 cut-off events. [2022-11-02 21:07:54,042 INFO L131 PetriNetUnfolder]: For 165/201 co-relation queries the response was YES. [2022-11-02 21:07:54,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 1025 events. 223/1025 cut-off events. For 165/201 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4826 event pairs, 146 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1495. Up to 352 conditions per place. [2022-11-02 21:07:54,049 INFO L137 encePairwiseOnDemand]: 476/479 looper letters, 20 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2022-11-02 21:07:54,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 329 transitions, 733 flow [2022-11-02 21:07:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:07:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:07:54,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2022-11-02 21:07:54,053 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7592205984690327 [2022-11-02 21:07:54,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2022-11-02 21:07:54,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2022-11-02 21:07:54,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:54,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2022-11-02 21:07:54,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states 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 21:07:54,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:54,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:07:54,060 INFO L175 Difference]: Start difference. First operand has 336 places, 330 transitions, 691 flow. Second operand 3 states and 1091 transitions. [2022-11-02 21:07:54,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 329 transitions, 733 flow [2022-11-02 21:07:54,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 329 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:54,066 INFO L231 Difference]: Finished difference. Result has 335 places, 329 transitions, 689 flow [2022-11-02 21:07:54,066 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=335, PETRI_TRANSITIONS=329} [2022-11-02 21:07:54,067 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -113 predicate places. [2022-11-02 21:07:54,067 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 329 transitions, 689 flow [2022-11-02 21:07:54,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.3333333333333) internal successors, (1075), 3 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states 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 21:07:54,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:54,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:54,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 21:07:54,068 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:54,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:54,069 INFO L85 PathProgramCache]: Analyzing trace with hash 11671509, now seen corresponding path program 1 times [2022-11-02 21:07:54,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:54,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502839710] [2022-11-02 21:07:54,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:54,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:54,743 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 21:07:54,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:54,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502839710] [2022-11-02 21:07:54,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502839710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:54,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:54,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:07:54,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487839936] [2022-11-02 21:07:54,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:54,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:07:54,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:54,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:07:54,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:07:54,751 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 479 [2022-11-02 21:07:54,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 329 transitions, 689 flow. Second operand has 6 states, 6 states have (on average 323.0) internal successors, (1938), 6 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states 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 21:07:54,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:54,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 479 [2022-11-02 21:07:54,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:57,001 INFO L130 PetriNetUnfolder]: 1687/3138 cut-off events. [2022-11-02 21:07:57,001 INFO L131 PetriNetUnfolder]: For 882/882 co-relation queries the response was YES. [2022-11-02 21:07:57,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6531 conditions, 3138 events. 1687/3138 cut-off events. For 882/882 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 16038 event pairs, 233 based on Foata normal form. 0/3021 useless extension candidates. Maximal degree in co-relation 6464. Up to 1216 conditions per place. [2022-11-02 21:07:57,064 INFO L137 encePairwiseOnDemand]: 474/479 looper letters, 93 selfloop transitions, 4 changer transitions 0/372 dead transitions. [2022-11-02 21:07:57,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 372 transitions, 1017 flow [2022-11-02 21:07:57,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:07:57,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 21:07:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2009 transitions. [2022-11-02 21:07:57,076 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6990257480862909 [2022-11-02 21:07:57,076 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2009 transitions. [2022-11-02 21:07:57,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2009 transitions. [2022-11-02 21:07:57,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:57,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2009 transitions. [2022-11-02 21:07:57,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 334.8333333333333) internal successors, (2009), 6 states have internal predecessors, (2009), 0 states have call successors, (0), 0 states 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 21:07:57,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 0 states 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 21:07:57,089 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 0 states 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 21:07:57,089 INFO L175 Difference]: Start difference. First operand has 335 places, 329 transitions, 689 flow. Second operand 6 states and 2009 transitions. [2022-11-02 21:07:57,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 372 transitions, 1017 flow [2022-11-02 21:07:57,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 372 transitions, 1013 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:07:57,096 INFO L231 Difference]: Finished difference. Result has 337 places, 328 transitions, 691 flow [2022-11-02 21:07:57,097 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=691, PETRI_PLACES=337, PETRI_TRANSITIONS=328} [2022-11-02 21:07:57,098 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -111 predicate places. [2022-11-02 21:07:57,098 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 328 transitions, 691 flow [2022-11-02 21:07:57,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 323.0) internal successors, (1938), 6 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states 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 21:07:57,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:57,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:57,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 21:07:57,100 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:57,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:57,101 INFO L85 PathProgramCache]: Analyzing trace with hash -2130988935, now seen corresponding path program 1 times [2022-11-02 21:07:57,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:57,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8818214] [2022-11-02 21:07:57,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:57,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:57,755 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 21:07:57,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:57,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8818214] [2022-11-02 21:07:57,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8818214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:57,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:57,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:07:57,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933260780] [2022-11-02 21:07:57,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:57,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:07:57,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:57,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:07:57,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:07:57,760 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 479 [2022-11-02 21:07:57,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 328 transitions, 691 flow. Second operand has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states 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 21:07:57,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:07:57,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 479 [2022-11-02 21:07:57,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:07:59,603 INFO L130 PetriNetUnfolder]: 1512/2940 cut-off events. [2022-11-02 21:07:59,603 INFO L131 PetriNetUnfolder]: For 901/901 co-relation queries the response was YES. [2022-11-02 21:07:59,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6248 conditions, 2940 events. 1512/2940 cut-off events. For 901/901 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14990 event pairs, 837 based on Foata normal form. 0/2815 useless extension candidates. Maximal degree in co-relation 6181. Up to 1608 conditions per place. [2022-11-02 21:07:59,629 INFO L137 encePairwiseOnDemand]: 474/479 looper letters, 72 selfloop transitions, 4 changer transitions 0/351 dead transitions. [2022-11-02 21:07:59,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 351 transitions, 921 flow [2022-11-02 21:07:59,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:07:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 21:07:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1992 transitions. [2022-11-02 21:07:59,636 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6931106471816284 [2022-11-02 21:07:59,636 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1992 transitions. [2022-11-02 21:07:59,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1992 transitions. [2022-11-02 21:07:59,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:07:59,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1992 transitions. [2022-11-02 21:07:59,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states 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 21:07:59,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 0 states 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 21:07:59,651 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 0 states 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 21:07:59,651 INFO L175 Difference]: Start difference. First operand has 337 places, 328 transitions, 691 flow. Second operand 6 states and 1992 transitions. [2022-11-02 21:07:59,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 351 transitions, 921 flow [2022-11-02 21:07:59,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 351 transitions, 914 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 21:07:59,659 INFO L231 Difference]: Finished difference. Result has 337 places, 327 transitions, 690 flow [2022-11-02 21:07:59,660 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=690, PETRI_PLACES=337, PETRI_TRANSITIONS=327} [2022-11-02 21:07:59,660 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -111 predicate places. [2022-11-02 21:07:59,661 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 327 transitions, 690 flow [2022-11-02 21:07:59,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states 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 21:07:59,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:07:59,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:59,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:07:59,662 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:07:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:59,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1653608111, now seen corresponding path program 1 times [2022-11-02 21:07:59,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:59,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442407772] [2022-11-02 21:07:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:59,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:00,570 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 21:08:00,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:00,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442407772] [2022-11-02 21:08:00,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442407772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:00,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:00,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:08:00,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856888585] [2022-11-02 21:08:00,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:00,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:08:00,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:00,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:08:00,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:08:00,576 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 479 [2022-11-02 21:08:00,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 327 transitions, 690 flow. Second operand has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states 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 21:08:00,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:00,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 479 [2022-11-02 21:08:00,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:02,211 INFO L130 PetriNetUnfolder]: 1489/2909 cut-off events. [2022-11-02 21:08:02,211 INFO L131 PetriNetUnfolder]: For 786/786 co-relation queries the response was YES. [2022-11-02 21:08:02,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6082 conditions, 2909 events. 1489/2909 cut-off events. For 786/786 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 14807 event pairs, 1015 based on Foata normal form. 0/2816 useless extension candidates. Maximal degree in co-relation 6015. Up to 1995 conditions per place. [2022-11-02 21:08:02,230 INFO L137 encePairwiseOnDemand]: 474/479 looper letters, 59 selfloop transitions, 4 changer transitions 0/338 dead transitions. [2022-11-02 21:08:02,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 338 transitions, 854 flow [2022-11-02 21:08:02,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:08:02,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 21:08:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1983 transitions. [2022-11-02 21:08:02,235 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6899791231732777 [2022-11-02 21:08:02,236 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1983 transitions. [2022-11-02 21:08:02,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1983 transitions. [2022-11-02 21:08:02,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:02,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1983 transitions. [2022-11-02 21:08:02,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 330.5) internal successors, (1983), 6 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states 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 21:08:02,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 0 states 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 21:08:02,249 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 0 states 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 21:08:02,249 INFO L175 Difference]: Start difference. First operand has 337 places, 327 transitions, 690 flow. Second operand 6 states and 1983 transitions. [2022-11-02 21:08:02,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 338 transitions, 854 flow [2022-11-02 21:08:02,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 338 transitions, 847 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 21:08:02,256 INFO L231 Difference]: Finished difference. Result has 337 places, 326 transitions, 689 flow [2022-11-02 21:08:02,256 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=689, PETRI_PLACES=337, PETRI_TRANSITIONS=326} [2022-11-02 21:08:02,257 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -111 predicate places. [2022-11-02 21:08:02,257 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 326 transitions, 689 flow [2022-11-02 21:08:02,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states 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 21:08:02,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:02,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:02,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 21:08:02,258 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 203 more)] === [2022-11-02 21:08:02,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:02,259 INFO L85 PathProgramCache]: Analyzing trace with hash -193955788, now seen corresponding path program 1 times [2022-11-02 21:08:02,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:02,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178367717] [2022-11-02 21:08:02,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:02,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:02,357 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 21:08:02,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:02,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178367717] [2022-11-02 21:08:02,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178367717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:02,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:02,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:08:02,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045763388] [2022-11-02 21:08:02,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:02,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:08:02,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:02,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:08:02,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:08:02,361 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 479 [2022-11-02 21:08:02,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 326 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states 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 21:08:02,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:02,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 479 [2022-11-02 21:08:02,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:02,838 INFO L130 PetriNetUnfolder]: 223/1007 cut-off events. [2022-11-02 21:08:02,838 INFO L131 PetriNetUnfolder]: For 165/201 co-relation queries the response was YES. [2022-11-02 21:08:02,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 1007 events. 223/1007 cut-off events. For 165/201 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4719 event pairs, 146 based on Foata normal form. 8/926 useless extension candidates. Maximal degree in co-relation 1507. Up to 351 conditions per place. [2022-11-02 21:08:02,843 INFO L137 encePairwiseOnDemand]: 477/479 looper letters, 0 selfloop transitions, 0 changer transitions 325/325 dead transitions. [2022-11-02 21:08:02,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 325 transitions, 727 flow [2022-11-02 21:08:02,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:08:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:08:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1089 transitions. [2022-11-02 21:08:02,846 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7578288100208769 [2022-11-02 21:08:02,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1089 transitions. [2022-11-02 21:08:02,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1089 transitions. [2022-11-02 21:08:02,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:02,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1089 transitions. [2022-11-02 21:08:02,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.0) internal successors, (1089), 3 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states 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 21:08:02,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:08:02,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states 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 21:08:02,856 INFO L175 Difference]: Start difference. First operand has 337 places, 326 transitions, 689 flow. Second operand 3 states and 1089 transitions. [2022-11-02 21:08:02,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 325 transitions, 727 flow [2022-11-02 21:08:02,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 325 transitions, 720 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 21:08:02,860 INFO L231 Difference]: Finished difference. Result has 334 places, 0 transitions, 0 flow [2022-11-02 21:08:02,861 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=334, PETRI_TRANSITIONS=0} [2022-11-02 21:08:02,862 INFO L287 CegarLoopForPetriNet]: 448 programPoint places, -114 predicate places. [2022-11-02 21:08:02,862 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 0 transitions, 0 flow [2022-11-02 21:08:02,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.3333333333333) internal successors, (1081), 3 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states 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 21:08:02,865 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (206 of 207 remaining) [2022-11-02 21:08:02,866 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (205 of 207 remaining) [2022-11-02 21:08:02,866 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (204 of 207 remaining) [2022-11-02 21:08:02,866 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (203 of 207 remaining) [2022-11-02 21:08:02,866 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (202 of 207 remaining) [2022-11-02 21:08:02,866 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (201 of 207 remaining) [2022-11-02 21:08:02,866 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (200 of 207 remaining) [2022-11-02 21:08:02,867 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (199 of 207 remaining) [2022-11-02 21:08:02,867 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (198 of 207 remaining) [2022-11-02 21:08:02,867 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (197 of 207 remaining) [2022-11-02 21:08:02,867 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (196 of 207 remaining) [2022-11-02 21:08:02,867 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (195 of 207 remaining) [2022-11-02 21:08:02,867 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (194 of 207 remaining) [2022-11-02 21:08:02,868 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (193 of 207 remaining) [2022-11-02 21:08:02,868 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (192 of 207 remaining) [2022-11-02 21:08:02,868 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (191 of 207 remaining) [2022-11-02 21:08:02,868 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (190 of 207 remaining) [2022-11-02 21:08:02,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (189 of 207 remaining) [2022-11-02 21:08:02,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (188 of 207 remaining) [2022-11-02 21:08:02,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (187 of 207 remaining) [2022-11-02 21:08:02,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (186 of 207 remaining) [2022-11-02 21:08:02,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (185 of 207 remaining) [2022-11-02 21:08:02,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (184 of 207 remaining) [2022-11-02 21:08:02,870 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (183 of 207 remaining) [2022-11-02 21:08:02,872 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (182 of 207 remaining) [2022-11-02 21:08:02,872 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (181 of 207 remaining) [2022-11-02 21:08:02,872 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (180 of 207 remaining) [2022-11-02 21:08:02,873 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (179 of 207 remaining) [2022-11-02 21:08:02,873 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (178 of 207 remaining) [2022-11-02 21:08:02,873 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (177 of 207 remaining) [2022-11-02 21:08:02,873 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (176 of 207 remaining) [2022-11-02 21:08:02,873 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (175 of 207 remaining) [2022-11-02 21:08:02,873 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (174 of 207 remaining) [2022-11-02 21:08:02,874 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (173 of 207 remaining) [2022-11-02 21:08:02,874 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (172 of 207 remaining) [2022-11-02 21:08:02,874 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (171 of 207 remaining) [2022-11-02 21:08:02,874 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (170 of 207 remaining) [2022-11-02 21:08:02,874 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (169 of 207 remaining) [2022-11-02 21:08:02,874 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (168 of 207 remaining) [2022-11-02 21:08:02,875 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (167 of 207 remaining) [2022-11-02 21:08:02,875 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (166 of 207 remaining) [2022-11-02 21:08:02,875 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (165 of 207 remaining) [2022-11-02 21:08:02,875 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (164 of 207 remaining) [2022-11-02 21:08:02,875 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (163 of 207 remaining) [2022-11-02 21:08:02,875 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (162 of 207 remaining) [2022-11-02 21:08:02,876 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (161 of 207 remaining) [2022-11-02 21:08:02,876 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (160 of 207 remaining) [2022-11-02 21:08:02,876 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (159 of 207 remaining) [2022-11-02 21:08:02,876 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (158 of 207 remaining) [2022-11-02 21:08:02,876 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (157 of 207 remaining) [2022-11-02 21:08:02,876 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (156 of 207 remaining) [2022-11-02 21:08:02,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (155 of 207 remaining) [2022-11-02 21:08:02,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (154 of 207 remaining) [2022-11-02 21:08:02,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (153 of 207 remaining) [2022-11-02 21:08:02,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (152 of 207 remaining) [2022-11-02 21:08:02,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (151 of 207 remaining) [2022-11-02 21:08:02,877 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (150 of 207 remaining) [2022-11-02 21:08:02,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (149 of 207 remaining) [2022-11-02 21:08:02,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (148 of 207 remaining) [2022-11-02 21:08:02,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (147 of 207 remaining) [2022-11-02 21:08:02,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (146 of 207 remaining) [2022-11-02 21:08:02,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (145 of 207 remaining) [2022-11-02 21:08:02,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (144 of 207 remaining) [2022-11-02 21:08:02,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (143 of 207 remaining) [2022-11-02 21:08:02,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (142 of 207 remaining) [2022-11-02 21:08:02,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (141 of 207 remaining) [2022-11-02 21:08:02,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (140 of 207 remaining) [2022-11-02 21:08:02,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (139 of 207 remaining) [2022-11-02 21:08:02,879 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (138 of 207 remaining) [2022-11-02 21:08:02,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (137 of 207 remaining) [2022-11-02 21:08:02,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (136 of 207 remaining) [2022-11-02 21:08:02,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (135 of 207 remaining) [2022-11-02 21:08:02,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (134 of 207 remaining) [2022-11-02 21:08:02,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (133 of 207 remaining) [2022-11-02 21:08:02,880 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (132 of 207 remaining) [2022-11-02 21:08:02,881 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (131 of 207 remaining) [2022-11-02 21:08:02,881 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (130 of 207 remaining) [2022-11-02 21:08:02,881 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (129 of 207 remaining) [2022-11-02 21:08:02,881 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (128 of 207 remaining) [2022-11-02 21:08:02,881 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (127 of 207 remaining) [2022-11-02 21:08:02,881 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (126 of 207 remaining) [2022-11-02 21:08:02,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (125 of 207 remaining) [2022-11-02 21:08:02,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (124 of 207 remaining) [2022-11-02 21:08:02,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (123 of 207 remaining) [2022-11-02 21:08:02,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (122 of 207 remaining) [2022-11-02 21:08:02,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (121 of 207 remaining) [2022-11-02 21:08:02,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (120 of 207 remaining) [2022-11-02 21:08:02,883 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (119 of 207 remaining) [2022-11-02 21:08:02,883 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (118 of 207 remaining) [2022-11-02 21:08:02,883 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (117 of 207 remaining) [2022-11-02 21:08:02,883 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (116 of 207 remaining) [2022-11-02 21:08:02,883 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (115 of 207 remaining) [2022-11-02 21:08:02,883 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (114 of 207 remaining) [2022-11-02 21:08:02,884 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (113 of 207 remaining) [2022-11-02 21:08:02,884 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (112 of 207 remaining) [2022-11-02 21:08:02,884 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (111 of 207 remaining) [2022-11-02 21:08:02,884 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (110 of 207 remaining) [2022-11-02 21:08:02,884 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (109 of 207 remaining) [2022-11-02 21:08:02,884 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (108 of 207 remaining) [2022-11-02 21:08:02,885 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (107 of 207 remaining) [2022-11-02 21:08:02,885 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (106 of 207 remaining) [2022-11-02 21:08:02,885 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (105 of 207 remaining) [2022-11-02 21:08:02,885 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (104 of 207 remaining) [2022-11-02 21:08:02,885 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (103 of 207 remaining) [2022-11-02 21:08:02,885 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (102 of 207 remaining) [2022-11-02 21:08:02,886 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (101 of 207 remaining) [2022-11-02 21:08:02,886 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (100 of 207 remaining) [2022-11-02 21:08:02,886 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (99 of 207 remaining) [2022-11-02 21:08:02,886 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (98 of 207 remaining) [2022-11-02 21:08:02,886 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (97 of 207 remaining) [2022-11-02 21:08:02,886 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (96 of 207 remaining) [2022-11-02 21:08:02,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (95 of 207 remaining) [2022-11-02 21:08:02,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (94 of 207 remaining) [2022-11-02 21:08:02,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (93 of 207 remaining) [2022-11-02 21:08:02,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (92 of 207 remaining) [2022-11-02 21:08:02,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (91 of 207 remaining) [2022-11-02 21:08:02,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 207 remaining) [2022-11-02 21:08:02,888 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (89 of 207 remaining) [2022-11-02 21:08:02,888 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (88 of 207 remaining) [2022-11-02 21:08:02,888 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (87 of 207 remaining) [2022-11-02 21:08:02,888 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (86 of 207 remaining) [2022-11-02 21:08:02,888 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (85 of 207 remaining) [2022-11-02 21:08:02,888 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (84 of 207 remaining) [2022-11-02 21:08:02,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (83 of 207 remaining) [2022-11-02 21:08:02,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (82 of 207 remaining) [2022-11-02 21:08:02,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (81 of 207 remaining) [2022-11-02 21:08:02,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (80 of 207 remaining) [2022-11-02 21:08:02,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (79 of 207 remaining) [2022-11-02 21:08:02,889 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (78 of 207 remaining) [2022-11-02 21:08:02,890 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (77 of 207 remaining) [2022-11-02 21:08:02,890 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (76 of 207 remaining) [2022-11-02 21:08:02,890 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (75 of 207 remaining) [2022-11-02 21:08:02,890 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (74 of 207 remaining) [2022-11-02 21:08:02,890 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (73 of 207 remaining) [2022-11-02 21:08:02,890 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (72 of 207 remaining) [2022-11-02 21:08:02,891 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (71 of 207 remaining) [2022-11-02 21:08:02,891 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (70 of 207 remaining) [2022-11-02 21:08:02,891 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (69 of 207 remaining) [2022-11-02 21:08:02,891 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (68 of 207 remaining) [2022-11-02 21:08:02,891 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (67 of 207 remaining) [2022-11-02 21:08:02,891 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (66 of 207 remaining) [2022-11-02 21:08:02,891 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (65 of 207 remaining) [2022-11-02 21:08:02,892 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (64 of 207 remaining) [2022-11-02 21:08:02,892 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (63 of 207 remaining) [2022-11-02 21:08:02,892 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (62 of 207 remaining) [2022-11-02 21:08:02,892 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (61 of 207 remaining) [2022-11-02 21:08:02,892 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (60 of 207 remaining) [2022-11-02 21:08:02,892 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (59 of 207 remaining) [2022-11-02 21:08:02,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (58 of 207 remaining) [2022-11-02 21:08:02,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (57 of 207 remaining) [2022-11-02 21:08:02,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (56 of 207 remaining) [2022-11-02 21:08:02,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (55 of 207 remaining) [2022-11-02 21:08:02,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (54 of 207 remaining) [2022-11-02 21:08:02,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (53 of 207 remaining) [2022-11-02 21:08:02,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (52 of 207 remaining) [2022-11-02 21:08:02,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (51 of 207 remaining) [2022-11-02 21:08:02,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (50 of 207 remaining) [2022-11-02 21:08:02,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (49 of 207 remaining) [2022-11-02 21:08:02,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (48 of 207 remaining) [2022-11-02 21:08:02,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (47 of 207 remaining) [2022-11-02 21:08:02,895 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (46 of 207 remaining) [2022-11-02 21:08:02,895 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (45 of 207 remaining) [2022-11-02 21:08:02,895 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (44 of 207 remaining) [2022-11-02 21:08:02,895 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 207 remaining) [2022-11-02 21:08:02,895 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 207 remaining) [2022-11-02 21:08:02,895 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 207 remaining) [2022-11-02 21:08:02,896 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 207 remaining) [2022-11-02 21:08:02,896 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 207 remaining) [2022-11-02 21:08:02,896 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (38 of 207 remaining) [2022-11-02 21:08:02,896 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (37 of 207 remaining) [2022-11-02 21:08:02,896 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (36 of 207 remaining) [2022-11-02 21:08:02,896 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (35 of 207 remaining) [2022-11-02 21:08:02,897 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (34 of 207 remaining) [2022-11-02 21:08:02,897 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (33 of 207 remaining) [2022-11-02 21:08:02,897 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (32 of 207 remaining) [2022-11-02 21:08:02,897 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (31 of 207 remaining) [2022-11-02 21:08:02,897 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (30 of 207 remaining) [2022-11-02 21:08:02,897 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (29 of 207 remaining) [2022-11-02 21:08:02,898 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (28 of 207 remaining) [2022-11-02 21:08:02,898 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (27 of 207 remaining) [2022-11-02 21:08:02,898 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (26 of 207 remaining) [2022-11-02 21:08:02,898 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (25 of 207 remaining) [2022-11-02 21:08:02,898 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (24 of 207 remaining) [2022-11-02 21:08:02,898 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (23 of 207 remaining) [2022-11-02 21:08:02,899 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (22 of 207 remaining) [2022-11-02 21:08:02,899 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (21 of 207 remaining) [2022-11-02 21:08:02,899 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (20 of 207 remaining) [2022-11-02 21:08:02,899 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (19 of 207 remaining) [2022-11-02 21:08:02,899 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (18 of 207 remaining) [2022-11-02 21:08:02,899 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (17 of 207 remaining) [2022-11-02 21:08:02,900 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (16 of 207 remaining) [2022-11-02 21:08:02,900 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (15 of 207 remaining) [2022-11-02 21:08:02,900 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (14 of 207 remaining) [2022-11-02 21:08:02,900 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (13 of 207 remaining) [2022-11-02 21:08:02,900 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (12 of 207 remaining) [2022-11-02 21:08:02,900 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (11 of 207 remaining) [2022-11-02 21:08:02,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (10 of 207 remaining) [2022-11-02 21:08:02,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (9 of 207 remaining) [2022-11-02 21:08:02,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (8 of 207 remaining) [2022-11-02 21:08:02,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (7 of 207 remaining) [2022-11-02 21:08:02,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (6 of 207 remaining) [2022-11-02 21:08:02,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (5 of 207 remaining) [2022-11-02 21:08:02,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (4 of 207 remaining) [2022-11-02 21:08:02,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (3 of 207 remaining) [2022-11-02 21:08:02,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (2 of 207 remaining) [2022-11-02 21:08:02,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (1 of 207 remaining) [2022-11-02 21:08:02,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (0 of 207 remaining) [2022-11-02 21:08:02,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 21:08:02,903 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:08:02,912 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 21:08:02,913 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:08:02,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:08:02 BasicIcfg [2022-11-02 21:08:02,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:08:02,924 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:08:02,925 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:08:02,925 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:08:02,925 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:07:41" (3/4) ... [2022-11-02 21:08:02,929 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 21:08:02,935 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 21:08:02,935 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 21:08:02,935 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 21:08:02,946 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2022-11-02 21:08:02,947 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 21:08:02,948 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 21:08:02,948 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 21:08:03,045 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 21:08:03,046 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:08:03,047 INFO L158 Benchmark]: Toolchain (without parser) took 24572.71ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 82.9MB in the beginning and 500.3MB in the end (delta: -417.4MB). Peak memory consumption was 606.2MB. Max. memory is 16.1GB. [2022-11-02 21:08:03,047 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 81.8MB. Free memory was 52.5MB in the beginning and 52.4MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:08:03,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.54ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 89.5MB in the end (delta: -6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 21:08:03,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.86ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 85.0MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 21:08:03,048 INFO L158 Benchmark]: Boogie Preprocessor took 90.63ms. Allocated memory is still 117.4MB. Free memory was 85.0MB in the beginning and 80.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 21:08:03,049 INFO L158 Benchmark]: RCFGBuilder took 2443.10ms. Allocated memory was 117.4MB in the beginning and 190.8MB in the end (delta: 73.4MB). Free memory was 80.8MB in the beginning and 136.6MB in the end (delta: -55.8MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. [2022-11-02 21:08:03,049 INFO L158 Benchmark]: TraceAbstraction took 21344.93ms. Allocated memory was 190.8MB in the beginning and 1.1GB in the end (delta: 950.0MB). Free memory was 135.6MB in the beginning and 505.5MB in the end (delta: -370.0MB). Peak memory consumption was 579.0MB. Max. memory is 16.1GB. [2022-11-02 21:08:03,049 INFO L158 Benchmark]: Witness Printer took 121.23ms. Allocated memory is still 1.1GB. Free memory was 505.5MB in the beginning and 500.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 21:08:03,057 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.28ms. Allocated memory is still 81.8MB. Free memory was 52.5MB in the beginning and 52.4MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.54ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 89.5MB in the end (delta: -6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.86ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 85.0MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.63ms. Allocated memory is still 117.4MB. Free memory was 85.0MB in the beginning and 80.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2443.10ms. Allocated memory was 117.4MB in the beginning and 190.8MB in the end (delta: 73.4MB). Free memory was 80.8MB in the beginning and 136.6MB in the end (delta: -55.8MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. * TraceAbstraction took 21344.93ms. Allocated memory was 190.8MB in the beginning and 1.1GB in the end (delta: 950.0MB). Free memory was 135.6MB in the beginning and 505.5MB in the end (delta: -370.0MB). Peak memory consumption was 579.0MB. Max. memory is 16.1GB. * Witness Printer took 121.23ms. Allocated memory is still 1.1GB. Free memory was 505.5MB in the beginning and 500.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 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: 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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: 101]: 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: 102]: 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: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 144]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 578 locations, 207 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: 21.0s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 246 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1232 IncrementalHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 230 mSDtfsCounter, 1232 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=930occurred in iteration=0, InterpolantAutomatonStates: 90, 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.7s InterpolantComputationTime, 3513 NumberOfCodeBlocks, 3513 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3487 ConstructedInterpolants, 0 QuantifiedInterpolants, 3889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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 116 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 21:08:03,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a96ee75-1ba0-44a9-9a02-3ddb01b81933/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE