./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/bin/uautomizer-TMbwUNV5ro/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6727abf6d3311127e7c3f388ca276994a5a41bcb1f2faca3217c66ebe13b8b8f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 19:54:49,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:54:49,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:54:49,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:54:50,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:54:50,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:54:50,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:54:50,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:54:50,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:54:50,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:54:50,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:54:50,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:54:50,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:54:50,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:54:50,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:54:50,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:54:50,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:54:50,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:54:50,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:54:50,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:54:50,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:54:50,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:54:50,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:54:50,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:54:50,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:54:50,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:54:50,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:54:50,055 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:54:50,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:54:50,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:54:50,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:54:50,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:54:50,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:54:50,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:54:50,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:54:50,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:54:50,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:54:50,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:54:50,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:54:50,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:54:50,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:54:50,072 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/bin/uautomizer-TMbwUNV5ro/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-18 19:54:50,093 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:54:50,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:54:50,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:54:50,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:54:50,094 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:54:50,095 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:54:50,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:54:50,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:54:50,095 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:54:50,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:54:50,096 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:54:50,096 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 19:54:50,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:54:50,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:54:50,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:54:50,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:54:50,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:54:50,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:54:50,097 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-18 19:54:50,097 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:54:50,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:54:50,098 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:54:50,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:54:50,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:54:50,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:54:50,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:54:50,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:54:50,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:54:50,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:54:50,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:54:50,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:54:50,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:54:50,100 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:54:50,100 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:54:50,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:54:50,100 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_1ec141f8-5204-4d1b-8707-f42fd8018384/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6727abf6d3311127e7c3f388ca276994a5a41bcb1f2faca3217c66ebe13b8b8f [2022-11-18 19:54:50,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:54:50,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:54:50,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:54:50,441 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:54:50,441 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:54:50,443 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-11-18 19:54:50,520 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/bin/uautomizer-TMbwUNV5ro/data/0d9949eee/4caaf84d825c4b9da3e2aa080ffcdc37/FLAGfa6bdc8a6 [2022-11-18 19:54:51,077 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:54:51,085 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-11-18 19:54:51,096 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/bin/uautomizer-TMbwUNV5ro/data/0d9949eee/4caaf84d825c4b9da3e2aa080ffcdc37/FLAGfa6bdc8a6 [2022-11-18 19:54:51,441 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/bin/uautomizer-TMbwUNV5ro/data/0d9949eee/4caaf84d825c4b9da3e2aa080ffcdc37 [2022-11-18 19:54:51,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:54:51,447 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:54:51,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:54:51,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:54:51,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:54:51,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:54:51" (1/1) ... [2022-11-18 19:54:51,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2c8266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:51, skipping insertion in model container [2022-11-18 19:54:51,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:54:51" (1/1) ... [2022-11-18 19:54:51,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:54:51,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:54:51,763 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-11-18 19:54:51,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:54:51,794 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:54:51,825 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-11-18 19:54:51,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:54:51,845 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:54:51,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:51 WrapperNode [2022-11-18 19:54:51,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:54:51,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:54:51,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:54:51,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:54:51,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:51" (1/1) ... [2022-11-18 19:54:51,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:51" (1/1) ... [2022-11-18 19:54:51,924 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 403 [2022-11-18 19:54:51,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:54:51,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:54:51,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:54:51,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:54:51,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:51" (1/1) ... [2022-11-18 19:54:51,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:51" (1/1) ... [2022-11-18 19:54:51,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:51" (1/1) ... [2022-11-18 19:54:51,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:51" (1/1) ... [2022-11-18 19:54:51,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:51" (1/1) ... [2022-11-18 19:54:51,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:51" (1/1) ... [2022-11-18 19:54:51,970 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:51" (1/1) ... [2022-11-18 19:54:51,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:51" (1/1) ... [2022-11-18 19:54:51,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:54:51,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:54:51,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:54:51,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:54:51,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:51" (1/1) ... [2022-11-18 19:54:51,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:54:52,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:52,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:54:52,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ec141f8-5204-4d1b-8707-f42fd8018384/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:54:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:54:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 19:54:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:54:52,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:54:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-18 19:54:52,068 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-18 19:54:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-18 19:54:52,068 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-18 19:54:52,068 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-18 19:54:52,069 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-18 19:54:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:54:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 19:54:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:54:52,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:54:52,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:54:52,071 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 19:54:52,302 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:54:52,305 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:54:53,159 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:54:53,178 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:54:53,179 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-18 19:54:53,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:54:53 BoogieIcfgContainer [2022-11-18 19:54:53,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:54:53,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:54:53,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:54:53,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:54:53,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:54:51" (1/3) ... [2022-11-18 19:54:53,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd51ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:54:53, skipping insertion in model container [2022-11-18 19:54:53,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:54:51" (2/3) ... [2022-11-18 19:54:53,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd51ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:54:53, skipping insertion in model container [2022-11-18 19:54:53,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:54:53" (3/3) ... [2022-11-18 19:54:53,193 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2022-11-18 19:54:53,202 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 19:54:53,213 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:54:53,213 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2022-11-18 19:54:53,213 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 19:54:53,391 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-18 19:54:53,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 517 places, 536 transitions, 1096 flow [2022-11-18 19:54:53,734 INFO L130 PetriNetUnfolder]: 29/533 cut-off events. [2022-11-18 19:54:53,735 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 19:54:53,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 533 events. 29/533 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 918 event pairs, 0 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 332. Up to 2 conditions per place. [2022-11-18 19:54:53,753 INFO L82 GeneralOperation]: Start removeDead. Operand has 517 places, 536 transitions, 1096 flow [2022-11-18 19:54:53,766 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 470 places, 486 transitions, 990 flow [2022-11-18 19:54:53,785 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:54:53,796 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;@53d9b23d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:54:53,796 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-11-18 19:54:53,806 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-11-18 19:54:53,806 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 19:54:53,807 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:54:53,807 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:53,808 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-18 19:54:53,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:53,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1341404728, now seen corresponding path program 1 times [2022-11-18 19:54:53,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:53,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880067403] [2022-11-18 19:54:53,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:53,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:54:54,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:54,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880067403] [2022-11-18 19:54:54,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880067403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:54,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:54,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:54:54,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538258984] [2022-11-18 19:54:54,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:54,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:54,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:54,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:54,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:54,160 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 482 out of 536 [2022-11-18 19:54:54,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 486 transitions, 990 flow. Second operand has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:54,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:54:54,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 482 of 536 [2022-11-18 19:54:54,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:54:55,452 INFO L130 PetriNetUnfolder]: 204/3873 cut-off events. [2022-11-18 19:54:55,452 INFO L131 PetriNetUnfolder]: For 84/198 co-relation queries the response was YES. [2022-11-18 19:54:55,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4258 conditions, 3873 events. 204/3873 cut-off events. For 84/198 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 32936 event pairs, 135 based on Foata normal form. 131/3412 useless extension candidates. Maximal degree in co-relation 3809. Up to 316 conditions per place. [2022-11-18 19:54:55,496 INFO L137 encePairwiseOnDemand]: 513/536 looper letters, 27 selfloop transitions, 2 changer transitions 6/465 dead transitions. [2022-11-18 19:54:55,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 465 transitions, 1006 flow [2022-11-18 19:54:55,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:54:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1496 transitions. [2022-11-18 19:54:55,524 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9303482587064676 [2022-11-18 19:54:55,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1496 transitions. [2022-11-18 19:54:55,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1496 transitions. [2022-11-18 19:54:55,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:54:55,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1496 transitions. [2022-11-18 19:54:55,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 498.6666666666667) internal successors, (1496), 3 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:55,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:55,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:55,556 INFO L175 Difference]: Start difference. First operand has 470 places, 486 transitions, 990 flow. Second operand 3 states and 1496 transitions. [2022-11-18 19:54:55,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 465 transitions, 1006 flow [2022-11-18 19:54:55,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 465 transitions, 994 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-18 19:54:55,574 INFO L231 Difference]: Finished difference. Result has 465 places, 459 transitions, 928 flow [2022-11-18 19:54:55,577 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=465, PETRI_TRANSITIONS=459} [2022-11-18 19:54:55,581 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -5 predicate places. [2022-11-18 19:54:55,581 INFO L495 AbstractCegarLoop]: Abstraction has has 465 places, 459 transitions, 928 flow [2022-11-18 19:54:55,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.3333333333333) internal successors, (1450), 3 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:55,583 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:54:55,583 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:55,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:54:55,584 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-18 19:54:55,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash -805986249, now seen corresponding path program 1 times [2022-11-18 19:54:55,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:55,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978822350] [2022-11-18 19:54:55,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:55,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:55,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:54:55,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:55,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978822350] [2022-11-18 19:54:55,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978822350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:55,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:55,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:54:55,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628457814] [2022-11-18 19:54:55,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:55,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:55,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:55,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:55,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:55,652 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 536 [2022-11-18 19:54:55,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 459 transitions, 928 flow. Second operand has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:55,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:54:55,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 536 [2022-11-18 19:54:55,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:54:56,387 INFO L130 PetriNetUnfolder]: 100/2663 cut-off events. [2022-11-18 19:54:56,388 INFO L131 PetriNetUnfolder]: For 14/65 co-relation queries the response was YES. [2022-11-18 19:54:56,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 2663 events. 100/2663 cut-off events. For 14/65 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 19670 event pairs, 56 based on Foata normal form. 0/2311 useless extension candidates. Maximal degree in co-relation 2799. Up to 152 conditions per place. [2022-11-18 19:54:56,416 INFO L137 encePairwiseOnDemand]: 529/536 looper letters, 19 selfloop transitions, 1 changer transitions 0/453 dead transitions. [2022-11-18 19:54:56,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 453 transitions, 956 flow [2022-11-18 19:54:56,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:56,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:54:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1481 transitions. [2022-11-18 19:54:56,420 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9210199004975125 [2022-11-18 19:54:56,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1481 transitions. [2022-11-18 19:54:56,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1481 transitions. [2022-11-18 19:54:56,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:54:56,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1481 transitions. [2022-11-18 19:54:56,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 493.6666666666667) internal successors, (1481), 3 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:56,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:56,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:56,431 INFO L175 Difference]: Start difference. First operand has 465 places, 459 transitions, 928 flow. Second operand 3 states and 1481 transitions. [2022-11-18 19:54:56,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 453 transitions, 956 flow [2022-11-18 19:54:56,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 453 transitions, 952 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:54:56,440 INFO L231 Difference]: Finished difference. Result has 453 places, 453 transitions, 914 flow [2022-11-18 19:54:56,441 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=914, PETRI_PLACES=453, PETRI_TRANSITIONS=453} [2022-11-18 19:54:56,442 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -17 predicate places. [2022-11-18 19:54:56,442 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 453 transitions, 914 flow [2022-11-18 19:54:56,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 486.3333333333333) internal successors, (1459), 3 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:56,444 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:54:56,445 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:56,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:54:56,446 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-18 19:54:56,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:56,446 INFO L85 PathProgramCache]: Analyzing trace with hash 629444106, now seen corresponding path program 1 times [2022-11-18 19:54:56,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:56,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779873895] [2022-11-18 19:54:56,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:56,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:54:56,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:56,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779873895] [2022-11-18 19:54:56,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779873895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:56,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:56,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:54:56,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127915905] [2022-11-18 19:54:56,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:56,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:54:56,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:56,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:54:56,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:54:56,609 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 494 out of 536 [2022-11-18 19:54:56,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 453 transitions, 914 flow. Second operand has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:56,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:54:56,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 494 of 536 [2022-11-18 19:54:56,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:54:57,024 INFO L130 PetriNetUnfolder]: 43/1281 cut-off events. [2022-11-18 19:54:57,024 INFO L131 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-11-18 19:54:57,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 1281 events. 43/1281 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6137 event pairs, 21 based on Foata normal form. 0/1122 useless extension candidates. Maximal degree in co-relation 1332. Up to 72 conditions per place. [2022-11-18 19:54:57,044 INFO L137 encePairwiseOnDemand]: 533/536 looper letters, 15 selfloop transitions, 2 changer transitions 0/452 dead transitions. [2022-11-18 19:54:57,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 452 transitions, 946 flow [2022-11-18 19:54:57,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:54:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:54:57,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1500 transitions. [2022-11-18 19:54:57,048 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9328358208955224 [2022-11-18 19:54:57,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1500 transitions. [2022-11-18 19:54:57,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1500 transitions. [2022-11-18 19:54:57,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:54:57,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1500 transitions. [2022-11-18 19:54:57,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 500.0) internal successors, (1500), 3 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:57,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:57,058 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:57,058 INFO L175 Difference]: Start difference. First operand has 453 places, 453 transitions, 914 flow. Second operand 3 states and 1500 transitions. [2022-11-18 19:54:57,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 452 transitions, 946 flow [2022-11-18 19:54:57,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 452 transitions, 945 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 19:54:57,067 INFO L231 Difference]: Finished difference. Result has 453 places, 452 transitions, 915 flow [2022-11-18 19:54:57,068 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=915, PETRI_PLACES=453, PETRI_TRANSITIONS=452} [2022-11-18 19:54:57,069 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -17 predicate places. [2022-11-18 19:54:57,069 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 452 transitions, 915 flow [2022-11-18 19:54:57,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:57,071 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:54:57,071 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:57,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:54:57,071 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-18 19:54:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash -111013048, now seen corresponding path program 1 times [2022-11-18 19:54:57,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:57,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389362863] [2022-11-18 19:54:57,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:57,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:54:57,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:57,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389362863] [2022-11-18 19:54:57,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389362863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:57,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:57,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:54:57,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826472107] [2022-11-18 19:54:57,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:57,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:54:57,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:57,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:54:57,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:54:57,795 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 536 [2022-11-18 19:54:57,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 452 transitions, 915 flow. Second operand has 6 states, 6 states have (on average 402.8333333333333) internal successors, (2417), 6 states have internal predecessors, (2417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:57,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:54:57,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 536 [2022-11-18 19:54:57,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:55:12,955 INFO L130 PetriNetUnfolder]: 27435/78367 cut-off events. [2022-11-18 19:55:12,955 INFO L131 PetriNetUnfolder]: For 380/3494 co-relation queries the response was YES. [2022-11-18 19:55:13,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115934 conditions, 78367 events. 27435/78367 cut-off events. For 380/3494 co-relation queries the response was YES. Maximal size of possible extension queue 1177. Compared 935388 event pairs, 24192 based on Foata normal form. 0/65913 useless extension candidates. Maximal degree in co-relation 115900. Up to 37490 conditions per place. [2022-11-18 19:55:13,788 INFO L137 encePairwiseOnDemand]: 518/536 looper letters, 93 selfloop transitions, 15 changer transitions 0/449 dead transitions. [2022-11-18 19:55:13,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 449 transitions, 1125 flow [2022-11-18 19:55:13,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:55:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 19:55:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2517 transitions. [2022-11-18 19:55:13,796 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7826492537313433 [2022-11-18 19:55:13,797 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2517 transitions. [2022-11-18 19:55:13,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2517 transitions. [2022-11-18 19:55:13,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:55:13,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2517 transitions. [2022-11-18 19:55:13,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 419.5) internal successors, (2517), 6 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:13,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 536.0) internal successors, (3752), 7 states have internal predecessors, (3752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:13,822 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 536.0) internal successors, (3752), 7 states have internal predecessors, (3752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:13,823 INFO L175 Difference]: Start difference. First operand has 453 places, 452 transitions, 915 flow. Second operand 6 states and 2517 transitions. [2022-11-18 19:55:13,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 449 transitions, 1125 flow [2022-11-18 19:55:13,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 449 transitions, 1121 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:55:13,840 INFO L231 Difference]: Finished difference. Result has 453 places, 449 transitions, 935 flow [2022-11-18 19:55:13,847 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=935, PETRI_PLACES=453, PETRI_TRANSITIONS=449} [2022-11-18 19:55:13,849 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -17 predicate places. [2022-11-18 19:55:13,849 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 449 transitions, 935 flow [2022-11-18 19:55:13,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 402.8333333333333) internal successors, (2417), 6 states have internal predecessors, (2417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:13,851 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:55:13,851 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:13,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:55:13,852 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-18 19:55:13,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:13,854 INFO L85 PathProgramCache]: Analyzing trace with hash 212005435, now seen corresponding path program 1 times [2022-11-18 19:55:13,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:13,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014593457] [2022-11-18 19:55:13,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:13,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:13,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:13,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014593457] [2022-11-18 19:55:13,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014593457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:13,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:13,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:55:13,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887138005] [2022-11-18 19:55:13,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:13,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:55:13,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:13,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:55:13,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:55:13,962 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 494 out of 536 [2022-11-18 19:55:13,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 449 transitions, 935 flow. Second operand has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:13,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:55:13,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 494 of 536 [2022-11-18 19:55:13,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:55:14,450 INFO L130 PetriNetUnfolder]: 66/1628 cut-off events. [2022-11-18 19:55:14,451 INFO L131 PetriNetUnfolder]: For 26/29 co-relation queries the response was YES. [2022-11-18 19:55:14,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1759 conditions, 1628 events. 66/1628 cut-off events. For 26/29 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8780 event pairs, 39 based on Foata normal form. 0/1423 useless extension candidates. Maximal degree in co-relation 1724. Up to 105 conditions per place. [2022-11-18 19:55:14,465 INFO L137 encePairwiseOnDemand]: 533/536 looper letters, 15 selfloop transitions, 2 changer transitions 0/448 dead transitions. [2022-11-18 19:55:14,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 448 transitions, 967 flow [2022-11-18 19:55:14,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:55:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:55:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1500 transitions. [2022-11-18 19:55:14,469 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9328358208955224 [2022-11-18 19:55:14,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1500 transitions. [2022-11-18 19:55:14,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1500 transitions. [2022-11-18 19:55:14,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:55:14,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1500 transitions. [2022-11-18 19:55:14,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 500.0) internal successors, (1500), 3 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,479 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,480 INFO L175 Difference]: Start difference. First operand has 453 places, 449 transitions, 935 flow. Second operand 3 states and 1500 transitions. [2022-11-18 19:55:14,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 448 transitions, 967 flow [2022-11-18 19:55:14,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 448 transitions, 937 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 19:55:14,489 INFO L231 Difference]: Finished difference. Result has 449 places, 448 transitions, 907 flow [2022-11-18 19:55:14,489 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=907, PETRI_PLACES=449, PETRI_TRANSITIONS=448} [2022-11-18 19:55:14,490 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -21 predicate places. [2022-11-18 19:55:14,491 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 448 transitions, 907 flow [2022-11-18 19:55:14,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,492 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:55:14,492 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:14,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:55:14,493 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-18 19:55:14,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:14,493 INFO L85 PathProgramCache]: Analyzing trace with hash 741170182, now seen corresponding path program 1 times [2022-11-18 19:55:14,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:14,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656992488] [2022-11-18 19:55:14,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:14,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:14,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:14,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656992488] [2022-11-18 19:55:14,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656992488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:14,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:14,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:55:14,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777036400] [2022-11-18 19:55:14,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:14,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:55:14,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:14,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:55:14,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:55:14,560 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 494 out of 536 [2022-11-18 19:55:14,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 448 transitions, 907 flow. Second operand has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:55:14,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 494 of 536 [2022-11-18 19:55:14,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:55:14,695 INFO L130 PetriNetUnfolder]: 21/688 cut-off events. [2022-11-18 19:55:14,695 INFO L131 PetriNetUnfolder]: For 16/19 co-relation queries the response was YES. [2022-11-18 19:55:14,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 741 conditions, 688 events. 21/688 cut-off events. For 16/19 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1840 event pairs, 12 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 706. Up to 43 conditions per place. [2022-11-18 19:55:14,701 INFO L137 encePairwiseOnDemand]: 533/536 looper letters, 15 selfloop transitions, 2 changer transitions 0/447 dead transitions. [2022-11-18 19:55:14,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 447 transitions, 939 flow [2022-11-18 19:55:14,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:55:14,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:55:14,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1500 transitions. [2022-11-18 19:55:14,706 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9328358208955224 [2022-11-18 19:55:14,706 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1500 transitions. [2022-11-18 19:55:14,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1500 transitions. [2022-11-18 19:55:14,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:55:14,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1500 transitions. [2022-11-18 19:55:14,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 500.0) internal successors, (1500), 3 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,715 INFO L175 Difference]: Start difference. First operand has 449 places, 448 transitions, 907 flow. Second operand 3 states and 1500 transitions. [2022-11-18 19:55:14,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 447 transitions, 939 flow [2022-11-18 19:55:14,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 447 transitions, 935 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:55:14,724 INFO L231 Difference]: Finished difference. Result has 448 places, 447 transitions, 905 flow [2022-11-18 19:55:14,725 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=905, PETRI_PLACES=448, PETRI_TRANSITIONS=447} [2022-11-18 19:55:14,725 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -22 predicate places. [2022-11-18 19:55:14,726 INFO L495 AbstractCegarLoop]: Abstraction has has 448 places, 447 transitions, 905 flow [2022-11-18 19:55:14,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 495.3333333333333) internal successors, (1486), 3 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,727 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:55:14,727 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:14,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:55:14,727 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-18 19:55:14,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:14,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1313607301, now seen corresponding path program 1 times [2022-11-18 19:55:14,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:14,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713681796] [2022-11-18 19:55:14,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:14,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:14,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:14,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713681796] [2022-11-18 19:55:14,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713681796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:14,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:14,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:55:14,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863322184] [2022-11-18 19:55:14,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:14,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:55:14,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:14,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:55:14,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:55:14,798 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 536 [2022-11-18 19:55:14,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 447 transitions, 905 flow. Second operand has 3 states, 3 states have (on average 498.0) internal successors, (1494), 3 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:55:14,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 536 [2022-11-18 19:55:14,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:55:14,913 INFO L130 PetriNetUnfolder]: 19/564 cut-off events. [2022-11-18 19:55:14,913 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-11-18 19:55:14,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 564 events. 19/564 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1569 event pairs, 6 based on Foata normal form. 1/518 useless extension candidates. Maximal degree in co-relation 585. Up to 23 conditions per place. [2022-11-18 19:55:14,919 INFO L137 encePairwiseOnDemand]: 531/536 looper letters, 12 selfloop transitions, 3 changer transitions 0/447 dead transitions. [2022-11-18 19:55:14,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 447 transitions, 937 flow [2022-11-18 19:55:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:55:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:55:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1508 transitions. [2022-11-18 19:55:14,923 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9378109452736318 [2022-11-18 19:55:14,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1508 transitions. [2022-11-18 19:55:14,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1508 transitions. [2022-11-18 19:55:14,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:55:14,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1508 transitions. [2022-11-18 19:55:14,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 502.6666666666667) internal successors, (1508), 3 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,949 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,949 INFO L175 Difference]: Start difference. First operand has 448 places, 447 transitions, 905 flow. Second operand 3 states and 1508 transitions. [2022-11-18 19:55:14,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 447 transitions, 937 flow [2022-11-18 19:55:14,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 447 transitions, 933 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:55:14,958 INFO L231 Difference]: Finished difference. Result has 446 places, 445 transitions, 903 flow [2022-11-18 19:55:14,959 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=903, PETRI_PLACES=446, PETRI_TRANSITIONS=445} [2022-11-18 19:55:14,960 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -24 predicate places. [2022-11-18 19:55:14,960 INFO L495 AbstractCegarLoop]: Abstraction has has 446 places, 445 transitions, 903 flow [2022-11-18 19:55:14,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 498.0) internal successors, (1494), 3 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,961 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:55:14,962 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:14,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:55:14,962 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-18 19:55:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:14,963 INFO L85 PathProgramCache]: Analyzing trace with hash 343808445, now seen corresponding path program 1 times [2022-11-18 19:55:14,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:14,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2210042] [2022-11-18 19:55:14,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:14,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:15,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:15,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2210042] [2022-11-18 19:55:15,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2210042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:15,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:15,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:55:15,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568851098] [2022-11-18 19:55:15,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:15,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:55:15,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:15,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:55:15,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:55:15,029 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 536 [2022-11-18 19:55:15,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 445 transitions, 903 flow. Second operand has 3 states, 3 states have (on average 498.6666666666667) internal successors, (1496), 3 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:15,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:55:15,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 536 [2022-11-18 19:55:15,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:55:15,262 INFO L130 PetriNetUnfolder]: 31/1132 cut-off events. [2022-11-18 19:55:15,262 INFO L131 PetriNetUnfolder]: For 13/15 co-relation queries the response was YES. [2022-11-18 19:55:15,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 1132 events. 31/1132 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4915 event pairs, 4 based on Foata normal form. 0/1016 useless extension candidates. Maximal degree in co-relation 1174. Up to 46 conditions per place. [2022-11-18 19:55:15,270 INFO L137 encePairwiseOnDemand]: 532/536 looper letters, 17 selfloop transitions, 2 changer transitions 0/450 dead transitions. [2022-11-18 19:55:15,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 450 transitions, 956 flow [2022-11-18 19:55:15,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:55:15,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:55:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1512 transitions. [2022-11-18 19:55:15,276 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9402985074626866 [2022-11-18 19:55:15,276 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1512 transitions. [2022-11-18 19:55:15,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1512 transitions. [2022-11-18 19:55:15,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:55:15,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1512 transitions. [2022-11-18 19:55:15,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 504.0) internal successors, (1512), 3 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:15,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:15,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:15,288 INFO L175 Difference]: Start difference. First operand has 446 places, 445 transitions, 903 flow. Second operand 3 states and 1512 transitions. [2022-11-18 19:55:15,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 450 transitions, 956 flow [2022-11-18 19:55:15,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 450 transitions, 950 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:55:15,295 INFO L231 Difference]: Finished difference. Result has 445 places, 445 transitions, 907 flow [2022-11-18 19:55:15,296 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=907, PETRI_PLACES=445, PETRI_TRANSITIONS=445} [2022-11-18 19:55:15,296 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -25 predicate places. [2022-11-18 19:55:15,296 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 445 transitions, 907 flow [2022-11-18 19:55:15,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 498.6666666666667) internal successors, (1496), 3 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:15,297 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:55:15,297 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:15,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 19:55:15,298 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-18 19:55:15,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:15,298 INFO L85 PathProgramCache]: Analyzing trace with hash 801371320, now seen corresponding path program 1 times [2022-11-18 19:55:15,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:15,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214397426] [2022-11-18 19:55:15,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:15,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:15,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:15,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214397426] [2022-11-18 19:55:15,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214397426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:15,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:15,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:55:15,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955247943] [2022-11-18 19:55:15,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:15,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:55:15,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:15,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:55:15,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:55:15,364 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 536 [2022-11-18 19:55:15,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 445 transitions, 907 flow. Second operand has 3 states, 3 states have (on average 498.3333333333333) internal successors, (1495), 3 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:15,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:55:15,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 536 [2022-11-18 19:55:15,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:55:15,538 INFO L130 PetriNetUnfolder]: 31/782 cut-off events. [2022-11-18 19:55:15,538 INFO L131 PetriNetUnfolder]: For 20/55 co-relation queries the response was YES. [2022-11-18 19:55:15,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 782 events. 31/782 cut-off events. For 20/55 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3016 event pairs, 9 based on Foata normal form. 6/712 useless extension candidates. Maximal degree in co-relation 823. Up to 35 conditions per place. [2022-11-18 19:55:15,548 INFO L137 encePairwiseOnDemand]: 531/536 looper letters, 11 selfloop transitions, 2 changer transitions 4/445 dead transitions. [2022-11-18 19:55:15,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 445 transitions, 937 flow [2022-11-18 19:55:15,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:55:15,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:55:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1507 transitions. [2022-11-18 19:55:15,552 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9371890547263682 [2022-11-18 19:55:15,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1507 transitions. [2022-11-18 19:55:15,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1507 transitions. [2022-11-18 19:55:15,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:55:15,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1507 transitions. [2022-11-18 19:55:15,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 502.3333333333333) internal successors, (1507), 3 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:15,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:15,561 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:15,562 INFO L175 Difference]: Start difference. First operand has 445 places, 445 transitions, 907 flow. Second operand 3 states and 1507 transitions. [2022-11-18 19:55:15,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 445 transitions, 937 flow [2022-11-18 19:55:15,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 445 transitions, 937 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 19:55:15,570 INFO L231 Difference]: Finished difference. Result has 445 places, 439 transitions, 899 flow [2022-11-18 19:55:15,571 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=445, PETRI_TRANSITIONS=439} [2022-11-18 19:55:15,572 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -25 predicate places. [2022-11-18 19:55:15,572 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 439 transitions, 899 flow [2022-11-18 19:55:15,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 498.3333333333333) internal successors, (1495), 3 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:15,573 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:55:15,573 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:15,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 19:55:15,574 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-18 19:55:15,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1318734106, now seen corresponding path program 1 times [2022-11-18 19:55:15,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:15,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118868310] [2022-11-18 19:55:15,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:15,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:15,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:15,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118868310] [2022-11-18 19:55:15,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118868310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:15,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:15,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:55:15,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477476543] [2022-11-18 19:55:15,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:15,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:55:15,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:15,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:55:15,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:55:15,639 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 536 [2022-11-18 19:55:15,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 439 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 499.0) internal successors, (1497), 3 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:15,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:55:15,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 536 [2022-11-18 19:55:15,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:55:16,142 INFO L130 PetriNetUnfolder]: 73/1901 cut-off events. [2022-11-18 19:55:16,142 INFO L131 PetriNetUnfolder]: For 31/37 co-relation queries the response was YES. [2022-11-18 19:55:16,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2054 conditions, 1901 events. 73/1901 cut-off events. For 31/37 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 11644 event pairs, 6 based on Foata normal form. 2/1701 useless extension candidates. Maximal degree in co-relation 2019. Up to 93 conditions per place. [2022-11-18 19:55:16,165 INFO L137 encePairwiseOnDemand]: 532/536 looper letters, 16 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2022-11-18 19:55:16,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 443 transitions, 947 flow [2022-11-18 19:55:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:55:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:55:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1511 transitions. [2022-11-18 19:55:16,169 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9396766169154229 [2022-11-18 19:55:16,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1511 transitions. [2022-11-18 19:55:16,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1511 transitions. [2022-11-18 19:55:16,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:55:16,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1511 transitions. [2022-11-18 19:55:16,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 503.6666666666667) internal successors, (1511), 3 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:16,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:16,179 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:16,179 INFO L175 Difference]: Start difference. First operand has 445 places, 439 transitions, 899 flow. Second operand 3 states and 1511 transitions. [2022-11-18 19:55:16,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 443 transitions, 947 flow [2022-11-18 19:55:16,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 443 transitions, 943 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:55:16,187 INFO L231 Difference]: Finished difference. Result has 440 places, 439 transitions, 905 flow [2022-11-18 19:55:16,188 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=905, PETRI_PLACES=440, PETRI_TRANSITIONS=439} [2022-11-18 19:55:16,189 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -30 predicate places. [2022-11-18 19:55:16,189 INFO L495 AbstractCegarLoop]: Abstraction has has 440 places, 439 transitions, 905 flow [2022-11-18 19:55:16,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.0) internal successors, (1497), 3 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:16,190 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:55:16,191 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:16,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 19:55:16,191 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-18 19:55:16,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:16,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1469836833, now seen corresponding path program 1 times [2022-11-18 19:55:16,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:16,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544332435] [2022-11-18 19:55:16,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:16,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:16,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:16,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544332435] [2022-11-18 19:55:16,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544332435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:16,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:16,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:55:16,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338340260] [2022-11-18 19:55:16,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:16,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:55:16,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:16,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:55:16,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:55:16,452 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 536 [2022-11-18 19:55:16,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 439 transitions, 905 flow. Second operand has 7 states, 7 states have (on average 439.0) internal successors, (3073), 7 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:16,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:55:16,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 536 [2022-11-18 19:55:16,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:55:18,627 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [69#L51true, 526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), 428#L85-4true, Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-18 19:55:18,628 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,628 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 19:55:18,628 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,628 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-18 19:55:18,628 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [69#L51true, 526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), 428#L85-4true, Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-18 19:55:18,628 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,628 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 19:55:18,628 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,629 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-18 19:55:18,629 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [69#L51true, 526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), 428#L85-4true, Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-18 19:55:18,629 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,629 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 19:55:18,629 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,629 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-18 19:55:18,629 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [69#L51true, 526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), 428#L85-4true, Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-18 19:55:18,630 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,630 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-18 19:55:18,630 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 19:55:18,630 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,631 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), 428#L85-4true, Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, 133#L50-8true, 562#(= |#race~B~0| 0), Black: 551#true, 313#L59true]) [2022-11-18 19:55:18,632 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,632 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,632 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-18 19:55:18,632 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 19:55:18,632 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), 428#L85-4true, Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, 133#L50-8true, 562#(= |#race~B~0| 0), Black: 551#true, 313#L59true]) [2022-11-18 19:55:18,633 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,633 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,633 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-18 19:55:18,633 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 19:55:18,633 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), 428#L85-4true, Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, 133#L50-8true, 562#(= |#race~B~0| 0), Black: 551#true]) [2022-11-18 19:55:18,633 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,634 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 19:55:18,634 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,634 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-18 19:55:18,634 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), 428#L85-4true, Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, 133#L50-8true, 562#(= |#race~B~0| 0), Black: 551#true]) [2022-11-18 19:55:18,634 INFO L383 tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,634 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-18 19:55:18,635 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 19:55:18,635 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,679 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [69#L51true, 526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 428#L85-4true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-18 19:55:18,679 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-18 19:55:18,680 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 19:55:18,680 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,680 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,680 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-18 19:55:18,680 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [69#L51true, 526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 428#L85-4true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-18 19:55:18,681 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-18 19:55:18,681 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 19:55:18,681 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,681 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,681 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-18 19:55:18,682 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 428#L85-4true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, 133#L50-8true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-18 19:55:18,682 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-18 19:55:18,682 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,682 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-18 19:55:18,682 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 19:55:18,683 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,683 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 428#L85-4true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, 133#L50-8true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-18 19:55:18,683 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-18 19:55:18,683 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,683 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-18 19:55:18,683 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 19:55:18,684 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,684 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [69#L51true, 526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), Black: 560#true, 428#L85-4true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-18 19:55:18,684 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-18 19:55:18,684 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 19:55:18,684 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,684 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,685 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-18 19:55:18,685 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [69#L51true, 526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), Black: 560#true, 428#L85-4true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-18 19:55:18,685 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-18 19:55:18,685 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-18 19:55:18,685 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 19:55:18,685 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,686 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,686 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), Black: 560#true, 428#L85-4true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, 133#L50-8true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-18 19:55:18,686 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-18 19:55:18,686 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 19:55:18,686 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,687 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,687 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-18 19:55:18,687 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), Black: 560#true, 428#L85-4true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, 133#L50-8true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-18 19:55:18,687 INFO L383 tUnfolder$Statistics]: this new event has 384 ancestors and is cut-off event [2022-11-18 19:55:18,687 INFO L386 tUnfolder$Statistics]: existing Event has 294 ancestors and is cut-off event [2022-11-18 19:55:18,687 INFO L386 tUnfolder$Statistics]: existing Event has 288 ancestors and is cut-off event [2022-11-18 19:55:18,688 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,688 INFO L386 tUnfolder$Statistics]: existing Event has 339 ancestors and is cut-off event [2022-11-18 19:55:18,691 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [526#(= |#race~N~0| 0), 51#L86-7true, 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-18 19:55:18,692 INFO L383 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-11-18 19:55:18,692 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-18 19:55:18,692 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-18 19:55:18,692 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-18 19:55:18,692 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [526#(= |#race~N~0| 0), 51#L86-7true, 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-18 19:55:18,693 INFO L383 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-11-18 19:55:18,694 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-18 19:55:18,694 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-18 19:55:18,694 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-18 19:55:18,695 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [526#(= |#race~N~0| 0), 51#L86-7true, 493#L58-8true, 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-18 19:55:18,696 INFO L383 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-11-18 19:55:18,696 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-18 19:55:18,696 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-18 19:55:18,696 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-18 19:55:18,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [526#(= |#race~N~0| 0), 51#L86-7true, 493#L58-8true, 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-18 19:55:18,697 INFO L383 tUnfolder$Statistics]: this new event has 395 ancestors and is cut-off event [2022-11-18 19:55:18,697 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-18 19:55:18,697 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-18 19:55:18,697 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-18 19:55:18,735 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [51#L86-7true, 526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-18 19:55:18,735 INFO L383 tUnfolder$Statistics]: this new event has 350 ancestors and is cut-off event [2022-11-18 19:55:18,735 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-18 19:55:18,735 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-18 19:55:18,735 INFO L386 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-11-18 19:55:18,735 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-18 19:55:18,736 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [51#L86-7true, 526#(= |#race~N~0| 0), 493#L58-8true, 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0)]) [2022-11-18 19:55:18,736 INFO L383 tUnfolder$Statistics]: this new event has 350 ancestors and is cut-off event [2022-11-18 19:55:18,736 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-18 19:55:18,736 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-18 19:55:18,736 INFO L386 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-11-18 19:55:18,736 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-18 19:55:18,737 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0), 305#L87-7true]) [2022-11-18 19:55:18,737 INFO L383 tUnfolder$Statistics]: this new event has 360 ancestors and is cut-off event [2022-11-18 19:55:18,737 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-18 19:55:18,737 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-18 19:55:18,737 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-18 19:55:18,738 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0), 305#L87-7true]) [2022-11-18 19:55:18,738 INFO L383 tUnfolder$Statistics]: this new event has 360 ancestors and is cut-off event [2022-11-18 19:55:18,738 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-18 19:55:18,738 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-18 19:55:18,738 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-18 19:55:18,739 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [51#L86-7true, 526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-18 19:55:18,739 INFO L383 tUnfolder$Statistics]: this new event has 350 ancestors and is cut-off event [2022-11-18 19:55:18,739 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-18 19:55:18,739 INFO L386 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-11-18 19:55:18,739 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-18 19:55:18,739 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-18 19:55:18,739 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [51#L86-7true, 526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0), 313#L59true]) [2022-11-18 19:55:18,739 INFO L383 tUnfolder$Statistics]: this new event has 350 ancestors and is cut-off event [2022-11-18 19:55:18,740 INFO L386 tUnfolder$Statistics]: existing Event has 305 ancestors and is cut-off event [2022-11-18 19:55:18,740 INFO L386 tUnfolder$Statistics]: existing Event has 395 ancestors and is cut-off event [2022-11-18 19:55:18,740 INFO L386 tUnfolder$Statistics]: existing Event has 350 ancestors and is cut-off event [2022-11-18 19:55:18,740 INFO L386 tUnfolder$Statistics]: existing Event has 299 ancestors and is cut-off event [2022-11-18 19:55:18,757 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1322] L66-2-->L66-8: Formula: (not (< |v_thread3Thread1of1ForFork1_~i~2#1_3| v_~N~0_5)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_3|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[][461], [526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 210#L66-8true, Black: 551#true, 562#(= |#race~B~0| 0), 305#L87-7true]) [2022-11-18 19:55:18,757 INFO L383 tUnfolder$Statistics]: this new event has 405 ancestors and is cut-off event [2022-11-18 19:55:18,757 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-18 19:55:18,757 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-18 19:55:18,757 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-18 19:55:18,757 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-18 19:55:18,757 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1323] L66-2-->L67: Formula: (< |v_thread3Thread1of1ForFork1_~i~2#1_5| v_~N~0_6) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} OutVars{thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_5|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[][462], [526#(= |#race~N~0| 0), 553#(= |#race~A~0| 0), Black: 560#true, 573#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 135#L67true, Black: 551#true, 562#(= |#race~B~0| 0), 305#L87-7true]) [2022-11-18 19:55:18,758 INFO L383 tUnfolder$Statistics]: this new event has 405 ancestors and is cut-off event [2022-11-18 19:55:18,758 INFO L386 tUnfolder$Statistics]: existing Event has 315 ancestors and is cut-off event [2022-11-18 19:55:18,758 INFO L386 tUnfolder$Statistics]: existing Event has 309 ancestors and is cut-off event [2022-11-18 19:55:18,758 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-18 19:55:18,758 INFO L386 tUnfolder$Statistics]: existing Event has 360 ancestors and is cut-off event [2022-11-18 19:55:18,838 INFO L130 PetriNetUnfolder]: 1426/9500 cut-off events. [2022-11-18 19:55:18,838 INFO L131 PetriNetUnfolder]: For 125/194 co-relation queries the response was YES. [2022-11-18 19:55:18,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12100 conditions, 9500 events. 1426/9500 cut-off events. For 125/194 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 91482 event pairs, 846 based on Foata normal form. 0/7916 useless extension candidates. Maximal degree in co-relation 12063. Up to 1457 conditions per place. [2022-11-18 19:55:18,902 INFO L137 encePairwiseOnDemand]: 517/536 looper letters, 169 selfloop transitions, 28 changer transitions 0/561 dead transitions. [2022-11-18 19:55:18,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 561 transitions, 1559 flow [2022-11-18 19:55:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 19:55:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 19:55:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4973 transitions. [2022-11-18 19:55:18,914 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8434531886024423 [2022-11-18 19:55:18,914 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 4973 transitions. [2022-11-18 19:55:18,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 4973 transitions. [2022-11-18 19:55:18,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:55:18,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 4973 transitions. [2022-11-18 19:55:18,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 452.09090909090907) internal successors, (4973), 11 states have internal predecessors, (4973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:18,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 536.0) internal successors, (6432), 12 states have internal predecessors, (6432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:18,941 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 536.0) internal successors, (6432), 12 states have internal predecessors, (6432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:18,942 INFO L175 Difference]: Start difference. First operand has 440 places, 439 transitions, 905 flow. Second operand 11 states and 4973 transitions. [2022-11-18 19:55:18,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 561 transitions, 1559 flow [2022-11-18 19:55:18,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 561 transitions, 1559 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 19:55:18,953 INFO L231 Difference]: Finished difference. Result has 454 places, 456 transitions, 1038 flow [2022-11-18 19:55:18,954 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1038, PETRI_PLACES=454, PETRI_TRANSITIONS=456} [2022-11-18 19:55:18,955 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -16 predicate places. [2022-11-18 19:55:18,955 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 456 transitions, 1038 flow [2022-11-18 19:55:18,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 439.0) internal successors, (3073), 7 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:18,957 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:55:18,957 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:18,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 19:55:18,958 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-18 19:55:18,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:18,958 INFO L85 PathProgramCache]: Analyzing trace with hash 966475415, now seen corresponding path program 1 times [2022-11-18 19:55:18,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:18,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290851479] [2022-11-18 19:55:18,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:18,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:19,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:19,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290851479] [2022-11-18 19:55:19,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290851479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:19,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:19,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:55:19,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347909667] [2022-11-18 19:55:19,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:19,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:55:19,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:19,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:55:19,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:55:19,026 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 497 out of 536 [2022-11-18 19:55:19,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 456 transitions, 1038 flow. Second operand has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:19,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:55:19,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 497 of 536 [2022-11-18 19:55:19,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 19:55:19,817 INFO L130 PetriNetUnfolder]: 134/2993 cut-off events. [2022-11-18 19:55:19,817 INFO L131 PetriNetUnfolder]: For 122/157 co-relation queries the response was YES. [2022-11-18 19:55:19,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3401 conditions, 2993 events. 134/2993 cut-off events. For 122/157 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 20894 event pairs, 48 based on Foata normal form. 0/2725 useless extension candidates. Maximal degree in co-relation 3359. Up to 175 conditions per place. [2022-11-18 19:55:19,842 INFO L137 encePairwiseOnDemand]: 533/536 looper letters, 15 selfloop transitions, 1 changer transitions 0/458 dead transitions. [2022-11-18 19:55:19,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 458 transitions, 1077 flow [2022-11-18 19:55:19,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:55:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 19:55:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1509 transitions. [2022-11-18 19:55:19,847 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9384328358208955 [2022-11-18 19:55:19,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1509 transitions. [2022-11-18 19:55:19,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1509 transitions. [2022-11-18 19:55:19,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 19:55:19,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1509 transitions. [2022-11-18 19:55:19,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 503.0) internal successors, (1509), 3 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:19,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:19,857 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 536.0) internal successors, (2144), 4 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:19,858 INFO L175 Difference]: Start difference. First operand has 454 places, 456 transitions, 1038 flow. Second operand 3 states and 1509 transitions. [2022-11-18 19:55:19,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 458 transitions, 1077 flow [2022-11-18 19:55:19,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 458 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 19:55:19,870 INFO L231 Difference]: Finished difference. Result has 453 places, 455 transitions, 1036 flow [2022-11-18 19:55:19,871 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=536, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=453, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1036, PETRI_PLACES=453, PETRI_TRANSITIONS=455} [2022-11-18 19:55:19,873 INFO L288 CegarLoopForPetriNet]: 470 programPoint places, -17 predicate places. [2022-11-18 19:55:19,874 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 455 transitions, 1036 flow [2022-11-18 19:55:19,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 499.3333333333333) internal successors, (1498), 3 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:19,874 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 19:55:19,875 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:19,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 19:55:19,875 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2022-11-18 19:55:19,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:19,876 INFO L85 PathProgramCache]: Analyzing trace with hash 319214509, now seen corresponding path program 1 times [2022-11-18 19:55:19,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:19,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053760667] [2022-11-18 19:55:19,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:19,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:20,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:20,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053760667] [2022-11-18 19:55:20,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053760667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:55:20,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:55:20,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:55:20,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056291433] [2022-11-18 19:55:20,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:55:20,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:55:20,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:20,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:55:20,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:55:20,551 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 536 [2022-11-18 19:55:20,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 455 transitions, 1036 flow. Second operand has 6 states, 6 states have (on average 430.0) internal successors, (2580), 6 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:20,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 19:55:20,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 536 [2022-11-18 19:55:20,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand